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}?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:f3d8d542db8e36294a93a596d303e7daac9692fca3e66412273572d884da2d63
Metadata
sha256:71c9465cc7794dbe1cc55412fd47c9827f6c77afd21aea3490b33fb20ebc0c77
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:efdaff43ffd16529ed529215c99ed2e64913d9461c8afcf108fb7311ab9274b6
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page