A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
An asymptotic formula for the number of totients
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

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 (794 votes)

>>> How to Play <<<
An asymptotic formula for the number of totients. Gives an asymptotic equivalent for the number $V(x)$ of distinct totient values up to x, with a positive bounded phase-dependent factor determined by convergent arithmetic approximations. In particular, $V(cx)/V(x)\to c$ for every fixed c > 0, answering Erdős and Hall’s scaling question.

>>> Level Select <<<
released 2026-09-25  |  2 theorems · 12 lemmas · 21 proofs · 13,885 words  |  PLAY LEVEL 1 »  (pdf)
Let $V(x)$ count the distinct values of Euler's totient function up to x. We give an explicit asymptotic equivalent for $V(x)$. Its coefficient is a uniform limit of functions defined from finite arithmetic data. We also prove that $V(cx)/V(x)\to c$ as $x\to\infty$ for every fixed c > 0, answering a question of Erdős and Hall.

More Number theory Games!
Hilbert's tenth problem over $\mathbb Q$ HOT!Irrationality of Catalan's constant HOT!Goldfeld's conjectureTwo-point Chowla and the corrected binary Elliott conjecture
The Deligne–Drinfeld conjectureBogomolov–Pop and Milnor $K$-theoretic reconstructionFontaine–Mazur modularity at the prime $2$ and $2$-adic pro-modularityThe Ford–Konyagin–Luca conjecture on prime predecessors

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