Skip to content

Erdős problem 654

Start work

If nn planar points have no four concyclic, must some point determine (1−o(1))n(1 - o(1))n distinct distances? Failing that, can one always force more than (1/3+c)n(1/3 + c)n?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:32b13d9cb58335ed81391fcb6a824e228672c6e48534aa7b8d71cc6dd0863454
Metadata
sha256:0e8fa924fed07216dc732094aa6e1209598228e9c28b387c8299b45fe496e3f3
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:50e93f490a1661f40baccf656f35b6fb56564c1d9ce0aa9b7171af43928e34c0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON