All open problems
Source labels openChecked July 26, 2026
Green's Open ProblemsCombinatorics
Ben Green's Open Problem 37
Determine a strict upper bound (little o) for m(N, k).
Mathematical statement
Determine a strict upper bound (little o) for m(N, k).
Statement source: Green's Open 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
green_37_littleO
Complete statement target, proof intentionally absentLean 4
theorem green_37_littleO (k : ℕ) : (fun N ↦ (m N k : ℝ)) =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