Skip to content

Erdős problem 502

Start work

What is the size of the largest A⊆RnA\subseteq \mathbb{R}^n such that there are only two distinct distances between elements of AA? That is, #{∣x−y∣:x≠y∈A}=2.\# \{ \lvert x-y\rvert : x\neq y\in A\} = 2.

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:8ace8961873d25243b041646fa3ff58d82792831aeb7b899fa84ce3fc37f0517
Metadata
sha256:2cdc85c213528924aad12e12aca85b699212134df370b938e40da6cf6f590938
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ab6b1783d100ddd4cb0ff1ccea31d1164c907d292741874b410f425a302cb43f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON