← All problems

Erdős Problem #1108 — Powers and powerful numbers in factorial sumsets

38 years old · traced to

For a finite set of natural numbers SS, let

A={∑n∈Sn!:S⊂N finite}.A=\left\{\sum_{n\in S}n! : S\subset\mathbb{N}\text{ finite}\right\}.

Here n!n! is the factorial of nn. A positive integer is powerful if every prime exponent in its prime factorization is at least 22. Erdős Problem #1108 Brindza and Erdős (1991), review by Stroeker

For each fixed integer k≥2k\ge 2, does AA contain only finitely many kkth powers? Does AA 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 knk^n, Mahler proved that there are infinitely many squares when k≤4k\le 4 and exhibited the square 400=1+7+72+73400=1+7+7^2+7^3 for base 77. This comparison motivates the factorial question but does not settle it. Erdős Problem #1108

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.