← All problems

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

1 year old · traced to

For each positive integer nn, let A(n)A(n) be the least positive integer kk for which there are positive integers a1,…,aka_1, \ldots,a_k satisfying

1≤a1≤⋯≤ak≤n2,n!=∏i=1kai.1\le a_1\le\cdots\le a_k\le n^2, \qquad n!=\prod_{i=1}^k a_i.

The question is whether, as n→∞n\to\infty,

A(n)=n2−n2log⁡n+o ⁣(nlog⁡n).A(n)=\frac n2-\frac{n}{2\log n}+o\!\left(\frac n{\log n}\right).

Erdős Problems #392

Background

This factorial-factorization problem is listed as Erdős Problem #392, with an original reference given as ErGr80, p. 75. It asks how the minimum number of factors changes when their permitted maximum is changed; here the maximum is quadratic in nn. Erdős Problems #392

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.