Skip to content

Erdős problem 93

If nn distinct points in R2\mathbb{R}^2 form a convex polygon then they determine at least n2\lfloor \frac{n}{2}\rfloor 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:ddea8c278f2eca4c2f7acaaeda3155c2eec3c89ab8c85b4735ee32a7838441c7
Metadata
sha256:f3fb8ff8f307ee14793d5fc97386491bbd68e0933593e5a5ba0935f01d3af5b9
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:d9838f2e24382d0718989c3b4212bb239b89fbb03bbd2d720261fb3361a2b89c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page