Skip to content

Erdős problem 982

Start work

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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:754a43fde6e2243265a61a16049018a51b624ae62647c004ff1d4ee1ddb7434b
Metadata
sha256:35bc05485f36ecd05520db1ab9b5d7be2e4751881573ac619f62cd93c2c253e2
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e8dd8c8418dbaad657eebecc1d5fc9c019305599432445d04d9ef0cfd2a56a00
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON