Skip to content

Erdős problem 341

Let A={a1<⋯<ak}A=\{a_1 < \cdots < a_k\} be a finite set of integers and extend it to an infinite sequence A‾={a1<a2<⋯ }\overline{A}=\{a_1 < a_2 < \cdots \} by defining an+1a_{n+1} for n≥kn \geq k to be the least integer exceeding ana_n which is not of the form ai+aja_i + a_j with i,j≤ni,j \leq n. Is it true that the sequence of differences am+1−ama_{m+1}-a_m is eventually periodic?

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.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.