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

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it575 share a topic
Number Theory576
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources