Skip to content

Erdős problem 937

Are there infinitely many four-term arithmetic progressions of coprime powerful numbers? (A number nn is *powerful* if p∣n→p2∣np \mid n \to p^2 \mid n; Nat.Powerful.)

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

937.lean

Retained formal statement1 of 2

Are there infinitely many four-term arithmetic progressions of coprime powerful numbers? (A number nn is *powerful* if p∣n→p2∣np \mid n \to p^2 \mid n; Nat.Powerful.)

Erdős [Er76d] asked this; the answer is yes: Bajpai, Bennett and Chan [BBC24] proved that there are infinitely many four-term arithmetic progressions of pairwise coprime powerful numbers. (Without coprimality this is easy, and by a theorem of Fermat there are no four *squares* in arithmetic progression.)

FormalConjectures/ErdosProblems/937.leanErdos937.erdos_9371 lineExact file
True ↔ {p | Erdos937.IsCoprimePowerfulAP4 p.1 p.2}.Infinite
SolvedStatement only, no proof