Skip to content

Erdős problem 503

What is the size of the largest ARnA \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 xy|x - y|, yz|y - z|, xz|x - z| are equal.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:621ad3716b628ef6ba04324ef2f2c7184cb232f3d73e1e9b2f06ad7d34edec33
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page