← All problems

Erdős Problem #393 — Minimum-width factorizations of factorials

46 years old · traced to

Let f(n)f(n) denote the minimal m≥1m\geq 1 such that

n!=a1⋯atn! = a_1\cdots a_t

with a1<⋯<at=a1+ma_1<\cdots<a_t=a_1+m. What is the behaviour of f(n)f(n)? Erdős Problems #393

Background

Erdős and Graham recorded the question in 1980 and remarked that they did not know whether f(n)=1f(n)=1 for infinitely many nn; 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

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.