Siteadmin, Check users, nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW, oversight, Administrators
30,650
edits
Changes
Jump to navigation
Jump to search
Line 41:
Line 41: + + + + + +
merging Goldbach's conjecture
==Riemann hypothesis==
==Riemann hypothesis==
Most mathematicians believe a proof of the [[Riemann hypothesis]] is the best hope for discovering some pattern in the distribution of prime numbers. ''The Clay Mathematics Institute'' has offered a one million dollar prize for a proof of the Riemann hypothesis.<ref>http://www.claymath.org/millennium/Riemann_Hypothesis/</ref>
Most mathematicians believe a proof of the [[Riemann hypothesis]] is the best hope for discovering some pattern in the distribution of prime numbers. ''The Clay Mathematics Institute'' has offered a one million dollar prize for a proof of the Riemann hypothesis.<ref>http://www.claymath.org/millennium/Riemann_Hypothesis/</ref>
==Goldbach's conjecture==
Goldbach's conjecture asserts that every even [[integer]] greater than two is the sum of two [[prime]] numbers. For example: 4 = 2 + 2, 6 = 3 + 3, 8 = 3 + 5, and so on.
This conjecture is one of the oldest unsettled statements in mathematics. For centuries mathematicians have attempted to prove this statement, without success. The conjecture is known to hold for numbers less than 3 <math>\cdot</math>10<sup>17</sup>.
==Cryptography==
==Cryptography==