Focused Practice

Across all years

Tick one or more bands and topics — problems are pulled from every authored year.

Showing 20 of 205 matching
Difficulty bands: (none = all 25)
Topics: (none = all topics)
Order:
Problem 16 · 2026 AMC 8 Hard
Number Theory divisibility-rule

Consider all positive four-digit integers whose digits are all even. What fraction of these integers are divisible by 4?

Show hint (soft nudge)
Divisibility by 4 depends only on the last two digits.
Show hint (sharpest)
With an even tens digit, the tens part is already a multiple of 4, so only the units digit decides it.
Show solution
  1. A number is divisible by 4 exactly when its last two digits are. With an even tens digit, 10·(tens) is already a multiple of 4, so it comes down to the units digit being 0, 4, or 8.
  2. That's 3 of the 5 even units digits, and it holds for every choice of the other digits, so the fraction is 3/5.
D 3/5.
Mark: · log in to save
Problem 17 · 2026 AMC 8 Hard
Counting & Probability casework

Four students sit in a row and chat with the people next to them. They then rearrange themselves so that no one is seated next to anyone they sat next to before. How many such rearrangements are possible?

Show hint (soft nudge)
Label the seats 1, 2, 3, 4; the forbidden neighbor-pairs are 1-2, 2-3, and 3-4.
Show hint (sharpest)
Try to build a valid order — the options turn out to be very tight.
Show solution
  1. No two originally-adjacent students may be neighbors, so none of 1-2, 2-3, 3-4 can touch.
  2. The only orders that work are 2-4-1-3 and its reverse 3-1-4-2, giving 2 rearrangements.
A 2.
Mark: · log in to save
Problem 18 · 2026 AMC 8 Hard
Number Theory consecutive-sums

In how many ways can 60 be written as the sum of two or more consecutive odd positive integers, arranged in increasing order?

Show hint (soft nudge)
A run of k consecutive odd numbers starting at a sums to k(a + k − 1).
Show hint (sharpest)
Test each k that divides 60 and keep the ones giving a positive odd starting value.
Show solution
  1. k consecutive odd numbers starting at a sum to k(a + k − 1) = 60.
  2. Checking divisors, only k = 2 (29 + 31) and k = 6 (5 + 7 + 9 + 11 + 13 + 15) give a positive odd start.
  3. So there are 2 ways.
B 2.
Mark: · log in to save
Problem 19 · 2026 AMC 8 Hard
Ratios, Rates & Proportions relative-distance

Miguel and his dog Luna start together at a park entrance. Miguel throws a ball straight ahead to a tree and keeps walking at a steady pace. Luna sprints to the ball and immediately brings it back to Miguel. Luna runs 5 times as fast as Miguel walks. What fraction of the entrance-to-tree distance does Miguel cover by the time Luna brings him the ball?

Show hint (soft nudge)
In the same time, Luna covers 5 times the distance Miguel does.
Show hint (sharpest)
Luna's path is entrance → tree → Miguel; set its length to 5 times Miguel's walk.
Show solution
  1. Let the entrance-to-tree distance be 1 and Miguel's distance be d. Luna runs to the tree and back to Miguel: 1 + (1 − d) = 2 − d.
  2. Since Luna covers 5 times Miguel's distance, 5d = 2 − d, so 6d = 2 and d = 1/3.
D 1/3.
Mark: · log in to save
Problem 20 · 2026 AMC 8 Stretch
Counting & Probability recursion compositions

The land of Catania uses gold coins (1 mm thick) and silver coins (3 mm thick). In how many ways can Taylor make a stack exactly 8 mm tall using any arrangement of gold and silver coins, where order matters?

Show hint (soft nudge)
Let f(n) count stacks of height n; the top coin is either gold (leaving n − 1) or silver (leaving n − 3).
Show hint (sharpest)
Build the counts up from small heights using f(n) = f(n−1) + f(n−3).
Show solution
  1. With f(0) = f(1) = f(2) = 1, the rule f(n) = f(n−1) + f(n−3) gives 1, 1, 1, 2, 3, 4, 6, 9, 13.
  2. So f(8) = 13 stacks.
D 13.
Mark: · log in to save
Problem 16 · 2025 AMC 8 Hard
Number Theory complementary-counting sum-constraint

Five distinct integers from 1 to 10 are chosen, and five distinct integers from 11 to 20 are chosen. No two numbers differ by exactly 10. What is the sum of the ten chosen numbers?

