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?

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:105feffcfadf2e8164787fb457b12a36899d4918ba2902f5a67162121d1c8aa7
Metadata
sha256:a5a369553cb3518fbfe6cca8dc928e130f4d0dc198965d9bfc1702c86734ab87
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7f8e980c81eb32f9d25a3c33312438714681c2e11684580a15c37d9d9f20430e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb