Skip to content

Erdős problem 93

Start work

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.

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:ddea8c278f2eca4c2f7acaaeda3155c2eec3c89ab8c85b4735ee32a7838441c7
Metadata
sha256:f3fb8ff8f307ee14793d5fc97386491bbd68e0933593e5a5ba0935f01d3af5b9
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:d9838f2e24382d0718989c3b4212bb239b89fbb03bbd2d720261fb3361a2b89c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON