Skip to content

Erdős problem 98

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)/nh(n)/n\to \infty?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6a39dfbf17c92d7da074e33de6d0f18e1f707c315d4107060b54eb5a496cf715
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page