UNSOLVED PROBLEMS |

In Number Theory, Logic, and Cryptography |

Goldbach’s 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
You can check for contributions to this problem on the solutions page.
——————————–- This web site developed and maintained by Tim S Roberts Email: timro21@gmail.com |