Goldbach Conjecture
Goldbach’s conjecture is one of the oldest and most famous unsolved problems in number theory. First proposed by Prussian mathematician Christian Goldbach in 1742 in a letter to Leonhard Euler, it states that every even integer greater than 2 can be expressed as the sum of two prime numbers. For example, 4 = 2+2, 6 = 3+3, 8 = 3+5, and 10 = 5+5. Despite its simple formulation, the conjecture has resisted proof for nearly three centuries.
Verification and Evidence
While no general proof exists, computational verification has confirmed the conjecture for extremely large numbers. Modern computers have tested all even integers up to 4 × 10^18 without finding a counterexample. This empirical evidence strongly suggests the conjecture is true, yet computational verification alone cannot constitute a mathematical proof. Many mathematicians believe a proof likely exists but remains beyond current techniques.
Related Formulations
Variants of Goldbach’s conjecture have emerged over time. The weak Goldbach conjecture, also called the ternary Goldbach conjecture, states that every odd integer greater than 5 can be expressed as the sum of three primes. This weaker version was proven in 2013 by Harald Helfgott, representing significant progress on the original problem. The strong conjecture—the original formulation—remains open despite intense research efforts across multiple mathematical domains.