Erdős problem 965Erdős asks in [Er75b] if for every 2-coloring of ℝ, there is an uncountable set A⊆RA ⊆ ℝ such that all sums a+ba + b for a,b∈A,a≠ba, b ∈ A, a ≠ b have the same colour.WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 9653 retained source recordsCanvaspublic previewSource#965→ResultNone→Checks0