Question 65
Let $n$ be an odd natural number. We consider an $n$ by $n$ grid which is made up of $n^2$ unit squares and $2n(n+1)$ edges. We colour each of these edges either red or blue. If there are at most $n^2$ red edges, then show that there exists a unit square at least three of whose edges are blue.