Problem

Source: 2021ChinaTST test3 day2 P3

Tags: geometry, combinatorics, combinatorial geometry



Proof that there exist constant $\lambda$, so that for any positive integer $m(\ge 2)$, and any lattice triangle $T$ in the Cartesian coordinate plane, if $T$ contains exactly one $m$-lattice point in its interior(not containing boundary), then $T$ has area $\le \lambda m^3$. PS. lattice triangles are triangles whose vertex are lattice points; $m$-lattice points are lattice points whose both coordinates are divisible by $m$.