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?

Sources

Browse retained paths and inspect the exact material available for this Problem.

1 retained statement2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

341.lean

Retained formal statement1 of 1

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?

This problem is discussed under Problem 7 on Green's open problems list.

FormalConjectures/ErdosProblems/341.leanErdos341.erdos_3415 linesExact file
True  ∀ (a : ℕ → ℤ),    (∀ᶠ (n : ℕ) in Filter.atTop, IsLeast {x | a n < xx ∉ {x | ∃ in, ∃ jn, a i + a j = x}} (a (n + 1))) →      have d := fun i => a (i + 1) - a i;p > 0, ∀ᶠ (m : ℕ) in Filter.atTop, d (m + p) = d m
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page