Show hint (soft nudge)
Each chosen low number blocks exactly one high number. How many highs are left to choose from?
Show hint (sharpest)
Five chosen lows block five highs — leaving exactly five unblocked highs, which are forced to be picked. They're the highs matching the unchosen lows + 10.
Show solution
  1. Each chosen low (say x) blocks the high x + 10. With 5 lows chosen, 5 highs are blocked — so the 5 chosen highs are exactly the 5 unblocked ones: those that are 10 more than the 5 unchosen lows.
  2. Sum of chosen highs = (sum of unchosen lows) + 5 × 10. So (chosen lows) + (chosen highs) = (chosen lows) + (unchosen lows) + 50 = (sum of 1 to 10) + 50.
  3. 1 + 2 + … + 10 = 55, so the total is 55 + 50 = 105.
C 105.
Mark: · log in to save
Problem 17 · 2025 AMC 8 Medium
Fractions, Decimals & Percents percent-multiplier fraction-to-decimal
amc8-2025-17
Show hint (soft nudge)
Workers in A come from all three cities. Tally each city's contribution.
Show hint (sharpest)
From A, the workers who stay are everyone not leaving for B or C. From B and C, just multiply by the labeled fraction.
Show solution
  1. From A → A: those who don't leave. 100 − 100×14 − 100×15 = 100 − 25 − 20 = 55.
  2. From B → A: 120 × 13 = 40.
  3. From C → A: 160 × 18 = 20.
  4. Total working in A: 55 + 40 + 20 = 115.
D 115 people.
Mark: · log in to save
Problem 18 · 2025 AMC 8 Hard
Geometry & Measurement area area-fraction
amc8-2025-18
Show hint (soft nudge)
Both diagrams are the same shape, just scaled. How do areas scale when you change the size?
Show hint (sharpest)
On the right, one quarter of the between-region equals the whole on the left. So the right's between-region is 4× the left's. Areas scale as length2.
Show solution
  1. The two pictures are similar — both show a square inscribed in a circle. So the right's full between-region has area R2 times the left's.
  2. We're told one quarter of the right's between-region equals the left's whole between-region, so the right's whole is 4× the left's: R2 = 4.
  3. R = 2.
B R = 2.
Mark: · log in to save
Problem 19 · 2025 AMC 8 Hard
Ratios, Rates & Proportions distance-speed-time
amc8-2025-19
Show hint (soft nudge)
Once both cars are in the middle section, they're going the same speed — the asymmetry is in how they got there.
Show hint (sharpest)
Car A reaches the middle in 5/25 = 1/5 hr; car B in 5/20 = 1/4 hr. A has a 1/20-hr head start in the middle section — that's 2 miles.
Show solution
  1. Car A's left section is 5 miles at 25 mph → reaches the middle in 5/25 = 1/5 hr. Car B's right section is 5 miles at 20 mph → reaches the middle in 5/20 = 1/4 hr. A enters the middle 1/20 hr before B.
  2. In that 1/20 hr, A travels 40 × 1/20 = 2 miles, so when B enters the middle, A is at mile 7, B at mile 10 — a 3-mile gap.
  3. Both now go 40 mph, closing at 80 mph. They split the 3-mile gap equally: each covers 1.5 miles. A is at 7 + 1.5 = 8.5 miles from A.
D 8.5 miles from A.
Mark: · log in to save
Problem 20 · 2025 AMC 8 Hard
Algebra & Patterns arithmetic-series fraction-to-decimal

Sarika, Dev, and Rajiv are sharing a large block of cheese. They take turns cutting off half of what remains and eating it: first Sarika eats half of the cheese, then Dev eats half of the remaining half, then Rajiv eats half of what remains, then back to Sarika, and so on. They stop when the cheese is too small to see. About what fraction of the original block of cheese does Sarika eat in total?

Show hint (soft nudge)
Sarika eats on turns 1, 4, 7, … — every third turn. What fraction does each Sarika-bite eat?
Show hint (sharpest)
Sarika's bites are 1/2, then 1/16, then 1/128, … — a geometric series with ratio 1/8.
Show solution
  1. Each turn eats half of what's left, so the cheese remaining after turn n is 1/2n. Sarika eats at turns 1, 4, 7, …, taking 12, 116, 1128, … of the original block.
  2. Geometric series with first term a = 12 and ratio r = 18.
  3. Sum = a1 − r = 1/27/8 = 4/7.
A 4/7.
Mark: · log in to save
Problem 16 · 2024 AMC 8 Hard
Counting & Probability careful-counting divisibility

Minh enters the numbers 1 through 81 into the cells of a 9 × 9 grid in some order. She calculates the product of the numbers in each row and column. What is the least number of rows and columns that could have a product divisible by 3?

