Skip to content

Erdős problem 982

If nn distinct points in R2\mathbb{R}^2 form a convex polygon then some vertex has at least n2\lfloor\frac{n}{2}\rfloor different distances to other vertices.

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:754a43fde6e2243265a61a16049018a51b624ae62647c004ff1d4ee1ddb7434b
Metadata
sha256:35bc05485f36ecd05520db1ab9b5d7be2e4751881573ac619f62cd93c2c253e2
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:e8dd8c8418dbaad657eebecc1d5fc9c019305599432445d04d9ef0cfd2a56a00
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page