Erdős problem 503
What is the size of the largest such that every three points from determine an isosceles triangle? That is, for any three points , , from , at least two of the distances , , are equal.
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:b37253faf67e7c5c6e49fb993f64272fa8ef75eb869312b58f30d50c3d994b26
- Metadata
- sha256:3a2bcebff368a559b773913ae3b0b389efe6278b5c696a22a020120fdb141b16
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:621ad3716b628ef6ba04324ef2f2c7184cb232f3d73e1e9b2f06ad7d34edec33
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb