A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Hilbert's tenth problem over $\mathbb Q$
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Hamilton's Revenge <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, we can't help you. No Lean version yet. Some unformalized games could have issues!
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:primes, fractions, patience Levels:2
Category:Number theory Lean version:not yet
Rate this game! 4.4 out of 5 (1,297 votes)

>>> How to Play <<<
Hilbert’s tenth problem over ℚ. Proves that no algorithm decides whether an integer-coefficient polynomial in an arbitrary number of variables has a rational zero, resolving Hilbert's tenth problem over ℚ negatively.

>>> Level Select <<<
released 2026-10-06  |  2 theorems · 18 lemmas · 28 proofs · 30,155 words  |  PLAY LEVEL 1 »  (pdf)
We give a negative answer to Hilbert's tenth problem over the rational numbers: no algorithm decides whether a polynomial with integer coefficients has a rational zero. The number of variables is part of the input.
released 2026-10-07  |  6 theorems · 47 lemmas · 71 proofs · 48,360 words  |  PLAY LEVEL 2 »  (pdf)
We prove a pointwise 2-converse for elliptic curves over $\mathbf Q$ with nonzero rational two-torsion: if the $2^\infty$-Selmer corank is zero or one, then the analytic rank and Mordell–Weil rank equal that corank, and the Shafarevich–Tate group is finite. The result allows arbitrary reduction at 2.

More Number theory Games!
Erdős’s short Egyptian-fraction conjecture PLAYABLE!Positive lower density of large prime gapsIntegral density on curve character varietiesThe Gaussian moat conjecture PLAYABLE!
Artin's primitive root conjecture: infinitude for every base HOT!Modularity over imaginary quadratic fieldsUchida's conjecture for open Galois homomorphismsMilne's rationality conjecture

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