Skip to content

Erdős problem 89

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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:137e5a001df5ab9c2fc578559b2f5e7907d83d6d775a2b1cee397fad7d1738f5
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page