Green's Open ProblemsCombinatorics
Ben Green's Open Problem 37
Asymptotic version: determine the asymptotic behavior of m(N, k) as N grows. The solver should determine what function f : ℕ → ℝ eventually equals (fun N ↦ (m N k : ℝ)).
Mathematical statement
Asymptotic version: determine the asymptotic behavior of m(N, k) as N grows.
The solver should determine what function f : ℕ → ℝ eventually equals (fun N ↦ (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_asymptotic
theorem green_37_asymptotic (k : ℕ) : ∀ᶠ N in atTop, (m N k : ℝ) = (answer(sorry) : ℕ → ℝ) N := 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