| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654547 | European Journal of Combinatorics | 2006 | 13 Pages |
Abstract
A subset XX in kk-dimensional Euclidean space RkRk that contains nn points (elements) is called a P(nn)-set if every triplet of points selected from them forms an isosceles triangle. In this paper, we show that the P(8)-set in R3R3 is uniquely determined to the known example in Kelly’s paper [L.M. Kelly, Elementary problems and solutions. Isosceles nn-points, Amer. Math. Monthly 54 (1947) 227–229].
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hiroaki Kido,