Back to Problems

green_16

Specification

What is the largest subset of $[N]$ with no solution to $x + 3y = 2z + 2w$ in distinct integers $x, y, z, w$?

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem green_16 (N : ℕ) :
    ∃ A : Finset ℕ, A ⊆ range (N + 1) ∧ SolutionFree A ∧
      A.card = answer(sorry) ∧
      MaximalFor (fun B => B ⊆ range (N + 1) ∧ SolutionFree B) Finset.card A
ID: GreensOpenProblems__16__green_16
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.