Skip to content

Erdős problem 503

What is the size of the largest A⊆RnA \subseteq \mathbb{R}^n such that every three points from AA determine an isosceles triangle? That is, for any three points xx, yy, zz from AA, at least two of the distances ∣x−y∣|x - y|, ∣y−z∣|y - z|, ∣x−z∣|x - z| are equal.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:b37253faf67e7c5c6e49fb993f64272fa8ef75eb869312b58f30d50c3d994b26
Metadata
sha256:3a2bcebff368a559b773913ae3b0b389efe6278b5c696a22a020120fdb141b16
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:621ad3716b628ef6ba04324ef2f2c7184cb232f3d73e1e9b2f06ad7d34edec33
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb