Erdős problem 155 · problems.science

Is it true that for every $k \geq 1$ we have $F(N + k) \leq F(N) + 1$ for all sufficiently large $N$ ?

No current result

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

FormalConjectures/ErdosProblems/155.lean

Formal Conjectures

FormalConjectures/ErdosProblems/155.leanErdos155.erdos_1551 lineExact file

1True ↔ ∀ k ≥ 1, ∀ᶠ (N : ℕ) in Filter.atTop, Erdos155.F (N + k) ≤ Erdos155.F N + 1

OpenStatement only, no proof