Skip to content

Erdős problem 98

Start work

Let h(n)h(n) be such that any nn points in R2\mathbb{R}^2, with no three on a line and no four on a circle, determine at least h(n)h(n) distinct distances. Does h(n)/n→∞h(n)/n\to \infty?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:648ef14862e82f20329a2d46e56db916ae86fc6d6d219b60a4ceaed78e9314c8
Metadata
sha256:5f7d8644aa8de86a18ac559f045384d1b78e7fef0c75a20b2439390631d2fb15
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6a39dfbf17c92d7da074e33de6d0f18e1f707c315d4107060b54eb5a496cf715
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON