nd myself. Consider thetriangular lattice the minimal distance between two points s1. denote by f(t) the number of distances from any points 〓Assume that the distance occurs in particular ,for largertthe determination of f( ets more and more complicated but is not really difficult. But here is a perhaps difficul1 roblem: Let y1,,large) be any sequence of points with di,)1.Is it true hat fornt the number of distances is less than or equal to f(t) with aquality perhaps only for the triangular lattice? In particular, is it true that the number f distancesis less than1?This if true can surely be proved but we certainly id not see how the general conjecture can be proved. Perhaps the following stronger conjecture holds: Lett1<…be the set of distances occurring in the triangular latticet,etc. Is it true that there is an enso that for every et y1,,with dithe number of distances d(is less than ft Problems in number theory. Iwill try to s
