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.)

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/937.lean

Formal Conjectures

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

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page