olymmath

ISL 2016 C8

Let nn be a positive integer. Determine the smallest positive integer kk with the following property: it is possible to mark kk cells on a 2n×2n2 n \times 2 n board so that there exists a unique partition of the board into 1×21 \times 2 and 2×12 \times 1 dominoes, none of which contains two marked cells.

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

Official text: IMO 2016 Shortlist booklet, page 9.

Show the answer

2n

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