Erdős–Mollin–Walsh conjecture
Statement
Call a positive integer powerful if for every prime with one also has ; equivalently, is powerful if and only if for some positive integers . Writing the prime factorization as , this says that for every .
For every integer , the three consecutive integers , , are not all powerful; that is, there is no such that each of , , satisfies the condition that every prime dividing it divides it at least twice.
Record
- Added
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.