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?

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

No source records work against this Problem.