## Various geometry problems

**1.** Suppose we have a polygon in plane, not necessarily convex such that its area is strictly less than . Prove that we can translate the polygon in such a way that there are no points with integer coordinates inside or on its edges.

**Solution:** Imagine we break the lattice into unit squares and overlap all of them on the square . Then, because the area of our polygon is strictly smaller than 1, there exists one point such that is not covered. Consider all the points in the plane; by the property of , these points are all outside . Consider the translation of vector , where is the origin of the lattice. Then all the lattice points are translated in the set , which does not intersect . This means that a translation of with vector leaves all lattice points outside .

**2.** We have two sets of points in plane which has elements and which has elements, with positive integers such that no three points from their union are collinear. Prove that there exists a line which splits the plane in two regions each of which contain elements of and elements of .

**3.** Inside the unit square consider points. Prove that there exists a polygonal line joining these points which has length smaller than .

**4.** A plane convex figure has the property that any segment which divides it in two figures of equal areas has length at most . Prove that the figure has area at most .

**These problems are solvable, but I don’t have any solutions momentarily. If you solve them, you can post a hint in comments. Thanks**

3. Inside the unit square consider n^2 points. Prove that there exists a polygonal line joining these points which has length smaller than 3n.

hint – prove that n^2+1 points has a length greater than 3n

Can you prove this? Still I don’t think that this is enough. If points always give a polygonal line with length greater than 1 then this does not tell us anything about the length of a polygonal line of length .