Erdős Problem #941 — Three powerful numbers representing every large integer
Statement
Call a positive integer powerful if every prime dividing it does so to exponent at least two. Is every sufficiently large integer a sum of three 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.