Erdős Problem #400 — Factorial divisibility and additive excess
Fix an integer . For each positive integer , let be the maximum of over nonnegative integers satisfying :
The maximum exists: each admissible is at most , and the admissible set is nonempty. Allowing zero rather than requiring positive does not change the maximum, since replacing any zero by one leaves the factorial product unchanged and increases the sum. Erdős Problems #400 Prime-Power Rarefaction and a Density-One Lower Bound for Erdős Problem 400, arXiv:2606.23661v2
For this fixed , the question is whether there is a constant such that both
and, for every ,
The second condition expresses the proposed almost-all asymptotic, with an exceptional set of density zero. Erdős Problems #400 Prime-Power Rarefaction and a Density-One Lower Bound for Erdős Problem 400, arXiv:2606.23661v2
Background
Erdős and Graham recorded the problem in Old and New Problems and Results in Combinatorial Number Theory (1980, p. 77). Its central tension is that factorial divisibility imposes simultaneous constraints at every prime, while the quantity being maximized is the excess of the sum of the factorial arguments over . In particular, admissibility is equivalent to the inequalities for every prime , where is the exponent of in . Erdős and Graham, ErGr80, p. 77 Prime-Power Rarefaction and a Density-One Lower Bound for Erdős Problem 400, arXiv:2606.23661v2
The original account notes the elementary pointwise estimate , while observing that the best possible constant was unknown. The later bounds below sharpen this order estimate and address the average and density-one questions quantitatively. Erdős Problems #400 Prime-Power Rarefaction and a Density-One Lower Bound for Erdős Problem 400, arXiv:2606.23661v2
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.