Erdős Problem #390 — Factorizations of factorials into large factors
For a positive integer , consider all representations
where is a positive integer and are integers satisfying . When such representations exist, let be the minimum possible value of the largest factor . The question concerns sufficiently large positive integers (for which existence is guaranteed by the known bounds): does there exist a constant such that
Erdős Problem #390 Erdős, Guy, and Selfridge (1982)
Background
The question belongs to a broader study of expressing a factorial as a product of factors under different restrictions on their size and whether repetitions are allowed. It was posed in connection with Erdős and Graham’s 1980 problem collection and was taken up by Erdős, Guy, and Selfridge in their 1982 paper, “Another Property of 239 and Some Related Questions.” Their results highlight the role of distinctness: for , no factorization of into distinct integers all greater than can have every factor at most , whereas if repetitions are allowed, such a factorization exists for every . Erdős, Guy, and Selfridge (1982) Zentralblatt review of Erdős, Guy, and Selfridge (1982) Erdős and Graham (1980)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
No public discussion or published progress appears to have been found for this problem.
No public discussion or published progress was found.
Current status (as of September 2026): The problem appears open, with no recorded activity.
Solutions 0
No solutions have been posted yet.