Introduction
While most area formulas relate area to lengths/angles, Pick's Theorem relates a polygon's area to the way it's laid out on a grid. If a polygon has all vertices on gridpoints, its area can be determined by the number of grid points within and bordering it. This means you can essentially use counting (as opposed to less trivial methods) for finding the area of lattice polygons.
Some useful definitions:
Lattice point: A point with . The set of all of them is the lattice .
Lattice polygon: A simple polygon (noncrossing edges) whose vertices all lie on lattice points.
Pick's Theorem. Let be a lattice polygon with area . Let be the number of lattice points strictly inside , and let be the number of lattice points on the boundary of (including vertices). Then
Exceptions: The polygon must not self-intersect or have "holes."
Example 1: The hollow points are interior, the solid points are on the boundary.
Counting gives and , so by Pick's Theorem,
Key Ideas
Counting with the GCD
Counting boundary points by squinting at a picture is fine for a small diagram, but can get tedious with larger ones. Instead of counting, you can use the GCD formula to find the number of boundary points.
The segment from to contains exactly
lattice points, counting both endpoints.
Summing the formula over all edges (each vertex gets counted once by attributing it to one of its two edges) gives the formula:
with indices taken cyclically. This allows you to find the number of boundary points of larger shapes, making it such that you do not need to count out the points manually.
Pick's Theorem Converse
Some problems may ask for lattice points that satisfy inequalities instead of just the area of a lattice polygon. Here, the converse of Pick's Theorem is more useful, stating that:
This means you can find the area by any means, count the boundary points with the GCD formula, and with it, compute the interior lattice point count. This is nearly always faster than summing a floor-function series, and is much less likely to result in off-by-one errors.
Pick's Theorem with Holes
Sometimes, the polygon you need to work with has "holes" on the interior. If is a polygonal region with polygonal holes (all vertices still at lattice points, counting all boundary points including the holes' boundaries), the corrected formula is:
Worked Examples
2019 AMC 10A Problem 7 (also 2019 AMC 12A Problem 5)
Two lines with slopes and intersect at . What is the area of the triangle enclosed by these two lines and the line ?
The three lines are , , and . Intersecting them gives vertices , , and .
Instead of Heron's formula or coordinate bashing, recognize that every vertex is a lattice point, so Pick's Theorem can be used.
Boundary points by the GCD formula (note that since the polygon is small, counting by hand is a faster option; the formula is used here as an example):
The interior points are , so . Then
1998 AIME Problem 2
Find the number of ordered pairs of positive integers that satisfy and .
This is a counting problem with no geometry in sight, but the condition of integer ordered pairs (lattice points) signals that Pick's Theorem can be used. First, unpack the two compound inequalities into four:
Together with these form a quadrilateral with vertices , , , .
Area: The quadrilateral is the square minus the two right triangles cut off by and . Each of those triangles has legs and , so area , and
Boundaries: By the GCD formula:
Interior: Solving Pick's Theorem for :
The inequalities are non-strict, so we want the entire region: lattice points. Finally, the problem asks for positive integers, meaning the origin does not work. The answer is .
Final Remarks
Every lattice polygon has area in . This means if you get anything else, you're doing something wrong. (See the next remark.)
Transformations: If a polygon does not completely fit lattice points, try transforming it such that it does. Remember to account for dilations changing the area of the polygon.
Holes: If the polygon has holes, make sure to use the right formula.
Usage: Whenever given a polygon with integer (or easily convertible to integer) points, see if Pick's Theorem could be used to solve it more efficiently. When given inequalities or asked for lattice points, try using Pick's Theorem's converse.
Common Pitfalls: Not accounting for holes, misinterpreting boundary and interior points, and using Pick's Theorem on polygons with overlapping edges.
Practice Problems
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
Module Progress:
Join the Discord Community!
Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.
