ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A natural number nn is powerful if every prime divisor pp of nn also satisfies p2∣np^2\mid n. Prove that there are infinitely many pairs (a,d)∈N×N(a,d)\in\mathbb{N}\times\mathbb{N} such that d>0d>0, the four numbers

a,a+d,a+2d,a+3da,\quad a+d,\quad a+2d,\quad a+3d

are all powerful, and every two distinct numbers among them are coprime.

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.