Browse · MathNet
PrintFirst Round, January 2019
Netherlands 2019 counting and probability
Problem
On a chess board, there is a contagious disease. Each day some of the squares on the chess board are sick and the rest are healthy. A healthy square bordering a sick square (along a side), becomes sick itself the next day. A sick square will always be healthy the next day. A healthy square that has been sick before, can become sick again (if it is infected by one of the adjacent squares). On day 1, only the middle square is sick. How many squares are sick on day ? A) B) C) D) E)
Solution
E)
Final answer
E
Techniques
Invariants / monovariantsColoring schemes, extremal arguments