Consider a square with the side of length n and $(n+1)^2$ points inside it. Show that we can choose 3 of them to determine a triangle (possibly degenerate) of area at most $\frac{1}{2}$.
I think that I know how to solve the problem for the cases $n=1$ and $n=2$:
For $n=1$ we can easily prove...