olymmath

ISL 2011 C7

On a square table of 2011 by 2011 cells we place a finite number of napkins that each cover a square of 52 by 52 cells. In each cell we write the number of napkins covering it, and we record the maximal number kk of cells that all contain the same nonzero number. Considering all possible napkin configurations, what is the largest value of kk ?

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

Official text: IMO 2011 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/2011/c7 · Tag YGT6N08VG1 · Edit this page on GitHub · Keys: j next, k previous