There is an equilateral triangular lattice of points distance one unit apart, bounded by an equilateral triangle having 10 points on each side (see image). How many segments having the length of 7 units can be formed with the vertices of the lattice?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Note: In the Cartesian plane, points of the lattice have coordinates ( 2 m , 2 n 3 ) where m , n are both even or both odd integers. We are looking for a vector u : ∣ u ∣ = 7 . m 2 + 3 n 2 = 1 9 6 ⇒ ( ∣ m ∣ , ∣ n ∣ ) = ( 1 3 , 3 ) , ( 1 1 , 5 ) , ( 1 4 , 0 ) , ( 7 , 7 ) , ( 2 , 8 )