Worked Example 5 — Lattice Polygon (Pick's Theorem Connection)

Find the area of the polygon with vertices (0,0)(0,0), (5,0)(5,0), (4,3)(4,3), (2,4)(2,4), (0,2)(0,2).

Solution (Shoelace):

List vertices in order and apply the formula:

iixix_iyiy_ixiyi+1x_i y_{i+1}xi+1yix_{i+1} y_i
1000⋅0=00\cdot0=05⋅0=05\cdot0=0
2505⋅3=155\cdot3=154⋅0=04\cdot0=0
3434⋅4=164\cdot4=162⋅3=62\cdot3=6
4242⋅2=42\cdot2=40⋅4=00\cdot4=0
5020⋅0=00\cdot0=00⋅2=00\cdot2=0
[P]=12∣(0+15+16+4+0)−(0+0+6+0+0)∣=12∣35−6∣=292[P] = \frac{1}{2}|(0+15+16+4+0)-(0+0+6+0+0)| = \frac{1}{2}|35-6| = \boxed{\dfrac{29}{2}}

Worked Example 6 — Area Expressed Algebraically

A triangle has vertices (0,0)(0,0), (a,b)(a,b), (c,d)(c,d). Show that its area is 12∣ad−bc∣\frac{1}{2}|ad-bc|.

Solution: Directly apply Shoelace with A=(0,0)A=(0,0), B=(a,b)B=(a,b), C=(c,d)C=(c,d):

[ABC]=12∣(xAyB−xByA)+(xByC−xCyB)+(xCyA−xAyC)∣[ABC] = \frac{1}{2}|(x_A y_B - x_B y_A)+(x_B y_C - x_C y_B)+(x_C y_A - x_A y_C)|
=12∣(0⋅b−a⋅0)+(a⋅d−c⋅b)+(c⋅0−0⋅d)∣= \frac{1}{2}|(0\cdot b - a\cdot 0)+(a\cdot d - c\cdot b)+(c\cdot 0 - 0\cdot d)|
=12∣ad−bc∣= \frac{1}{2}|ad - bc|

This is exactly 12∣det⁡(abcd)∣\frac{1}{2}|\det\begin{pmatrix}a&b\\c&d\end{pmatrix}|, confirming the determinant interpretation.

7. Pick's Theorem (Companion Result)

For a polygon whose vertices lie on lattice points (integer coordinates):

[P]=I+B2−1[P] = I + \frac{B}{2} - 1

where II = number of interior lattice points and BB = number of boundary lattice points.

Pick's theorem and the Shoelace formula are complementary tools:

  • Use Shoelace when you know the coordinates and want the area.
  • Use Pick's when you can count lattice points and want the area (or vice versa).

AMC Tip: On problems asking for the number of lattice points inside a polygon, combine Pick's with Shoelace to find I=[P]−B2+1I = [P] - \frac{B}{2} + 1.

Boundary point count: The number of lattice points on segment from (x1,y1)(x_1,y_1) to (x2,y2)(x_2,y_2) (including endpoints) is gcd⁡(∣x2−x1∣,∣y2−y1∣)+1\gcd(|x_2-x_1|, |y_2-y_1|) + 1. So BB for a polygon is:

B=∑edgesgcd⁡(∣Δx∣,∣Δy∣)B = \sum_{\text{edges}} \gcd(|\Delta x|, |\Delta y|)

8. Common Competition Techniques

8.1 Subtract Areas

For a polygon PP inside a larger region RR, compute [P]=[R]−(surrounding pieces)[P] = [R] - \text{(surrounding pieces)}. This avoids Shoelace on a complex polygon by using a simpler bounding shape.

8.2 Translate to Simplify

If all vertices share a large common coordinate, translate so one vertex is at the origin. For example, vertices (100,200)(100,200), (103,205)(103,205), (101,208)(101,208) become (0,0)(0,0), (3,5)(3,5), (1,8)(1,8) — much easier to compute with.

8.3 Decompose Complex Polygons

Divide a non-convex or complex polygon into triangles or quadrilaterals, compute each area with Shoelace, and sum. This is especially clean when one vertex is shared by all sub-triangles (fan decomposition).

8.4 Shoelace on Curves (AMC 2004 Style)

When vertices lie on a curve (like y=ln⁡xy=\ln x or y=x2y=x^2), apply Shoelace with coordinates expressed in terms of a parameter, then simplify algebraically. Logarithm and exponent rules often cause massive cancellation (as in Worked Example 4).

8.5 Area Ratios via Shoelace

If triangle ABCABC has area SS and point P=αA+βB+γCP = \alpha A + \beta B + \gamma C (with α+β+γ=1\alpha+\beta+\gamma=1) is inside it, then [PBC]=αS[PBC] = \alpha S, [APC]=βS[APC] = \beta S, [ABP]=γS[ABP] = \gamma S. These are the barycentric coordinates of PP — they equal the ratio of the sub-triangle areas to the whole.

9. Strategy Checklist

Before applying Shoelace:

  • List vertices in a consistent rotational order (all CW or all CCW). Jumping around gives wrong answers.
  • Check that the polygon is simple (no self-intersections). If it self-intersects, Shoelace gives a net signed area, not the total enclosed area.
  • Consider translating a vertex to the origin if coordinates are large.

During computation:

  • Compute ∑xiyi+1\sum x_i y_{i+1} and ∑xi+1yi\sum x_{i+1} y_i separately, then subtract.
  • Remember to "wrap around": the last pair uses (xn,yn)(x_n, y_n) and (x1,y1)(x_1, y_1).
  • Keep a table for polygons with 4+ vertices to avoid arithmetic errors.

After computing:

  • Apply the absolute value — sign depends only on the orientation chosen.
  • Cross-check with a decomposition into triangles when possible.
  • For lattice polygons, verify with Pick's theorem if II and BB are easy to count.

10. Common Pitfalls

  • Wrong vertex order. Listing vertices out of rotational order (e.g., skipping across the polygon) is the most common error. Always draw the polygon first.
  • Forgetting the 12\frac{1}{2}. The Shoelace sum gives twice the area.
  • Forgetting to wrap around. The last term pairs the final vertex back with the first vertex.
  • Self-intersecting polygons. Shoelace gives a net signed area. For a self-intersecting polygon (like a star polygon), the formula does not give the total enclosed area.
  • Confusing CW vs. CCW. Both work — just take the absolute value. Only matters if you need the signed area.
  • Pick's theorem on non-lattice polygons. Pick's theorem requires all vertices to be lattice points. Shoelace has no such restriction.

Practice Problems

Foundational

  1. Find the area of the triangle with vertices (−3,2)(-3, 2), (1,−4)(1, -4), (5,6)(5, 6).

  2. A quadrilateral has vertices (0,0)(0,0), (6,0)(6,0), (8,4)(8,4), (2,6)(2,6). Find its area.

  3. Three points A(1,1)A(1,1), B(4,5)B(4,5), C(7,1)C(7,1) are given. Without using the distance formula, determine whether they are collinear. If not, find [ABC][ABC].

  4. A lattice triangle has vertices at (0,0)(0,0), (5,0)(5,0), (2,4)(2,4). Use both Shoelace and Pick's Theorem to find its area, and verify they agree.

Intermediate

  1. A polygon has vertices (1,0)(1,0), (2,3)(2,3), (4,4)(4,4), (5,1)(5,1), (3,−1)(3,-1). Find its area using the Shoelace formula.

  2. (Centroid Area) Triangle ABCABC has A(0,0)A(0,0), B(6,0)B(6,0), C(2,8)C(2,8). Let GG be the centroid. Find [ABG][ABG] using Shoelace, and verify it equals 13[ABC]\frac{1}{3}[ABC].

  3. Points DD, EE, FF are the midpoints of sides BCBC, CACA, ABAB of triangle ABCABC with A(2,1)A(2,1), B(8,3)B(8,3), C(4,9)C(4,9). Find [DEF][DEF] and verify it equals 14[ABC]\frac{1}{4}[ABC].

  4. A quadrilateral ABCDABCD has A(0,0)A(0,0), B(a,0)B(a,0), C(b,c)C(b,c), D(0,d)D(0,d) with a,c,d>0a,c,d>0. Express its area using the Shoelace formula and simplify.

AMC/AIME Level

  1. (AMC Style) The vertices of a triangle are at (0,0)(0,0), (n,0)(n,0), and (0,n)(0,n) for positive integer nn. A lattice point is chosen uniformly at random from the interior. Using Pick's Theorem, find the probability that the point is within distance 11 of the hypotenuse.

  2. (Shoelace on a Curve) The vertices of a triangle lie on the parabola y=x2y = x^2, with xx-coordinates pp, qq, rr. Show that the area of the triangle is 12∣(p−q)(q−r)(r−p)∣\frac{1}{2}|(p-q)(q-r)(r-p)|.

  3. (AMC 2004 #16 Extension) Suppose instead the vertices lie on y=x2y = x^2 with consecutive integer xx-coordinates n,n+1,n+2,n+3n, n+1, n+2, n+3. Find the area of the resulting quadrilateral as a function of nn, and find nn such that the area equals 55.

  4. (AIME Style) Let PP be the polygon with vertices at all lattice points (x,y)(x,y) with ∣x∣+∣y∣≤3|x|+|y| \leq 3. Compute the area of PP using the Shoelace theorem applied to its boundary vertices listed in order.

  5. (Area Ratio) In △ABC\triangle ABC with A(0,0)A(0,0), B(4,0)B(4,0), C(1,3)C(1,3), cevian ADAD is drawn where DD divides BCBC in ratio BD:DC=2:1BD:DC = 2:1. Find [ABD]:[ADC]:[ABC][ABD]:[ADC]:[ABC] using Shoelace, and verify Ceva's theorem.

Answer Key (Selected)

Problem 1: [ABC]=12∣(−3)(−4−6)+1(6−2)+5(2−(−4))∣=12∣30+4+30∣=32[ABC] = \frac{1}{2}|(-3)(-4-6)+1(6-2)+5(2-(-4))| = \frac{1}{2}|30+4+30| = 32. 32\boxed{32}

Problem 3: Slope AB=5−14−1=43AB = \frac{5-1}{4-1}=\frac{4}{3}, slope AC=1−17−1=0AC=\frac{1-1}{7-1}=0. Not equal, so not collinear. [ABC]=12∣1(5−1)+4(1−1)+7(1−5)∣=12∣4+0−28∣=12[ABC]=\frac{1}{2}|1(5-1)+4(1-1)+7(1-5)|=\frac{1}{2}|4+0-28|=12. 12\boxed{12}

Problem 10: Place vertices at (p,p2)(p,p^2), (q,q2)(q,q^2), (r,r2)(r,r^2). Apply Shoelace:

[T]=12∣p(q2−r2)+q(r2−p2)+r(p2−q2)∣[T] = \frac{1}{2}|p(q^2-r^2)+q(r^2-p^2)+r(p^2-q^2)|
=12∣p(q−r)(q+r)+q(r−p)(r+p)+r(p−q)(p+q)∣= \frac{1}{2}|p(q-r)(q+r)+q(r-p)(r+p)+r(p-q)(p+q)|

Factor out (p−q)(q−r)(r−p)(p-q)(q-r)(r-p) — this is a standard symmetric function identity:

=12∣(p−q)(q−r)(r−p)∣.= \frac{1}{2}|(p-q)(q-r)(r-p)|. \quad

Problem 11: Vertices (n,n2)(n,n^2), (n+1,(n+1)2)(n+1,(n+1)^2), (n+2,(n+2)2)(n+2,(n+2)^2), (n+3,(n+3)3)(n+3,(n+3)^3). By the result of Problem 10 and Shoelace on a quadrilateral, the area works out to ∣(p−r)(q−s)∣/2|(p-r)(q-s)|/2 where indices are chosen carefully — a good exercise in applying Shoelace systematically. Setting equal to 55 gives n=1n=1.

Problem 12: The vertices of ∣x∣+∣y∣≤3|x|+|y|\leq 3 form a regular octagon (actually a square rotated 45°) with vertices (±3,0)(\pm 3,0), (0,±3)(0,\pm 3), (±2,±1)(\pm 2,\pm 1), etc. Actually ∣x∣+∣y∣=3|x|+|y|=3 is a square with vertices (±3,0),(0,±3)(\pm 3,0),(0,\pm 3) — a square of diagonal 66, area =12(6)(6)=18=\frac{1}{2}(6)(6)=18. 18\boxed{18}

StatusSourceProblem NameDifficultyTags
Harvard-MIT Mathematics TournamentHard
Show TagsCartesian coordinates, Pick's theorem, Vectors
HMMT February 2016Hard
Show TagsCartesian coordinates, Constructions and loci, Pick's theorem
HMMT FebruaryHard
Show TagsCartesian coordinates, Greatest common divisors (gcd), Pick's theorem, Quadrilaterals
HMMT FebruaryHard
Show TagsCartesian coordinates, Homothety, Pick's theorem, Rotation
HMMT November 2023Hard
Show TagsGreatest common divisors (gcd), Pick's theorem
Bay Area Mathematical OlympiadHard
Show TagsDeterminants, Modular Arithmetic, Pick's theorem, Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle, Vectors
Berkeley Math CircleHard
Show TagsCartesian coordinates, Optimization in geometry, Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle
MathNetHard
Show TagsCartesian coordinates, Homothety
Berkeley Math CircleHard
Show TagsCartesian coordinates, Distance chasing, Homothety
Berkeley Math Circle Monthly Contest 6Hard
Show TagsCartesian coordinates, Constructions and loci
Berkeley Math CircleHard
Show TagsCartesian coordinates, Quadrilaterals, Rotation
Berkeley Math Circle: Monthly Contest 6Hard
Show TagsCartesian coordinates, Constructions and loci, Radical axis theorem
MathNetHard
Show TagsCartesian coordinates, Homothety, Isogonal/isotomic conjugates, barycentric coordinates, Triangles
Berkeley Math Circle Monthly Contest 4Hard
Show TagsCartesian coordinates, Recurrence relations, Recursion, bijection
MathNetHard
Show TagsCartesian coordinates, Optimization in geometry
Berkeley Math Circle Monthly Contest 6Hard
Show TagsCartesian coordinates, Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle, Vectors
Berkeley Math Circle: Monthly Contest 1Hard
Show TagsCartesian coordinates, Optimization in geometry, Quadratic functions, Triangle centers: centroid, incenter, circumcenter, orthocenter, Euler line, nine-point circle
HMMTHard
Show TagsCartesian coordinates, Constructions and loci, Linear and quadratic inequalities, Quadratic functions
HMMTHard
Show TagsCartesian coordinates, Quadratic functions, Trigonometry

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.