Goldbach's Conjecture — Definition, Formula & Examples

Goldbach's Conjecture is the claim that every even integer greater than 2 can be written as the sum of two prime numbers. Proposed in 1742, it has been verified for enormous numbers but has never been formally proven.

For every even integer $n > 2$ , there exist primes $p$ and $q$ such that $n = p + q$ . This statement remains an open problem in number theory — no proof or counterexample has been found despite extensive computational verification up to at least $4 \times 10^{18}$ .

Key Formula

n = p + q, \quad n \in 2\mathbb{Z},\; n > 2,\; p \text{ and } q \text{ prime}

Where:

$n$ = Any even integer greater than 2
$p, q$ = Prime numbers whose sum equals n

How It Works

To check Goldbach's Conjecture for a specific even number, you search for at least one pair of primes that sum to it. For small numbers this is easy:

8 = 3 + 5

. As numbers grow, there are typically many valid pairs, not fewer. Mathematicians have verified the conjecture computationally for all even numbers up to staggeringly large bounds, yet a general proof covering all even numbers remains elusive. The conjecture is considered almost certainly true, but "almost certainly" is not a proof.

Worked Example

Problem: Verify Goldbach's Conjecture for the even number 30 by finding all pairs of primes that sum to 30.

List primes up to 30: The primes less than 30 are:

2, 3, 5, 7, 11, 13, 17, 19, 23, 29

Find pairs summing to 30: Check each prime p and see if 30 − p is also prime:

7 + 23 = 30, \quad 11 + 19 = 30, \quad 13 + 17 = 30

Conclusion: Three distinct pairs of primes sum to 30, confirming the conjecture for this case.

Answer: 30 = 7 + 23 = 11 + 19 = 13 + 17. The conjecture holds for 30 with three valid prime pairs.

Why It Matters

Goldbach's Conjecture is one of the oldest unsolved problems in all of mathematics, making it a classic example of how simple-sounding statements can be extraordinarily hard to prove. Working with it builds familiarity with prime numbers and additive number theory. It also appears in math competitions and is a gateway to deeper topics like the distribution of primes and analytic number theory.

Common Mistakes

Mistake: Assuming the conjecture has been proven because it has been verified for many numbers.

Correction: Computational verification, no matter how extensive, is not a proof. The conjecture remains unproven for all even integers — a single counterexample would disprove it, and no general argument has confirmed it.