Goldbach's conjecture
Unproved, but checked by computer for every even number up to 4 × . History: 1742.
How to work it out
- 1
The statement:
- 2
Unproved, but checked by computer for every even number up to 4 × .
- 3
Below, the numbers in the table are computed by this site from the definition, not copied.
LaTeX source of the formulas on this page
\[ \text{every even } n > 2 \text{ is a sum of two primes} \]Ways to write each even number from 4 to 40 as a sum of two primes (computed)
| n | Number of ways | First way |
|---|---|---|
| 4 | 1 | 2 + 2 |
| 6 | 1 | 3 + 3 |
| 8 | 1 | 3 + 5 |
| 10 | 2 | 3 + 7 |
| 12 | 1 | 5 + 7 |
| 14 | 2 | 3 + 11 |
| 16 | 2 | 3 + 13 |
| 18 | 2 | 5 + 13 |
| 20 | 2 | 3 + 17 |
| 22 | 3 | 3 + 19 |
| 24 | 3 | 5 + 19 |
| 26 | 3 | 3 + 23 |
| 28 | 2 | 5 + 23 |
| 30 | 3 | 7 + 23 |
| 32 | 2 | 3 + 29 |
| 34 | 4 | 3 + 31 |
| 36 | 4 | 5 + 31 |
| 38 | 2 | 7 + 31 |
| 40 | 3 | 3 + 37 |
Questions
What is the goldbach's conjecture?
Unproved, but checked by computer for every even number up to 4 × .
Who is the Goldbach's conjecture associated with?
Leonhard Euler.