After playing the game Pythagorea, my friend came up with a really interesting question:
For a positive integer $m$, pick $m$ points on a $n \times n$ lattice grid such that we cannot draw two segments (out of the picked points) that are parallel. What is the maximum value of $m$?
Any ideas or comments about this problem are appreciated.