Prime Addition Pairs (p₁ + p₂ = n)

Goldbach Calculator

Find all pairs of prime numbers that sum to an even number under Goldbach's Conjecture: n = p₁ + p₂.

Try Even Numbers:
Prime Pairs Found 2
28 = 5 + 23
Closest Pair (Smallest Gap) 11 + 17 (diff: 6)
Widest Pair (Largest Gap) 5 + 23 (diff: 18)
All Prime Pairs (p₁ + p₂ = n)
01

Interactive Tool: Hardy-Littlewood Pair Predictor

How many prime pairs add up to a big even number? In 1923, mathematicians G.H. Hardy and J.E. Littlewood published a famous formula predicting this count. It looks at the size of the number and its odd prime factors to estimate the number of pairs. Try any even number below to see how close the prediction gets to the real count:

Quick Examples:
Tested Number n = 1,000
Actual Prime Pairs 28 pairs
Formula Prediction ≈ 27.8 pairs
Prediction Accuracy 99.3% match
Odd prime factor multiplier for 1,000 (factor: 5): multiplier = 1.333×.
02

Strong vs. Weak Goldbach Conjecture

Goldbach's idea comes in two versions:

Strong Rule (2 Primes)

Every even number 4 or greater is the sum of two prime numbers (n = p₁ + p₂).

Unsolved (Tested up to 4 × 10¹⁸)
Weak Rule (3 Primes)

Every odd number 7 or greater is the sum of three prime numbers (n = p₁ + p₂ + p₃).

Proven by Harald Helfgott in 2013

Three-Prime Explorer (Odd Numbers ≥ 7)

Proven Rule

Click an odd number to see it split into three prime numbers:

03

The Goldbach Comet: Why Multiples of 6 Have More Pairs

If you plot the number of prime pairs for each even number on a graph, the dots form a pattern that looks just like a glowing comet streaking upward. Numbers divisible by 6 always have noticeably more pairs than other even numbers of similar size.

Goldbach Comet Explorer

Multiples of 6

Compare pair counts across even numbers to see the spike for multiples of 6:

Prime distribution density curve governing the average growth of Goldbach prime pairs
Prime Density Drives the Goldbach Comet Because prime density follows 1 / ln(N), the expected count of prime pairs G(N) grows roughly like N / (ln N)^2.
04

Goldbach Pair Milestone Table

Click any landmark even number below to test the calculator, view all prime pairs, and explore how the counts grow:

Even Number n Prime Pairs Example Pair Type Why It Matters Action
n = 4 1 2 + 2 Smallest Base Case Only pair using the even prime 2
n = 6 1 3 + 3 Smallest Odd Sum Smallest sum of odd primes
n = 8 1 3 + 5 Single Pair Smallest using two different primes
n = 10 2 3 + 7, 5 + 5 First Multiple Pairs First number with more than 1 pair
n = 12 1 5 + 7 Multiple of 6 Smallest gap of 2 (twin primes)
n = 14 2 3 + 11, 7 + 7 Standard Even Balanced around midpoint 7
n = 16 2 3 + 13, 5 + 11 Power of Two 16 with two distinct odd prime pairs
n = 20 2 3 + 17, 7 + 13 Decade Number Midpoint 10 is composite
n = 28 2 5 + 23, 11 + 17 Perfect Number Second perfect number 28
n = 30 3 7 + 23, 11 + 19, 13 + 17 Multiple of 2, 3, 5 First big surge: 3 pairs
n = 50 4 3 + 47, 7 + 43, 13 + 37, 19 + 31 Half-Century 4 symmetric pairs
n = 60 6 7 + 53, 13 + 47, 17 + 43... Multiple of 6 Comet spike: 6 distinct pairs
n = 84 8 5 + 79, 11 + 73, 17 + 67... Multiple of 6 High density band on Goldbach Comet
n = 90 9 7 + 83, 11 + 79, 17 + 73... Pre-100 Peak 9 pairs before reaching 100
n = 100 6 3 + 97, 11 + 89, 17 + 83... Century Milestone Classic school problem; exactly 6 pairs
n = 120 12 7 + 113, 11 + 109, 13 + 107... Multiple of 6 and 30 Surges to 12 prime pairs
n = 180 14 7 + 173, 13 + 167, 17 + 163... Multiple of 30 14 pairs across 180
n = 210 19 11 + 199, 13 + 197, 17 + 193... Multiple of 2, 3, 5, 7 Massive surge to 19 pairs
n = 500 13 13 + 487, 31 + 469... Mid-Millennium 13 pairs for non-multiple of 3
n = 1,000 28 3 + 997, 17 + 983, 23 + 977... Millennium Milestone 28 valid pairs at 1,000
05

Step-by-Step Worked Examples

Follow these 4 clear examples to see how to find prime pairs that add up to an even number:

Example 1

Breaking Down 10 — First Number with Two Pairs

