Erdős Problem #392 — Factorizations of factorials with bounded factors

About 1 year old · traced to

For each positive integer nn, let A(n)A(n) be the least value of t+1t+1 for which there exist natural numbers a0,…,ata_0,\ldots,a_t satisfying a0≤⋯≤at≤n2a_0\le\cdots\le a_t\le n^2 and

n!=∏i=0tai.n!=\prod_{i=0}^{t}a_i.

Prove that

A(n)=n2−n2log⁡n+o ⁣(nlog⁡n)(n→∞).A(n)=\frac n2-\frac{n}{2\log n}+o\!\left(\frac n{\log n}\right) \qquad(n\to\infty).
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.