Show hint (soft nudge)
Any row or column with even one multiple of 3 has a divisible-by-3 product. So you want the multiples of 3 packed into as few rows and columns as possible.
Show hint (sharpest)
Count of multiples of 3 in 1–81: 27. A 5×5 corner block fits 25; the other 2 spill into a 6th column.
Show solution
  1. There are 27 multiples of 3 in 1–81. Any row or column containing a multiple of 3 gets a product divisible by 3, so we want the multiples confined to as few rows and columns as possible.
  2. A 5×5 corner block holds only 25 multiples. The remaining 2 must spill out — place them in the 6th column of rows 1 and 2.
  3. Rows touched: 5 (rows 1–5). Columns touched: 6 (columns 1–6). Total: 5 + 6 = 11.
D 11 rows and columns.
Mark: · log in to save
Problem 17 · 2024 AMC 8 Hard
Counting & Probability casework careful-counting
amc8-2024-17
Show hint (soft nudge)
A king on the center attacks every other square — so neither king can be there.
Show hint (sharpest)
Two cases by where the first king sits: corner (3 squares attacked, 5 safe for the other) or edge-middle (5 attacked, 3 safe).
Show solution
  1. Neither king sits on the center (the center attacks all 8 surrounding squares). So both kings are on the 8 border squares.
  2. Corner first king (4 corners): the corner attacks 3 squares, leaving 5 safe for the other king. 4 × 5 = 20.
  3. Edge-middle first king (4 edge midpoints): attacks 5 squares, leaving 3 safe. 4 × 3 = 12.
  4. Total: 20 + 12 = 32.
E 32 ways.
Mark: · log in to save
Problem 18 · 2024 AMC 8 Hard
Geometry & Measurement area area-fraction
amc8-2024-18
Show hint (soft nudge)
Break the disk into the inner disk, the middle annulus, and the outer annulus. Which of those are fully shaded, and which is split by the angle?
Show hint (sharpest)
Inner annulus (radii 1 to 2): area 3π, fully shaded. Outer annulus (2 to 3): area 5π, only the θ-sector is shaded. Set shaded = unshaded.
Show solution
  1. Inner annulus area: π(22 − 12) = 3π. Outer annulus area: π(32 − 22) = 5π. Inner disk: π.
  2. Total disk = 9π; shaded = unshaded means each = 2 = 4.5π.
  3. Shaded = 3π + θ360(5π) = 4.5π, so θ360(5π) = 1.5π, giving θ = 108°.
A 108°.
Mark: · log in to save
Problem 19 · 2024 AMC 8 Hard
Fractions, Decimals & Percents percent-multiplier careful-counting

Jordan owns 15 pairs of sneakers. Three fifths of the pairs are red and the rest are white. Two thirds of the pairs are high-top and the rest are low-top. The red high-top sneakers make up a fraction of the collection. What is the least possible value of this fraction?

Show hint (soft nudge)
To minimize the overlap of "red AND high-top", let the OTHER kind (white) soak up as many high-tops as it can.
Show hint (sharpest)
9 red, 6 white. 10 high-top, 5 low-top. Make all 6 whites high-top; only 4 high-top spots remain — those must be red.
Show solution
  1. Counts: 35 × 15 = 9 red, 6 white. 23 × 15 = 10 high-top, 5 low-top.
  2. Minimize red high-tops by letting all 6 white pairs be high-top. That accounts for 6 of the 10 high-top spots.
  3. The remaining 10 − 6 = 4 high-top pairs must be red. Fraction = 415.
