Re: Distinct distances on a chessboard

On Mar 31, 12:17 am, jankri...@xxxxxxxxxxx wrote:
On 31 Mar, 03:25, "John Gabbriel" <johngabbr...@xxxxxxxxx> wrote:

Consider the 8x8 integer lattice : {(x,y) | 0 <= x <= 7 and 0 <= y <=
7, x, y integers}

Can we select some 8 points from the lattice such that all the 28
pairwise distances of the 8 selected points are distinct?

No,..
<snip>

Are you confident? Is there a proof which does not enumerate all the
8x8 cases?


.

Relevant Pages
Quantcast