A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Independent largest prime factors of consecutive integers
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.5 out of 5 (1,544 votes)

>>> How to Play <<<
Independent largest prime factors of consecutive integers. Resolves the Erdős–Pomerance joint Dickman conjecture: the logarithmic sizes of the largest prime factors of n and $n+1$ are asymptotically independent in ordinary natural density. In particular, the integers satisfying $P^+(n)\lt P^+(n+1)$ have density 1/2.

>>> Level Select <<<
released 2026-09-24  |  3 theorems · 25 lemmas · 36 proofs · 33,931 words  |  PLAY LEVEL 1 »  (pdf)
Let $P^+(n)$ denote the largest prime factor of n. We prove that $\log P^+(n)/\log n$ and $\log P^+(n+1)/\log n$ are asymptotically independent in ordinary natural density, with Dickman marginals. This resolves the Erdős–Pomerance joint Dickman conjecture positively and implies that the ordering $P^+(n)\lt P^+(n+1)$ has natural density 1/2.

More Number theory Games!
The quasi-Riemann hypothesis PLAYABLE!Hilbert's tenth problem over $\mathbb Q$ HOT!Irrationality of Catalan's constant HOT!Goldfeld's conjecture
Two-point Chowla and the corrected binary Elliott conjectureThe Deligne–Drinfeld conjectureBogomolov–Pop and Milnor $K$-theoretic reconstructionFontaine–Mazur modularity at the prime $2$ and $2$-adic pro-modularity

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