C 4/15.
Mark: · log in to save
Problem 20 · 2024 AMC 8 Hard
Geometry & Measurement spatial-reasoning careful-counting
amc8-2024-20
Show hint (soft nudge)
An equilateral triangle in a cube can't use edges or space diagonals as sides — only face diagonals work.
Show hint (sharpest)
P has 3 face-diagonal neighbors (one on each of P's three faces). Any 2 of those 3 are also face-diagonal apart, so each pair forms an equilateral triangle with P.
Show solution
  1. Edges have length 1, face diagonals √2, space diagonals √3. An equilateral triangle must use sides of one length, and only face diagonals can form a closed triangle on a cube.
  2. The vertices at face-diagonal distance from P are R, T, V (one on each of P's three faces).
  3. Every pair of {R, T, V} is also a face diagonal (they lie on the three faces opposite to P), so {P, R, T}, {P, R, V}, {P, T, V} are all equilateral.
  4. 3 triangles.
D 3 equilateral triangles.
Mark: · log in to save
Problem 16 · 2023 AMC 8 Medium
Number Theory divisibility symmetry
amc8-2023-16
Show hint (soft nudge)
20 × 20 = 400 cells, with the letters cycling P, Q, R. How does 400 split among three letters?
Show hint (sharpest)
400 = 3 × 133 + 1, so one letter gets the extra 1. By the table's diagonals, P-count = R-count — so Q takes the extra.
Show solution
  1. The board has 20 × 20 = 400 cells, and the P/Q/R pattern repeats every 3 cells diagonally. 400 = 3 × 133 + 1, so the counts are 133, 133, 134 in some order.
  2. Look at the lower-left 2 × 2 corner of the pattern: Q R / P Q — one P, two Qs, one R. By the rest of the board's symmetry (P and R balance), the corner's extra Q is the surplus.
  3. Counts: 133 Ps, 134 Qs, 133 Rs.
C 133 Ps, 134 Qs, 133 Rs.
Mark: · log in to save
Problem 17 · 2023 AMC 8 Hard
Geometry & Measurement spatial-reasoning folding
amc8-2023-17
Show hint (soft nudge)
An octahedron has 8 faces in two hemispheres of 4 each, and exactly 4 faces meet at each vertex.
Show hint (sharpest)
Faces 2, 3, 4, 5 all share a vertex in the net — that's the bottom hemisphere. Top hemisphere = {Q, 6, 7, 1}.
Show solution
  1. An octahedron has 4 faces meeting at each vertex. In the net, faces 2, 3, 4, 5 all share a vertex, so they form one hemisphere (the bottom).
  2. The other hemisphere holds the remaining 4 faces: Q, 6, 7, and 1.
  3. Tracing the fold from Q, edges align so that face 1 ends up to its right.
A Face 1.
Mark: · log in to save
Problem 18 · 2023 AMC 8 Hard
Number Theory divisibility casework

Greta Grasshopper sits on a long line of lily pads in a pond. From any lily pad, Greta can jump 5 pads to the right or 3 pads to the left. What is the fewest number of jumps Greta must make to reach the lily pad located 2023 pads to the right of her starting position?

Show hint (soft nudge)
Order doesn't matter — only the counts of right and left jumps. Set up an equation in R and L.
Show hint (sharpest)
5R − 3L = 2023. Need R ≥ 405 and 5R − 2023 divisible by 3.
Show solution
  1. Order doesn't matter. Let R = right jumps, L = left jumps. Then 5R − 3L = 2023, with R, L ≥ 0.
  2. Minimum R: R ≥ 405 (else 5R < 2023, leaving negative L). And 5R − 2023 must be divisible by 3.
  3. Mod 3: 5R ≡ 2R, and 2023 ≡ 1, so 2R ≡ 1 ⇒ R ≡ 2 (mod 3). The smallest R ≥ 405 satisfying this is 407.
  4. Then L = (5·407 − 2023)/3 = 12/3 = 4. Total: 407 + 4 = 411 jumps.
D 411 jumps.
Mark: · log in to save
Problem 19 · 2023 AMC 8 Medium
Geometry & Measurement area-fraction area
amc8-2023-19
Show hint (soft nudge)
Linear scale 2 : 3 means area scale (2/3)2 = 4/9. Use that to size up the ring of three trapezoids.
Show hint (sharpest)
Set inner area = 4. Outer area = 9. Trapezoidal ring = 9 − 4 = 5, split into 3 trapezoids of area 5/3 each.
Show solution
  1. Let the outer triangle have area 9 and the inner triangle area 4 (since the side ratio is 2:3 → area ratio 4:9).
  2. The ring of three trapezoids has area 9 − 4 = 5; each trapezoid has area 53.
  3. Ratio of one trapezoid to the inner triangle: 5/34 = 512, i.e. 5 : 12.
C 5 : 12.
Mark: · log in to save
Problem 20 · 2023 AMC 8 Hard
Arithmetic & Operations sum-constraint casework

Two integers are inserted into the list 3, 3, 8, 11, 28 to double its range. The mode and median remain unchanged. What is the maximum possible sum of two additional numbers?

Show hint (soft nudge)
Original range = 28 − 3 = 25. New range = 50. To maximize the sum, push the new max as high as possible.
Show hint (sharpest)
Keep min = 3 ⇒ new max = 3 + 50 = 53. That's one insert. Now find the largest second insert that keeps median = 8 and mode = 3.
Show solution
  1. Range doubles from 25 to 50. To maximize the sum, leave the min at 3 and stretch the max: one insert = 3 + 50 = 53.
  2. With 7 numbers, the median is the 4th. Sorted so far: 3, 3, 8, 11, 28, 53 (6 values). The 2nd insert x must keep median = 8.
  3. If x > 8, the 4th value shifts off 8 (and choosing x = 8 ties the mode with two 8's). So x ≤ 7.
  4. Maximum x = 7 (mode stays uniquely 3). Sum = 53 + 7 = 60.
D 60.
Mark: · log in to save