Skip to main content
OlympiadHQ

Browse · MathNet

Print

First Round

Netherlands counting and probability

Problem

On a board, there are grass hoppers, each on its own square. At a certain time, each grass hopper jumps to an adjacent square: to the square above, below, left, or right of its current square, but not diagonally and not leaving the board. What is the maximum number of squares that can be empty after the grass hoppers have jumped? A) B) C) D) E)
Solution
C)
Final answer
C

Techniques

Coloring schemes, extremal argumentsPigeonhole principle