Let f(n) denote the minimal m≥ 1 such that n! = a_1… a_t with a_1<… <a_t=a_1+m. What is the behaviour of f(n)?

Erdős Problem #393 — Let $f(n)$ denote the minimal $m\geq 1$ such that $n! = a_1\cdots a_t$ with $a_1<\cdots <a_t=a_1+m$ . What is the behaviour of $f(n)$ ?

Let $f(n)$ denote the minimal $m\geq 1$ such that $n! = a_1\cdots a_t$ with $a_1<\cdots <a_t=a_1+m$ . What is the behaviour of $f(n)$ ?

References

Posted 1 month ago · edited 3 weeks ago

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

No solutions have been posted yet.