Skip to content

Erdős problem 938

Let A={n1<n2<⋯ }A=\{n_1 < n_2 < \cdots\} be the sequence of powerful numbers (if p∣np\mid n then p2∣np^2\mid n). Are there only finitely many three-term progressions of consecutive terms nk,nk+1,nk+2n_k,n_{k+1},n_{k+2}?

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

938.lean

Retained formal statement1 of 1

Let A={n1<n2<⋯ }A=\{n_1 < n_2 < \cdots\} be the sequence of powerful numbers (if p∣np\mid n then p2∣np^2\mid n). Are there only finitely many three-term progressions of consecutive terms nk,nk+1,nk+2n_k,n_{k+1},n_{k+2}?

FormalConjectures/ErdosProblems/938.leanErdos938.erdos_9384 linesExact file
True ↔  {P |      (↑P).IsAPOfLength 3 ∧        ∃ k, P = {Nat.nth Nat.Powerful k, Nat.nth Nat.Powerful (k + 1), Nat.nth Nat.Powerful (k + 2)}}.Finite
OpenStatement only, no proof