Erdős Problem #1108 — Let A = ∑_n∈ Sn! : S⊂ N finite. If k≥ 2, then does A contain only finitely many kth powers?
Statement
Let If , then does contain only finitely many th powers? Does it contain only finitely many powerful numbers?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.