Step 1: List all primes up to half of 10 (n/2 = 5): 2, 3, 5.
Step 2: Test 2: 10 - 2 = 8 (not prime, skip).
Step 3: Test 3: 10 - 3 = 7 (prime! Valid pair: 3 + 7 = 10).
Step 4: Test 5: 10 - 5 = 5 (prime! Valid pair: 5 + 5 = 10).
Conclusion: Exactly 2 prime pairs: (3, 7) and (5, 5).

Example 2

Breaking Down 30 — The Bonus of Many Prime Factors

Why 30 has more pairs: 30 = 2 × 3 × 5. Any number that does not share factors with 2, 3, or 5 is prime, and its leftover pair also avoids these factors!
Primes up to 15: 2, 3, 5, 7, 11, 13.
• 30 - 7 = 23 (Prime!)
• 30 - 11 = 19 (Prime!)
• 30 - 13 = 17 (Prime!)
Result: 3 prime pairs found: (7, 23), (11, 19), (13, 17).

Example 3

Breaking Down 100 — The Century Mark

Halfway Point: Half of 100 is 50. There are 15 primes up to 50.
Testing Pair Partners:
• 100 - 3 = 97 (Prime!)
• 100 - 11 = 89 (Prime!)
• 100 - 17 = 83 (Prime!)
• 100 - 29 = 71 (Prime!)
• 100 - 41 = 59 (Prime!)
• 100 - 47 = 53 (Prime!)
Result: Exactly 6 Goldbach prime pairs.

Example 4

Chen's Theorem — Prime + Almost Prime

The Rule: In 1966, Chen Jingrun proved that every large even number can be written as a prime plus another number that has at most two prime factors (a prime or semiprime).
Example for 14:
• Prime + Prime: 3 + 11 = 14, 7 + 7 = 14.
• Prime + Semiprime: 5 + 9 = 14 (where 9 = 3 × 3).
Chen's theorem is the closest mathematicians have ever come to proving Goldbach's conjecture!

06

How Computers Check Goldbach's Rule

Comparing the methods computer programs use to find prime pairs and test Goldbach's conjecture:

Search Method Speed (Time) Memory Used Best Used For Performance Note
Checking Each Number One by One Slowest Tiny Small numbers (up to 10,000) Too slow for big numbers
Instant Table Lookup (Our Engine) Fast (One quick pass) Small (under 1 MB) Instant browser searches up to 1,000,000 Instant (< 2 ms)
Segmented Sieve Two-Pointer Very fast Tiny (32 KB CPU cache) Ranges up to 1 trillion Fast across billions
Supercomputer Fast Math (FFT) High-speed math High memory World-record verification bounds Tested up to 4 × 10¹⁸

Related Additive & Sequence Tools

Frequently Asked Questions

What is Goldbach's Conjecture?

In 1742, mathematician Christian Goldbach proposed a famous idea in a letter to Leonhard Euler: every even number greater than 2 can be written as the sum of two prime numbers (n = p₁ + p₂). For example, 10 = 3 + 7 (or 5 + 5), and 28 = 5 + 23 (or 11 + 17).

Has Goldbach's Conjecture been mathematically proven?

Not yet! Computers have tested every even number up to 4 quintillion (4 × 10¹⁸) and every single one works. However, checking specific examples—even quintillions of them—is not the same as a mathematical proof that guarantees it works forever.

What is the Weak Goldbach Conjecture and is it proven?

The Weak Goldbach Conjecture states that every odd number greater than 5 can be written as the sum of three prime numbers (for example, 35 = 3 + 13 + 19). In 2013, mathematician Harald Helfgott published a complete mathematical proof of this three-prime version.

What is the Goldbach Comet?

If you plot a chart of how many prime pairs add up to each even number, the scatter plot looks just like a glowing comet streaking upward! Multiples of 6 (like 12, 30, 60, 120) always have noticeably more prime pairs than other numbers.

What is Chen's Theorem regarding Goldbach's conjecture?

In 1966, mathematician Chen Jingrun proved that every large even number can be written as either two prime numbers, or one prime plus a semiprime (a number made by multiplying two primes, like 9 = 3 × 3). This is the closest anyone has come to proving Goldbach's rule.

Can we predict how many prime pairs an even number will have?

Yes! In 1923, mathematicians G.H. Hardy and J.E. Littlewood created a prediction formula that estimates the number of prime pairs for any even number with over 99% accuracy.

Why must the input number be even and at least 4?

Because adding two odd prime numbers always gives an even number. The only even prime is 2, and 2 + 2 = 4 is the smallest possible sum of two primes. That is why the conjecture starts at 4.

How does the calculator find all prime pairs so quickly?

Instead of guessing blindly, the calculator looks through primes up to half your number (n/2). For each prime p, it subtracts q = n - p and looks up in memory whether q is also prime in under a microsecond.