ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A positive integer nn is powerful if p2∣np^2\mid n for every prime pp dividing nn. Three positive integers are consecutive powerful numbers if they have the form n,n+1,n+2n,n+1,n+2 and each is powerful. Erdős–Mollin–Walsh conjecture. No three consecutive powerful numbers exist. The paper studies this longstanding non-existence problem using Pell equations, elliptic curves, and second-order recurrences; the conjecture remains unresolved in the supplied source.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.