Skip to content

Erdős problem 756

Let AR2A\subset \mathbb{R}^2 be a set of nn points. Can there be n\gg n many distinct distances each of which occurs for more than nn many pairs from AA?

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:36d665e70b7d68243b1097a6824ed5f7425c8143a7ee88d326fb75c78b7d4a68
Metadata
sha256:e21b87966ad7bd313ceb5ad2bb34e1b7bb544a156c62b3ee24736a3687ae9e2a
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:868e5f55007731d6dc580fdbe2c2c31cfb9637c4b3b1316d0c4442c831dd14e0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page