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






Proposed by Ilya Bogdanov and Rustem Zhenodarov, Russia