A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Ostmann's inverse Goldbach conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Color the Plane <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:primes, fractions, patience Levels:1
Category:Number theory Lean version:YES! ✔
Rate this game! 4.2 out of 5 (5,138 votes)

>>> How to Play <<<
Ostmann’s inverse Goldbach conjecture. Proves that no finite modification of the primes can be written as $A+B$ with $A,B\subseteq\mathbb Z_{\ge0}$ each containing at least two elements. This resolves Ostmann's inverse Goldbach conjecture on additive indecomposability.

>>> Level Select <<<
released 2026-09-24  |  2 theorems · 8 lemmas · 11 proofs · 34,977 words  |  PLAY LEVEL 1 »  (pdf)
We prove Ostmann's inverse Goldbach conjecture: no set differing from the primes by finitely many elements can be written as $A+B$, where A and B are sets of nonnegative integers with at least two elements each.

More Number theory Games!
The Ford–Konyagin–Luca conjecture on prime predecessorsIndependent largest prime factors of consecutive integersRestricted geometric Langlands, generic Ramanujan and Arthur parametersTorus-packet equidistribution in prime, quartic, and sextic degrees
Zilber–Pink in abelian varieties and the Siegel threefoldThe irrationality exponent of $\pi$ is $2$ HOT!The Margulis–Platonov conjecture over global fieldsThe $p$-adic section conjecture

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games