UNSOLVED PROBLEMS

in Number Theory, Logic, and Cryptography

The Goldbach Conjecture 

The Goldbach Conjecture states that every even number greater than 2 is the sum of two primes.  A number is prime if it is divisible only by itself and 1.  So, for example, 36 = 17+19.

The problem is to prove the conjecture, or find a counter-example.

For further information, please see:

[1] http://mathworld.wolfram.com/GoldbachConjecture.html

[2] http://en.wikipedia.org/wiki/Goldbach's_conjecture

[3] http://primes.utm.edu/glossary/page.php?sort=GoldbachConjecture

* There are currently 0 proposed solutions on the solutions page.

[ Home ] [ Introduction ] [ What's New? ] [ FAQ ] [ Chromatic Number ] [ Collatz ] [ Dorabella Cipher ] [ Euler's Brick ] [ Goldbach ] [ Legendre ] [ Odd Perfect Number ] [ Riemann Hypothesis ] [ RSA Challenge ] [ Square of Squares ] [ Twin Primes ] [ Voynich Manuscript ] [ Zodiac ] [ Solutions ] [ Math Tuition ]

       Site developed and maintained by Tim Roberts .
       Last modified: August 01, 2007                        v 016