Skip to content

Erdős problem 105

Start work

Let A,B⊂R2A,B\subset \mathbb{R}^2 be disjoint sets of size nn and n−3n-3 respectively, with not all of AA contained on a single line. Is there a line which contains at least two points from AA and no points from BB?

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:c07d62fc2c1b6878a10db051f811d251ee08549004510ad6bb3e942cc54d67c0
Metadata
sha256:30ce65963af28daf53e9d0a4e37a5c8b94612c3f33060dfc5972274c0a215b7e
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:57168859334ccb71a32eed5799d56dc7bb24a7206b389f20cd8ed1883481b91f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON