Skip to content

Erdős problem 756

Start work

Let A⊂R2A\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?

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:36d665e70b7d68243b1097a6824ed5f7425c8143a7ee88d326fb75c78b7d4a68
Metadata
sha256:e21b87966ad7bd313ceb5ad2bb34e1b7bb544a156c62b3ee24736a3687ae9e2a
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:868e5f55007731d6dc580fdbe2c2c31cfb9637c4b3b1316d0c4442c831dd14e0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON