Erdős problem 965
Erdős asks in [Er75b] if for every 2-coloring of ℝ, there is an uncountable set such that all sums for have the same colour.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/965.leanFalse ↔ ∀ (f : ℝ → Fin 2), ∃ A, ¬A.Countable ∧ ∀ a ∈ A, ∀ b ∈ A, ∀ c ∈ A, ∀ d ∈ A, a ≠ b → c ≠ d → f (a + b) = f (c + d)SolvedStatement only, no proof