This is famous puzzle that I can came across recently. Place six points on a plane so that distance between any two points is integer such that no three points are collinear.
In 3D it is easy( pyramid) but how to do this in case of 2D?
This is famous puzzle that I can came across recently. Place six points on a plane so that distance between any two points is integer such that no three points are collinear.
In 3D it is easy( pyramid) but how to do this in case of 2D?
Slide 46 of this link shows an answer attributed to Leech. Slide 47 shows $7$ points attributed to Tobias Kreisel and Sascha Kurz. The paper is here
This is question 12 at http://arxiv.org/pdf/1110.1556v2.pdf. The answer there is brilliant, but actually they provide an answer that has all six points with integer coordinates. The answer already suplied at the slide 46 link above shows seven points, but they are not at integer coordinates.