Question 101
Let $n$ and $m$ be positive integers. What is the biggest number of points that can be marked in the vertices of the squares of the $n \times m$ grid in such a way that no three of the marked points lie in the vertices of any right-angled triangle?