Skip to content

Erdős problem 965

Start work

Erdő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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:a2ac79b8ad18f3e95c2795be876fbc885d31fe4fc580afa0a3bec05ed84faa68
Metadata
sha256:e586d60a42dd7d60ca844e8cd0508b4909bec387006971dcfdc177f107debc8d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:85b71ddc4580f9e444f6456da3b942a52dc2b6d20e325eb07dfee74c73666b14
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON