A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Egyptian Fractions
based on Result #025: Erdős’s short Egyptian-fraction conjecture
>>> Check out Coolmath's new Guess the Hot Spot <<<

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.6 out of 5 (2,941 votes)

>>> How to Play <<<
Short Egyptian fractions. Every rational $a/b$ with $1\le a\lt b$ is a sum of $O(\log\log b)$ distinct positive unit fractions. The worst-case minimum number of terms has the same order, resolving Erdős’s conjecture on short Egyptian fractions.

>>> Level Select <<<
released 2026-09-25  |  1 theorem · 14 lemmas · 19 proofs · 12,344 words  |  PLAY LEVEL 1 »  (pdf)
We prove a conjecture of Erdős: for every sufficiently large integer b, every rational number $a/b$ with $1\le a\lt b$ is a sum of $O(\log\log b)$ distinct positive unit fractions, with an absolute implied constant. This order is best possible when the numerator varies. We also show that both the number of expansions of 1 with exactly k distinct terms and the least integer at least 2 that never occurs as a denominator in such an expansion grow doubly exponentially in k: their double logarithms have order k.

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