Skip to content

Erdős problem 938

Let A={n1<n2<}A=\{n_1 < n_2 < \cdots\} be the sequence of powerful numbers (if pnp\mid n then p2np^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}?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#938
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page