Back to Problems

erdos_494.variant.gordon_fraenkel_straus

Specification

Gordon, Fraenkel, and Straus [GRS62] proved that the claim is true for all $k > 2$ when $|A|$ is sufficiently large.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_494.variant.gordon_fraenkel_straus :
    ∀ k > 2, ∀ᶠ card in atTop, Erdos494Unique k card
ID: ErdosProblems__494__erdos_494.variant.gordon_fraenkel_straus
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.