Difference between revisions of "1999 IMO Problems/Problem 3"
(Created page with "==Problem== Consider an <math>n \times n</math> square board, where <math>n</math> is a fixed even positive integer. The board is divided into <math>n^{2}</math> units squar...") |
(No difference)
|
Revision as of 20:39, 6 October 2023
Problem
Consider an 
square board, where 
is a fixed even positive integer. The board is divided into 
units squares. We say that two different squares on the board are adjacent if they have a common side.
unit squares on the board are marked in such a way that every square (marked or unmarked) on the board is adjacent to at least one marked square.
Determine the smallest possible value of .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
