2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/124977In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the necessity of b \le 2 i + 7. We sketch three proofs of this fact: the original one by Scott, an elementary one, and one using algebraic geometry. As a refinement, we introduce an onion skin parameter l: how many nested polygons does P contain? and give sharper bounds.19 pages, 22 figures. To appear in the American Mathematical MonthlyCombinatoricsAlgebraic Geometry52C05 (primary); 14M25, 11H06, 52B20 (secondary)text