Erdős problem 937

Are there infinitely many four-term arithmetic progressions of coprime powerful numbers? (A number $n$ is powerful if $p \mid n \to p^2 \mid n$ ; `Nat.Powerful`.)

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

937.lean

Retained formal statement2 of 2

Sanity check for IsCoprimePowerfulAP4: the progression $0, 1, 2, 3$ is not a valid example, since $2$ is not powerful.

FormalConjectures/ErdosProblems/937.leanErdos937.not_isCoprimePowerfulAP4_zero_one1 lineExact file

1¬Erdos937.IsCoprimePowerfulAP4 0 1

TestStatement only, no proof