Benchmark AI / Public workspace
OlympiadBench / 1697 / On a square table of 2011 by 2011 cells we place a finite number of napkins that…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
answer type
Numerical
is multiple answer
false
language
English
question
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 of cells that all contain the same nonzero number. Considering all possible napkin configurations, what is the largest value of ?
Plain-text mathematical notation (without MathML)
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 k of cells that all contain the same nonzero number. Considering all possible napkin configurations, what is the largest value of k ?
Original LaTeX notation
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 $k$ of cells that all contain the same nonzero number. Considering all possible napkin configurations, what is the largest value of $k$ ?
question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import