Source labels openChecked July 26, 2026

Erdős Problem 142: Upper

Find functions $f_k$ , such that $r_k(N) = O_k(f_k)$ , where $r_k(N)$ the largest possible size of a subset of $\{1, \dots, N\}$ that does not contain any non-trivial $k$ -term arithmetic progression.

Number theory AMS 11

Mathematical statement

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_142.variants.upper

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_142.variants.upper (k : ℕ) :    (fun N => (r k N : ℝ)) =O[atTop] (answer(sorry) : ℕ → ℝ) := 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/142background