Determine the number of unordered triples of distinct points in the lattice grid that are collinear in (i.e. there exists a line passing through the three points).
Problem 684
Official solution
Define a main plane to be one of the planes. Define a space diagonal to be a set of collinear points not parallel to a main plane. We classify the lines as follows: (a) Lines parallel to two axes (i.e. orthogonal to a main plane). Notice that given a plane of the form , where , there are 8 such lines, four in one direction and four in a perpendicular direction. There are such planes. However, each line lies in two of these planes, so there are such lines. Each of these lines has 4 points, so there are 4 possible ways to choose 3 collinear points, giving triplets. (b) Diagonal lines containing four points parallel to some main plane. Consider a plane of the form , as defined above. These each have 2 diagonals that contain 4 collinear points. Each of these diagonals uniquely determines so these diagonals are each counted once. There are 12 possible pairs, yielding triplets. (c) Diagonal lines containing three points parallel to some main plane. Again, consider a plane . By inspection, there are four such lines and one way to choose the triplet of points for each of these lines. This yields triplets. (d) Main diagonals. There are four main diagonals, each with 4 collinear points, yielding triplets. (e) Space diagonals containing three points. Choose one of the points in the set to be the midpoint of the line. Since these 8 possibilities are symmetric, say we take the point . There are four space diagonals passing through this point, but one is a main diagonal. So each of the 8 points has 3 such diagonals with 3 points each, yielding ways. Adding all these yields .