and let g k (n) denote the maximum number of solutions of d(X i ,X ]) = a , 1 < i < j < cl , where the maximur.L is over all possible choices of a and distinct X 1 ,. . X n. In words. g k (n) is the maximum number of times that the. sawe distance can occur among n points in Ek`One of the authors proved írL [1] that g 2 (n) > Te l :+c/log .lorn ('I'hrougtiout this report c and denote positive constants nor necessarily the same at every occi= ence) .