A non self-intersecting polygon is given in a Cartesian coordinate system such that its perimeter contains no lattice points, and its vertices have no integer coordinates. A point is called semi-integer if exactly one of its coordinates is an integer. Let , , , denote the semi-integer points on the perimeter of the polygon. Let denote the floor of the non-integer coordinate of . Prove that integers can be divided into two groups with the same sum.
, 2024
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.