Erdős Problem #391 — The smallest factor in an ordered factorization of a factorial
For each positive integer , let be the largest possible smallest factor in an ordered factorization of into exactly positive integers:
Determine the second-order asymptotic behavior of . In particular, is as , and does there exist a constant such that
for infinitely many integers ? Erdős Problem #391 Alexeev, Conway, Rosenfeld, Sutherland, Tao, Uhr, and Ventullo (2025 preprint)
Background
The problem appears in Erdős and Graham’s 1980 collection. The arithmetic–geometric mean inequality gives , so Stirling’s formula yields the upper bound . Erdős later reported that he, Selfridge, and Straus had obtained the matching asymptotic lower bound, but the proof could not be recovered after Straus’s death; Erdős therefore described the assertion as a conjecture. Alladi and Grinstead studied related factorial decompositions with the factors restricted to prime powers. Erdős Problem #391 Erdős (1996) Alladi and Grinstead (1977)
A useful way to view the construction is to start from the standard factorization and redistribute prime factors among the factors, seeking to raise the smallest one while preserving the total product. This prime-factor rearrangement also features in the recent asymptotic work. Alexeev, Conway, Rosenfeld, Sutherland, Tao, Uhr, and Ventullo (2025 preprint)
References
P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).
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.