Erdős problem 303
Is it true that in any finite colouring of the integers there exists a monochromatic solution to with distinct ?
Sources
FormalConjectures/ErdosProblems/
303.lean
Retained formal statement
Is it true that in any finite colouring of the integers there exists a monochromatic solution to with distinct ?
This is true, as proved by Brown and Rödl [BrRo91].
This was formalized in Lean by Yuan using Seed-Prover.
True ↔ ∀ (𝓒 : ℤ → ℤ), (Set.range 𝓒).Finite → ∃ a b c, [a, b, c, 0].Nodup ∧ 1 / ↑a = 1 / ↑b + 1 / ↑c ∧ (𝓒 '' {a, b, c}).Subsingleton