Erdős Problem #1107 — Let r≥ 2. A number n is r-powerful if for every prime p which divides n we have p^r| n. Is every large integer the sum of at most r+1 many r-powerful numbers?
Statement
Let . A number is -powerful if for every prime which divides we have . Is every large integer the sum of at most 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.