Back to Problems

erdos_303

Specification

Is it true that in any finite colouring of the integers there exists a monochromatic solution to $\frac 1 a = \frac 1 b + \frac 1 c$ with distinct $a, b, c$? This is true, as proved by Brown and RΓΆdl [BrRo91]. [BrRo91] Brown, Tom C. and RΓΆdl, Voijtech, _Monochromatic solutions to equations with unit fractions_. Bull. Austral. Math. Soc. (1991), 387-392.

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement
theorem erdos_303 :
    answer(True) ↔
    -- For any finite colouring of the integers
    βˆ€ (𝓒 : β„€ β†’ β„€), (Set.range 𝓒).Finite β†’
      -- There exists integers `a, b, c`
      βˆƒ (a b c : β„€),
      -- that are non-zero and distinct.
      [a, b, c, 0].Nodup ∧
      -- `a, b, c` satisfy the equation
      (1/a : ℝ) = 1/b + 1/c ∧
      -- `a, b, c` have the same color
      (𝓒 '' {a, b, c}).Subsingleton
ID: ErdosProblems__303__erdos_303
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.