Erdős problem 938Let 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}?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 9382 retained source recordsCanvaspublic previewSource#938→ResultNone→Checks0