Green's Open ProblemsCombinatorics
Green's Open Problem 39: Variant Theta
Similar questions are interesting with replaced by for any . [Gr24]
Mathematical statement
Similar questions are interesting with replaced by for any . [Gr24]
NOTE: using translates as stated makes the conjecture trivially false by the pigeonhole principle. Indeed for a set of size , we cover at most elements, which is strictly less than for . We interpret the question as asking whether translates suffice. This generalizes the main conjecture where .
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_39.variant_theta
theorem green_39.variant_theta : answer(sorry) ↔ ∀ (θ : ℝ), 0 < θ → θ ≤ 1/2 → ∃ C > 1, Tendsto (fun p : {q : ℕ // q.Prime} ↦ let k := ⌊(p : ℝ) ^ θ⌋₊ let c := ⌊C * (p : ℝ) ^ (1 - θ)⌋₊ (proportionCoverable p k c : ℝ)) atTop (𝓝 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