Erdős Problem #137 — We say that N is powerful if whenever p| N we also have p^2| N. Let k≥ 3. Can the product of any k consecutive positive integers ever be powerful?
Statement
We say that is powerful if whenever we also have . Let . Can the product of any consecutive positive integers ever be powerful?
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.