olymmath

ISL 2016 C3

Let nn be a positive integer relatively prime to 6 . We paint the vertices of a regular nn-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. C4\mathbf{C 4}. Find all positive integers nn for which we can fill in the entries of an n×nn \times n table with the following properties: - each entry can be one of I,MI, M and OO; - in each row and each column, the letters I,MI, M and OO occur the same number of times; and - in any diagonal whose number of entries is a multiple of three, the letters I,MI, M and OO occur the same number of times.

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2016 Shortlist booklet, page 8.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2016/c3 · Tag 2TFKDW65YD · Edit this page on GitHub · Keys: j next, k previous