Skip to content

Erdős problem 938

Start work

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

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:efdaff43ffd16529ed529215c99ed2e64913d9461c8afcf108fb7311ab9274b6
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON