MathDB
TOT 2000 Spring AS4 convex polygon on lattice points

Source:

May 11, 2020
convex polygonlattice pointsSumcombinatorial geometrycombinatorics

Problem Statement

Each vertex of a convex polygon has integer coordinates, and no side of this polygon is horizontal or vertical. Prove that the sum of the lengths of the segments of lines of the form x=mx = m, mm an integer, that lie within the polygon is equal to the sum of the lengths of the segments of lines of the form y=ny = n, nn an integer, that lie within the polygon.
(G Galperin)