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 nkn \geq k to be the least integer exceeding ana_n which is not of the form ai+aja_i + a_j with i,jni,j \leq n. Is it true that the sequence of differences am+1ama_{m+1}-a_m is eventually periodic?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:7f8e980c81eb32f9d25a3c33312438714681c2e11684580a15c37d9d9f20430e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page