Skip to content

Erdős problem 89

Erdős [Er46] asked whether every set of nn distinct points in R2\mathbb{R}^2 determines ≫nlog⁡n\gg \frac{n}{\sqrt{\log n}} many distinct distances.

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:1d82624f866c6c871b6c000c48399051dde21de8e7f336620152dd29ed2e15e1
Metadata
sha256:c9f3669c4f7d3ee4247c573bc5dce226198cadce1227633f305a6ac9a0d92326
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:137e5a001df5ab9c2fc578559b2f5e7907d83d6d775a2b1cee397fad7d1738f5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb