Problem:
A lattice point is a point with both and integers. Find, with proof, the smallest such that every set of lattice points contains three points that are the vertices of a triangle with integer area. (The triangle may be degenerate, in other words, the three points may lie on a straight line and hence form a triangle with area zero.)
Solution
Solution:
Clearly, is too small, for the 4 points could be vertices of a unit square, and all the possible triangles will have areas of . We will show that works. Every lattice point falls into one of four parity classes: (even, even), (even, odd), (odd, even), and (odd, odd). For example the point is in the (odd, even) class. By the pigeonhole principle, among the 5 lattice points there will be at least two points, and , in the same parity class. We claim that if is any other lattice point, the triangle will have integral area.
We will use the following simple lemma:
If the vertices of a triangle are all lattice points, and one side is horizontal or vertical with even length, then the triangle must have integer area.
To see why the lemma is true, let be the triangle with even, and, say, horizontal. Let be the length of the altitude from to . Clearly, is an integer, since it is equal to the absolute value of the difference in -coordinates of and . Then , and the lemma follows. (We are using the notation to denote the area of triangle .)
Now we will show that must be an integer. If is horizontal or vertical, then the length of is even (since the endpoints are in the same parity class), so the lemma immediately implies that is an integer.
If is neither horizontal nor vertical, choose the lattice point such that is a right triangle with right angle at (there may be more than one choice).

Then
Since and both have even length, is an integer. Furthermore,
and by the same reasoning and are both integers.