olymmath

ISL 2016 C4

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.

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2016 Shortlist booklet, page 8.

Show the answer

n \text{ can be any multiple of 9}

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/c4 · Tag KV89Y4BPHN · Edit this page on GitHub · Keys: j next, k previous