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?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/341.lean

Formal Conjectures

FormalConjectures/ErdosProblems/341.leanErdos341.erdos_3415 linesExact file
True ↔  ∀ (a : ℕ → ℤ),    (∀ᶠ (n : ℕ) in Filter.atTop, IsLeast {x | a n < x ∧ x ∉ {x | ∃ i ≤ n, ∃ j ≤ n, 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

Continue