olymmath

ISL 2012 C5

The columns and the rows of a 3n×3n3 n \times 3 n square board are numbered 1,2,…,3n1,2, \ldots, 3 n. Every square (x,y)(x, y) with 1≤x,y≤3n1 \leq x, y \leq 3 n is colored asparagus, byzantium or citrine according as the modulo 3 remainder of x+yx+y is 0,1 or 2 respectively. One token colored asparagus, byzantium or citrine is placed on each square, so that there are 3n23 n^{2} tokens of each color. Suppose that one can permute the tokens so that each token is moved to a distance of at most dd from its original position, each asparagus token replaces a byzantium token, each byzantium token replaces a citrine token, and each citrine token replaces an asparagus token. Prove that it is possible to permute the tokens so that each token is moved to a distance of at most d+2d+2 from its original position, and each square contains a token with the same color as the square.

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

Official text: IMO 2012 Shortlist booklet, page 5.

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