AMC 10 · 2016 · #11

Grade 8 counting
coordinate-geometrysystematic-enumerationslope-intercept casework ↑ Prerequisites: coordinate-geometry
📏 Long solution 💡 3 insights
Problem
Grid-aligned squares must fit inside a region bounded by a slanted line. Count them.

Pick an answer.

(A)
30
(B)
41
(C)
45
(D)
50
(E)
57
How to solve
Strategy Make a Systematic List

First sketch the region (tool #1) to see it is a right triangle and to read off what "inside" means: an integer corner (x,y) is inside when y ≤ π x, y ≥ -0.1, and x ≤ 5.1. A square has four corners, but only one of them is the troublemaker against each boundary — that is the Extreme Principle (tool #14): the top-left corner is the one most likely to poke above the slant line, so it is the only corner I have to test. Then the count is a clean Systematic List (tool #2): group the squares by side length, and within each side length count column by column. Tool #7 (Identify Subproblems) just sums the three side-length cases at the end.

1STEP 1

Sketch the region

The region is bounded on three sides.

inside ⇔ y ≤ π x, y ≥ -0.1, x ≤ 5.1
2STEP 2

Only the top-left corner matters

Only one corner can violate the boundary.

top-left corner (a, b+s): b+s ≤ π a
3STEP 3

Pi never ties an integer corner

The line never lands on a grid point.

⌊ π a ⌋ = 3a (a=1,2,3,4)
4STEP 4

Count the 1x1 squares

The unit squares number 30.

Σ_a=1⁴ 3a = 3+6+9+12 = 30
5STEP 5

Count the 2x2 squares

The next size gives 15.

Σ_a=1³ (3a-1) = 2+5+8 = 15
6STEP 6

Count 3x3, rule out 4x4, then add

Adding the rest gives 50, choice (D).

30 + 15 + 5 = 50 = (D)
Answer
50
The 1×1 count alone is 30, which is choice (A) — a trap for anyone who forgets the bigger squares. Adding the 15 two-by-twos and 5 three-by-threes pushes the total to 50, comfortably inside the largest choice 57. The column counts 3,6,9,12 rising by a steady 3 match the slant line gaining height π ≈ 3 per step to the right, which is a good sanity check on the shape of the triangle.
💡Key takeaway

Check only the corner most likely to break each boundary, then count the squares size by size and add them up.

  • Sketch the region
  • Only the top-left corner matters
  • Pi never ties an integer corner
  • Count the 1x1 squares
  • Count the 2x2 squares
  • Count 3x3, rule out 4x4, then add