Source labels openChecked July 26, 2026

Erdős Problem 155

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

Mathematical statement

Is it true that for every $k \geq 1$ we have

F(N + k) \leq F(N) + 1

for all sufficiently large $N$ ?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_155

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_155 : answer(sorry) ↔ ∀ k ≥ 1, ∀ᶠ N in atTop, F (N + k) ≤ F N + 1 := by  sorry

Statement source: Formal Conjectures
Lean version: v4.27.0
Placeholder: Present; no proof artifact
Source evidence: Pinned source index
Fidelity review: Community formulation

References

Pinned Formal Conjectures sourceformalization erdosproblems.com/155background