Erdős Problem #392 — Factorizations of factorials with bounded factors
For each positive integer , let be the least positive integer for which there are positive integers satisfying
The question is whether, as ,
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 . Erdős Problems #392
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.