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...") |
(→Solution) |
||
| Line 10: | Line 10: | ||
==Solution== | ==Solution== | ||
{{solution}} | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=1999|num-b=2|num-a=4}} | ||
Latest revision as of 23:56, 18 November 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.
See Also
| 1999 IMO (Problems) • Resources | ||
| Preceded by Problem 2 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 4 |
| All IMO Problems and Solutions | ||
