Green's Open ProblemsCombinatorics
Green's Open Problem 27: Equivalent
What is the size of the smallest set (with at least two elements) for which no element in the sumset has a unique representation?
Mathematical statement
What is the size of the smallest set (with at least two elements) for which no element in the sumset has a unique representation?
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_27.equivalent
theorem green_27.equivalent : (answer(sorry) : ℕ → ℝ) ~[primesAtTop] m := 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