Skip to content

Erdős problem 659

Start work

Is there a set of nn points in R2\mathbb{R}^2 such that every subset of 44 points determines at least 33 distances, yet the total number of distinct distances is ≪nlog⁡n\ll \frac{n}{\sqrt{\log n}}?

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:82c090755a1bdf551db369b9fbf2f2f037e1c0707ceb740f8165651868b18a78
Metadata
sha256:ecd86c4eda253fdbdd2926133bd06931e9331b38a90ae369be91a5f94b847cc2
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:72dad3c8cc657dd2796685f31900bff2e45ee66faec68491a2728d1d29ad8ce8
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON