Erdős Problem #731 — Smallest nondivisors of central binomial coefficients
Find some reasonable function such that, for almost all integers , the least integer such that satisfies
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
A new preprint answers the question negatively under a natural smoothness interpretation, while the completely unrestricted version remains open.
Erdős, Graham, Ruzsa, and Straus posed the problem in 1975: determine whether the least integer failing to divide the central binomial coefficient is asymptotic to a reasonable function for almost all inputs.
Known results
- Erdős, Graham, Ruzsa, and Straus (1975) recorded the coarse estimate for almost all .
June 2026 dyadic-regularity resolution
A preprint proves that no dyadically regular function can satisfy in natural density. It also establishes the density-tight scale , while proving persistent multiplicative spread on every sufficiently large dyadic block.
Current status (as of June 2026): The problem is resolved negatively for dyadically regular , but the original question without that restriction remains open.
Sources
Solutions 0
No solutions have been posted yet.