Interactive · First primes
Every even number and its first-prime list.
Pick a ceiling. For each even number E up to it, the list shows every first prime — the smaller prime p ≤ E/2 of each Goldbach pair, where E − p is also prime. Small numbers get one entry (6 → 3); 100 gets six: 3, 11, 17, 29, 41, 47. The list only ever grows longer — never empty.
up to 50up to 100up to 200up to 500up to 1000
Each row is an even number E. The chips are its first primes — every prime p with p ≤ E/2 where E − p is also prime (the smaller half of each Goldbach pair). The count grows with E.
4
1
2
6
1
3
8
1
3
10
2
35
12
1
5
14
2
37
16
2
35
18
2
57
20
2
37
22
3
3511
24
3
5711
26
3
3713
28
2
511
30
3
71113
32
2
313
34
4
351117
36
4
571317
38
2
719
40
3
31117
42
4
5111319
44
3
3713
46
4
351723
48
5
57111719
50
4
371319
52
3
51123
54
5
711131723
56
3
31319
58
4
5111729
60
6
71317192329
62
3
31931
64
5
35111723
66
6
5713192329
68
2
731
70
5
311172329
72
6
51113192931
74
5
37133137
76
5
35172329
78
7
571117193137
80
4
7131937
82
5
311232941
84
8
511131723313741
86
5
37131943
88
4
5172941
90
9
71117192329313743
92
4
3131931
94
5
511234147
96
7
7131723293743
98
3
193137
100
6
31117294147
That every row has at least one chip is exactly Goldbach's conjecture. See the folded-strip write-up for why proving “never empty” for all E is the hard part.