Erdős Problem #364 — Consecutive powerful numbers
Statement
Prove that there is no natural number such that , , and are all powerful numbers, where a natural number is powerful if every prime divisor of it occurs with exponent at least .
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.