Skip to content

Erdős problem 958

Let A⊂R2A\subset \mathbb{R}^2 be a finite set of size nn, and let {d1,…,dk}\{d_1,\ldots,d_k\} be the set of distances determined by AA. Let f(d)f(d) be the multiplicity of dd, that is, the number of unordered pairs from AA of distance dd apart.

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:6e0aeec0218c65bd987fdc7ac1afec3fe488d6634f12d3437fa2072593745169
Metadata
sha256:d06c27d9a1db68b829502e715115d04b22333ea764d83012fc296f9270014b11
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:f94e2b828183cf65c7b1eed670a2a542d1c6f832db38854f3286430b0cb1bfb0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb