Competition · AMC preparation · step 4 of 4
AMC 10 · 2021B · #25
Grade 8 number-theoryPick an answer.
AMC 10 2021 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
Tool #9 (Easier Problem) — first use a continuous-area estimate (the line cuts a triangle of area ∼ 1/3 of the bounding square) to guess m ≈ 2/3, then verify exactly. Tool #5 (Pattern) — group the 30 terms of the sum Σ_x = 1³⁰ ⌊ 2x/3 ⌋ by x mod 3 to see a clean arithmetic-series formula. Tool #1 (Diagram) — sketch the 30 × 30 grid with the line y = 2/3 x passing exactly through (3, 2), (6, 4), …, (30, 20). Tool #7 (Subproblems) — find the lower bound and the upper bound of the interval separately. Tool #3 (Eliminate) — confirm a + b matches a choice.
Write the count as a sum
Each column x holds min(⌊mx⌋, 30) points with y ≤ mx, so N(m) = Σ min(⌊mx⌋, 30); for m ≤ 1 the 30-cap never bites.
Per column, count how many lattice y's stay below the line — that's a floor of mx, capped at 30.
8.F.A.1Identify SubproblemsEstimate the slope by area
By area, the cut triangle is of the 900-square: = gives m ≈ , and 30·() = 20 ≤ 30 stays safe.
Continuous area gives a sharp guess; we'll verify the exact count is 300 next.
The area under the line gives a sharp first guess at how many grid points sit below it.
▸ Why?
The region under the line is a triangle, whose area is half its base times its height.
▸ Why?
Each grid point stands for one unit of area, so the count rises in step with that area.
Check the count in triples
Group x by residue mod 3: each triple sums to 6k − 3, and Σ (6k − 3) over k = 1..10 gives N() = 300. ✓
Group by x mod 3 — each residue class gives an arithmetic-progression-of-floors pattern.
8.F.B.4Look For A PatternFind the lower endpoint
Just below , the 10 on-line points (3, 2), …, (30, 20) each drop out, so N falls 300 → 290 — hence m_lo = is included.
The count jumps DOWN by 10 as soon as the line drops just below the diagonal points (3, 2), (6, 4), …
8.F.A.1Draw A DiagramFind the upper endpoint
N jumps up at the next above ; minimizing − = needs numerator 3k − 2x = 1 with x as large as possible.
Smallest fraction just above 2/3 comes from the largest allowed denominator that satisfies the Diophantine condition.
7.NS.A.3Identify SubproblemsSolve the Diophantine equation
Solving 3k − 2x = 1 gives x = 1 + 3t, k = 1 + 2t; the largest x ≤ 30 is t = 9 → x = 28, so m_hi = and m ∈ [, ).
t = 9 pushes x all the way to 28 — the largest x ≤ 30 in the family.
7.NS.A.3Identify SubproblemsSubtract to get the length
Interval length: − = = , already lowest terms, so a + b = 1 + 84 = 85, choice (E).
Common-denominator subtraction yields a beautifully clean 1/84 — and 85 is on the list.
5.NF.A.1Eliminate PossibilitiesThis hardest AMC 10 problem only needs Grade 7-8 estimation and number theory you already know — area of the square → guess m ≈ ; verifying by groups of three confirms exactly 300 lattice points; the next jump up happens at the smallest > with x ≤ 30, which comes from 3k - 2x = 1 with largest x = 28, giving ; interval length is - = , so a + b = 1 + 84 = 85.
- Write the count as a sum
- Estimate the slope by area
- Check the count in triples
- Find the lower endpoint
- Find the upper endpoint
- Solve the Diophantine equation
- Subtract to get the length
A parent dashboard for the family lives at sensimlab.com.