Back to Problems

green_15_ap4

Specification

The answer is YES for 4-term progressions [BJP14].

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem green_15_ap4 :
    ∃ K : ℝ≥0, ∃ f : ℕ → ℤ, LipschitzWith K f ∧
      IsAPOfLengthFree  {((n, f n) : ℤ × ℤ) | (n : ℕ)} 4
ID: GreensOpenProblems__15__green_15_ap4
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.