Erdős Problem #1108 — Powers and powerful numbers in factorial sumsets
For a finite set of natural numbers , let
Here is the factorial of . A positive integer is powerful if every prime exponent in its prime factorization is at least . Erdős Problem #1108 Brindza and Erdős (1991), review by Stroeker
For each fixed integer , does contain only finitely many th powers? Does contain only finitely many powerful numbers? Erdős Problem #1108
Background
Erdős asked this question at Oberwolfach in 1988. The factorials grow rapidly, but allowing arbitrary finite subsets means that the number of summands is not fixed. The problem record connects the question to one discussed by Mahler with Erdős shortly before Mahler’s death in 1988: for sums of distinct powers , Mahler proved that there are infinitely many squares when and exhibited the square for base . This comparison motivates the factorial question but does not settle it. Erdős Problem #1108
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
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.