Erdős Problem #1108 — Let A={∑n∈Sn!:S⊂N finite}.A = \left\{ \sum_{n\in S}n! : S\subset \mathbb{N}\textrm{ finite}\right\}. If k≥2k\geq 2, then does AA contain only finitely many kkth powers?

About 38 years old · traced to

Let A={∑n∈Sn!:S⊂N finite}.A = \left\{ \sum_{n\in S}n! : S\subset \mathbb{N}\textrm{ finite}\right\}. If k≥2k\geq 2, then does AA contain only finitely many kkth powers? Does it contain only finitely many powerful numbers?

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.