Let be a positive integer relatively prime to 6. We paint the vertices of a regular -gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours. . Find all positive integers for which we can fill in the entries of an table with the following properties:
- each entry can be one of and ;
- in each row and each column, the letters and occur the same number of times; and
- in any diagonal whose number of entries is a multiple of three, the letters and occur the same number of times.
Solution
For , let be the number of isosceles triangles whose vertices contain exactly colours. Suppose on the contrary that . Let be the number of vertices of the three different colours respectively. We now count the number of pairs where is an isosceles triangle and is a side of whose endpoints are of different colours. On the one hand, since we have assumed , each triangle in the pair must contain exactly two colours, and hence each triangle contributes twice. Thus the number of pairs is . On the other hand, if we pick any two vertices of distinct colours, then there are three isosceles triangles having these as vertices, two when is not the base and one when is the base since is odd. Note that the three triangles are all distinct as . In this way, we count the number of pairs to be . However, note that is even while is odd, as each of is. This yields a contradiction and hence . Comment. A slightly stronger version of this problem is to replace the condition by being odd (where equilateral triangles are regarded as isosceles triangles). In that case, the only difference in the proof is that by fixing any two vertices , one can find exactly one or three isosceles triangles having these as vertices. But since only parity is concerned in the solution, the proof goes the same way. The condition that there is an odd number of vertices of each colour is necessary, as can be seen from the following example. Consider and we label the vertices . Suppose colour 1 is used for , colour 2 is used for , while colour 3 is used for the remaining vertices. Then any isosceles triangle having colours 1 and 2 must contain and one of . Clearly, the third vertex must have index which is a multiple of 5 so it is not of colour 3.