Erdős Problem #393 — Minimum-width factorizations of factorials
Let denote the minimal such that
with . What is the behaviour of ? Erdős Problems #393
Background
Erdős and Graham recorded the question in 1980 and remarked that they did not know whether for infinitely many ; this is the case of a factorial represented as a product of two consecutive integers. The problem asks more broadly how small the difference between the largest and smallest factors in such a product can be. Erdős and Graham (1980)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Never refreshed
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.