🇺🇸 AMC 8 ⇄ switch contest
All lessons / Test-day Habits

Test-day Habits — Save the points you already know how to win.

4 chapters
About this topic

This is a different kind of lesson. Every other topic on this site (arithmetic, number theory, geometry, …) teaches math. This one teaches test-taking — how to actually capture the points you already deserve.

Why is it its own page? Because these habits apply to every problem on a contest, regardless of topic. If you're trying to score 15+, the biggest single lift isn't learning a new technique — it's stopping the silly mistakes that drop already-solvable problems.

Four chapters, easy to hard: (1) the seven habits to build during practice, (2) a toolbox of moves to try when you have no idea how to start, (3) how to turn a blind guess into a smart one, and (4) two tricks that pay off on the very hardest problems (#20–25).

CHAPTER 1

Test-day habits — saving the points you already know

THEORY

Here's the part most kids miss: most of the points you'll lose on a contest aren't from problems you can't solve. They're from problems you CAN solve but where you misread one word, mixed up cents and dollars, or bubbled the wrong letter at the end.

You don't have to learn new math to win those points back. You just have to build a few habits. We call them test-day habits. Practice them on every problem until they feel automatic — then on test day you don't even think about them.

THE SEVEN HABITS

  1. Read the question twice — what does it actually ask? Largest, smallest, how many, what value? Underline the question word.
  2. Circle the tiny words. “inclusive,” “except,” “positive integers,” “non-negative,” “at most,” “different.” These flip answers.
  3. Check the units. Cents vs dollars. Minutes vs hours. Inches vs feet. Square inches vs square feet. A unit slip turns 60 into 1.
  4. Plug the answer back in. If you got x = 5, walk it through every condition the problem gave. If anything breaks, you blew it — restart.
  5. Don't trust mental math past 3 digits. Write it on the scratch paper. Especially × and ÷.
  6. Re-read your final letter. You wrote “C = 12” on the scratch sheet but bubbled (B). It happens. Re-reading the bubble takes 2 seconds.
  7. If a problem is taking too long, mark it and move on. Bagging 18 easy ones is better than losing 3 of them while you wrestle with #22.

Tiny words that flip answers

Here are real traps from past contests — one word changes the answer:

“between 1 and 10”→ does it include 1 and 10?“positive integers”→ 0 doesn't count. 1, 2, 3, …“non-negative”→ 0 DOES count. 0, 1, 2, …“at most 4”→ 4 is allowed. “fewer than 4” means ≤3.“different digits”→ no repeats. 11 doesn't count.“distinct”→ same as “different”. No repeats.

The unit-slip trap

The problem says: “A pencil costs 25 cents. How many pencils can you buy with $5?” If you write 5 ÷ 25, you get 0.2 — nonsense. Translate first: $5 = 500 cents. Then 500 ÷ 25 = 20. The units have to match before you divide.

🎯 Try it
A bus travels at 30 miles per hour. How many minutes does it take to cover 10 miles?
Walkthrough: Distance ÷ speed = time = 10 / 30 = 1/3 of an HOUR. But the question asks for minutes. 1/3 hour × 60 = 20 minutes. The unit slip is reading “hours” off the speed and forgetting to convert.

The two-minute rule

If you've been on one problem for more than two minutes without making progress, mark it and move on. Come back later if there's time. A contest isn't graded on which problems you tried — it's graded on how many you got right. A long battle with one hard problem that ends in a wrong guess just cost you all the easy points after it.

Easy points first. Hard points last. Always.
THE TRICK

Stuck on a hard problem? Before solving, look at the answers. Ask: what do they have in common? What's DIFFERENT about each?

  • If the answers are all whole numbers, the answer has to be a whole number — a fraction means you blew it.
  • If three answers are obviously too big or too small, you've narrowed five down to two with no math.
  • If the answers differ by units digit (3, 5, 7, 9, 11), find the units digit first — that's the easier sub-problem.
  • If the answers differ by parity (odd vs even), find the parity first.

This isn't “cheating.” The answer choices are part of the problem. Contests write them on purpose to reward kids who notice structure.

WORKED EXAMPLE
PROBLEM · 2017 #13

Peter, Emma, and Kyler played chess with each other. Peter won 4 games and lost 2 games. Emma won 3 games and lost 3 games. If Kyler lost 3 games, how many games did he win?

A) 0 B) 1 C) 2 D) 3 E) 4

Peter won 4 games and lost 2. Emma won 3 and lost 3. Kyler lost 3. How many did Kyler win?

The instinct is to set up equations. Don't. Instead use the hidden total constraint: every chess game has exactly one winner and one loser, so

total wins = total losses

across all players. Add up the losses we know: 2 + 3 + 3 = 8. So total wins = 8 as well.

Peter and Emma's wins: 4 + 3 = 7. Kyler's wins = 8 − 7 = 1. Answer (B).

Habit check. The answer choices were 0, 1, 2, 3, 4 — all small whole numbers. We didn't need an equation; we needed the right sentence.

This is a “read the structure” problem. “Every game has a winner and a loser” is the hidden constraint — once you see it, the answer drops out in one line. Kids who try to write a system of equations end up with too many unknowns and panic. Always look for the structural fact first.

Answer: B — 1 win.
RULE OF THUMB

Read twice. Circle tiny words. Match units. Plug answers back. Re-read your bubble. If stuck two minutes, move on. Use the answer choices.

MORE LIKE THIS
2017 · #13 Peter, Emma, and Kyler played chess with each other. Peter won 4 games and lost 2 games. Emma won 3 games and lost 3 games. If Kyler...

Peter, Emma, and Kyler played chess with each other. Peter won 4 games and lost 2 games. Emma won 3 games and lost 3 games. If Kyler lost 3 games, how many games did he win?

Show answer
Answer: B — 1 win.
Show hints
Hint 1 of 2
You're not told how many games were played — and you don't need to be. Every single game produces exactly one winner and one loser, so across everyone, total wins must equal total losses.
Still stuck? Show hint 2 →
Hint 2 of 2
Counting principle: when each event creates one of each kind, the two totals are forced equal. Add up the losses, set wins to match, solve for the unknown.
Show solution
Approach: total wins = total losses
  1. Each game makes one winner and one loser, so summed over all three players, wins = losses. This balance lets you skip working out who played whom.
  2. Total losses: 2 + 3 + 3 = 8. So total wins must also be 8: 4 + 3 + Kyler = 8.
  3. Kyler's wins = 8 − 7 = 1.
  4. Why this transfers: any tournament/handshake/edge-counting setup where each event contributes equally to two tallies lets you equate the tallies instead of reconstructing the schedule.
2022 · #5 Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as...

Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as a birthday present. Today the sum of the ages of the two children and the kitten is 30. How many years older than Bella is Anna?

Show answer
Answer: C — 3 years older.
Show hints
Hint 1 of 2
The two ages you can actually pin down are Bella's and the kitten's — nail those today, and the total does the rest.
Still stuck? Show hint 2 →
Hint 2 of 2
Bella was 6 five years ago, so she's 11; the kitten was newborn, so it's 5. Subtract both from 30 to uncover Anna's age, then compare.
Show solution
Approach: pin down the ages you can know first, then let the total reveal the unknown
  1. Insight: the kitten is the easy clue, not a distraction — “newborn five years ago” means it's exactly 5 today. And Bella, 6 five years ago, is 11 today. Both ages are now fixed.
  2. Anna is the only mystery, and the total 30 hands her to us: Anna = 30 − 11 (Bella) − 5 (kitten) = 14.
  3. Anna − Bella = 14 − 11 = 3 years.
  4. Sanity check: 14 + 11 + 5 = 30. ✓
2019 · #19 In a tournament there are six teams that play each other twice. A team earns 3 points for a win, 1 point for a draw, and 0 points for a...

In a tournament there are six teams that play each other twice. A team earns 3 points for a win, 1 point for a draw, and 0 points for a loss. After all the games have been played it turns out that the top three teams earned the same number of total points. What is the greatest possible number of total points for each of the top three teams?

Show answer
Answer: C — 24 points each.
Show hints
Hint 1 of 2
To push the top three as high as possible, give them every point that's "free" — let all three crush the bottom three in every game. The only points in question are the ones they fight over among themselves.
Still stuck? Show hint 2 →
Hint 2 of 2
A win-then-loss split between two teams yields 3 + 0 = 3 points total, but a draw-draw yields only 1 + 1 = 2. So to maximize and keep the trio tied, settle their head-to-heads with decisive wins, not draws.
Show solution
Approach: sweep the bottom, split decisively among the tied top
  1. Each top team plays the bottom three twice each = 6 games. Winning all of them gives 6 × 3 = 18 points — the maximum any team can grab from outside the trio.
  2. Within the top three, the three pairs play twice each. To keep all three level, give each pair a 1-win, 1-loss split. A win is worth 3 and a loss 0 (better than two draws at 1 each), and the splits cancel out so the trio stays tied.
  3. Each top team sits in 2 of those pairs and wins one game in each: +3 + 3 = 6 more.
  4. Maximum each = 18 + 6 = 24.
  5. Why this transfers: in "maximize a tied group" problems, hand the group all the outside wins, then realize that 3-for-a-win beats splitting points via draws — symmetry keeps the tie while decisive results keep the total high.
2024 · #9 All of the marbles in Maria's collection are red, green, or blue. Maria has half as many red marbles as green marbles and twice as many...

All of the marbles in Maria's collection are red, green, or blue. Maria has half as many red marbles as green marbles and twice as many blue marbles as green marbles. Which of the following could be the total number of marbles in Maria's collection?

Show answer
Answer: E — 28 marbles.
Show hints
Hint 1 of 2
The three colors lock together in fixed ratios, so the total can't be just any number. Name the smallest pile with a variable and the others follow — what does their sum have to be a multiple of?
Still stuck? Show hint 2 →
Hint 2 of 2
Technique: pick the color that makes the others whole. Red is smallest, so let r = red, green = 2r, blue = 4r. Total 7r must be a multiple of 7.
Show solution
Approach: fix the ratios into one variable, find the hidden multiple
  1. Choose the variable to dodge fractions. "Half as many red as green" makes green double the red, so let r = red (the smallest). Then green = 2r, and blue = twice green = 4r.
  2. Total = r + 2r + 4r = 7r — whatever r is, the total is a multiple of 7.
  3. Only 28 = 7 × 4 among the choices is a multiple of 7. This transfers: when quantities are tied by ratios, the total is always a fixed multiple, so the answer must be divisible by the sum of the ratio parts (here 1 + 2 + 4 = 7) — you can often skip straight to that divisibility test.
2005 · #16 A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color....

A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color. The Martian pulls out one sock at a time without looking. How many socks must the Martian remove from the drawer to be certain there will be 5 socks of the same color?

Show answer
Answer: D — 13.
Show hints
Hint 1 of 2
'To be certain' means plan for the unluckiest draw possible. Ask: what's the most socks you could hold and still not have 5 of any one color?
Still stuck? Show hint 2 →
Hint 2 of 2
This is the pigeonhole idea: pile each color as high as it can go without hitting the target (4 each), then the very next sock is forced to push some color over.
Show solution
Approach: pigeonhole — build the worst case, then add one
  1. Imagine the meanest possible luck: 4 red, 4 white, 4 blue. That's 12 socks and still no color has reached 5.
  2. There's nowhere left to hide — the 13th sock must be a 4th color's... no, must be the 5th of some color. So 13 guarantees it.
  3. Why this transfers: for 'how many to guarantee' problems, find the largest haul that fails the goal (here 3×4 = 12), then add 1. The five legs in the story are pure distraction — only the three colors matter.
CHAPTER 2

A toolbox for when you're stuck — five moves to try

THEORY

You have the habits. But what about a problem where you read it and your mind just goes blank — you don't even know how to start? That blank is normal, even for strong solvers. The difference is they have a short list of moves to try, so a blank turns into “let me try this.” Here are five of the most useful, each with our own tiny example.

Strategy framing inspired by Posamentier, The Art of Problem Solving (teacher resource).

Move 1 — Work backward from the end

When the finish is clearer than the start, run the problem in reverse. Whatever was done going forward, undo it going back: add becomes subtract, times becomes divide.

Our numbers. “I picked a number, doubled it, then added 6, and got 20. What was my number?” Don't guess — undo. Last thing done was “add 6,” so first undo that: \(20 - 6 = 14\). Before that we doubled, so undo with halving: \(14 \div 2 = 7\). The number was 7. Check forward: \(7 \times 2 = 14\), \(14 + 6 = 20\). It works.

🎯 Try it
I picked a number, tripled it, then subtracted 4, and got 17. What was my number?
Walkthrough: Work backward. Undo the “subtract 4” first: \(17 + 4 = 21\). Then undo the “triple”: \(21 \div 3 = 7\). The number was 7. Check forward: \(7 \times 3 = 21\), \(21 - 4 = 17\).

Move 2 — Try the extreme case

If a problem gives you freedom (“some number,” “any rectangle,” sizes not given) yet expects ONE answer, push a quantity to its limit — make it as big, as small, or as simple as the rules allow. The extreme is often easy to see, and the promised answer can't change.

Our numbers. “Two friends split into a circle and shake hands once with every other person. With \(n\) people there are \(\tfrac{n(n-1)}{2}\) handshakes — is that formula right?” Test the smallest real case, \(n = 2\): two people, exactly 1 handshake. The formula gives \(\tfrac{2 \times 1}{2} = 1\). Try \(n = 3\): a triangle of \(3\) handshakes, and \(\tfrac{3 \times 2}{2} = 3\). The extreme small cases confirm it fast.

🎯 Try it
Six people are at a party and each one shakes hands exactly once with every other person. How many handshakes happen in all?
Walkthrough: Each of the \(6\) people shakes \(5\) other hands, giving \(6 \times 5 = 30\) — but that counts every handshake twice (once from each side), so divide by \(2\): \(30 \div 2 = \mathbf{15}\). (Sanity check with the extreme case \(n=2\): \(\tfrac{2 \times 1}{2} = 1\) handshake. Right.)

Move 3 — Organize the data into a table

If a problem hands you a pile of facts, stop juggling them in your head. Make a grid and fill in what you know; the missing entry often becomes obvious.

Our numbers. “Anna, Ben, and Cara each own one pet — a cat, a dog, or a fish. Anna does not own the dog or the fish. Ben does not own the fish. Who owns the fish?” Build a yes/no grid: Anna can only be the cat. That frees the dog and fish for Ben and Cara; since Ben isn't the fish, Ben is the dog, so Cara owns the fish. The grid does the remembering for you.

catdogfishAnnaBenCaraYESnononoYESnononoYES

Fill in the forced “no”s; the “yes”s appear on their own.

Move 4 — Account for every possibility (casework)

When a problem asks “how many ways,” split it into a few tidy cases that don't overlap and don't leave anything out, then count each case. The trick is choosing one thing to organize the cases around.

Our numbers. “How many ways can you make 15 cents using only nickels (5¢) and dimes (10¢)?” Organize by number of dimes. Zero dimes: need three nickels (\(15\)) — works. One dime: need one nickel (\(10 + 5 = 15\)) — works. Two dimes: \(20\)¢, too much — stop. So there are 2 ways. By marching through the dime count we're sure we missed nothing.

🎯 Try it
How many ways can you make 30 cents using only nickels (5¢) and dimes (10¢)? Count using any number of each, including zero.
Walkthrough: Organize by the number of dimes. 0 dimes → 6 nickels. 1 dime → 4 nickels (\(10+20\)). 2 dimes → 2 nickels (\(20+10\)). 3 dimes → 0 nickels (\(30\)). 4 dimes would be \(40\)¢, too much. That's 4 ways, and marching through the dime count guarantees none are missed or repeated.

Move 5 — Always CHECK before you bubble

The last move is the cheapest and the most skipped. Once you have an answer, run three quick tests:

THE THREE-PART CHECK

  1. Does it satisfy the conditions? Put your answer back into the problem. Every “and” and “each” has to hold.
  2. Is it the right ballpark? Estimate roughly. If a sensible estimate says “around 50” and you got 4 or 4000, something broke.
  3. Is it the right units — and the thing actually asked? Minutes, not hours. The total, not just one part. The count, not the value.

One pass through these three saves more points than any single technique on the test.

THE TRICK

These five moves share one idea: when you can't see the whole road, take one honest step. Work backward gives you a step from the end. The extreme case gives you a step from the simplest version. A table and casework give you a step by writing things down instead of holding them in your head. And the three-part check is the step that keeps the point once you've earned it. You won't need all five on any one problem — but having the list means a blank page never stays blank.

WORKED EXAMPLE
PROBLEM · 2022 #5

Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as a birthday present. Today the sum of the ages of the two children and the kitten is 30. How many years older than Bella is Anna?

A) 1 B) 2 C) 3 D) 4 E) 5

Anna and Bella are celebrating birthdays. Five years ago, when Bella turned 6, she got a newborn kitten. Today the ages of the two children and the kitten add up to 30. How much older is Anna than Bella?

This is a work-backward plus organize-the-data problem. First pin down today's ages from the past fact. Bella turned 6 five years ago, so Bella is now \(6 + 5 = 11\). The kitten was a newborn (age 0) five years ago, so the kitten is now \(5\).

Now use the total. The three ages sum to 30, so Anna's age is \(30 - 11 - 5 = 14\). The question asks how much older Anna is than Bella: \(14 - 11 = \mathbf{3}\). Answer (C).

Habit check. Re-read the question: it asked for the difference, not Anna's age. A kid who stops at 14 loses the point. Three-part check: ages 14, 11, 5 add to 30 (conditions hold), all are sensible ages (right ballpark), and 3 years is the difference actually asked for (right thing).

The move that unlocks it is translating the past fact into today's numbers first (work backward from “five years ago” to now). Once the kitten and Bella have real ages, the total constraint hands you Anna in one subtraction. The only trap is answering 14 instead of the difference 3 — which the “read the question” habit catches.

Answer: C — 3 years older.
RULE OF THUMB

Stuck? Run the toolbox. Work backward when the end is clearer. Try the extreme when sizes are free. Make a table when facts pile up. Split into cases when it asks “how many ways.” Then check: conditions, ballpark, units-and-question.

MORE LIKE THIS
2022 · #5 Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as...

Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as a birthday present. Today the sum of the ages of the two children and the kitten is 30. How many years older than Bella is Anna?

Show answer
Answer: C — 3 years older.
Show hints
Hint 1 of 2
The two ages you can actually pin down are Bella's and the kitten's — nail those today, and the total does the rest.
Still stuck? Show hint 2 →
Hint 2 of 2
Bella was 6 five years ago, so she's 11; the kitten was newborn, so it's 5. Subtract both from 30 to uncover Anna's age, then compare.
Show solution
Approach: pin down the ages you can know first, then let the total reveal the unknown
  1. Insight: the kitten is the easy clue, not a distraction — “newborn five years ago” means it's exactly 5 today. And Bella, 6 five years ago, is 11 today. Both ages are now fixed.
  2. Anna is the only mystery, and the total 30 hands her to us: Anna = 30 − 11 (Bella) − 5 (kitten) = 14.
  3. Anna − Bella = 14 − 11 = 3 years.
  4. Sanity check: 14 + 11 + 5 = 30. ✓
2000 · #5 Each principal of Lincoln High School serves exactly one 3-year term. What is the maximum number of principals this school could have...

Each principal of Lincoln High School serves exactly one 3-year term. What is the maximum number of principals this school could have during an 8-year period?

Show answer
Answer: C — 4.
Show hints
Hint 1 of 2
8 ÷ 3 isn't a whole number, so the terms don't line up neatly with the window. The trick to MAXIMIZING is to let the window catch the tail end of one term and the front end of another — waste partial terms at both edges.
Still stuck? Show hint 2 →
Hint 2 of 2
To maximize how many things overlap a fixed window, push a boundary just inside each end. The two end-principals only need to touch the window by a single year.
Show solution
Approach: let partial terms hang over both ends of the window
  1. Imagine year 1 is the *final* year of some principal's term — that principal counts, even though most of their term was before our window.
  2. Their 3-year terms then cover years 2–4 (principal 2) and 5–7 (principal 3). That uses years 2 through 7.
  3. Year 8 is the *first* year of a fourth principal — they count too. Total: 4 principals.
  4. The principle: to fit the most fixed-length blocks into a window, align a block boundary just inside each end so the two end blocks only barely overlap — you gain a partial block at each edge. (Choice E's '8' is the trap: a 3-year term can never be just 1 year.)
2000 · #20 You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each...

You have nine coins: a collection of pennies, nickels, dimes, and quarters having a total value of $1.02, with at least one coin of each type. How many dimes must you have?

Show answer
Answer: A — 1 dime.
Show hints
Hint 1 of 2
'At least one of each' is a gift: spend one of each coin up front (41¢) and the puzzle shrinks to placing the 5 leftover coins. Then look at the LAST digit of what's left.
Still stuck? Show hint 2 →
Hint 2 of 2
The total ends in 2 and only pennies change the units digit. So the number of pennies is forced by the final digit — pin that down before worrying about the bigger coins.
Show solution
Approach: pay one of each first, then let the units digit fix the pennies
  1. Take one of each coin off the top: 1 + 5 + 10 + 25 = 41¢, using 4 of the 9 coins. Remaining: 102 − 41 = 61¢ in 5 more coins.
  2. Units digit move: nickels, dimes, quarters all end in 0 or 5, so only pennies can produce the final '1' in 61. With 5 coins, you can't afford 6 pennies — so exactly 1 more penny. Now 60¢ in 4 coins.
  3. 60¢ in 4 coins needs a quarter (four dimes max out at 40¢). Two quarters = 50¢ leaves 10¢ in 2 coins = two nickels. That fills all four with no dime.
  4. So beyond the single starter dime, none are added: 1 dime.
  5. The reusable trick: in coin/total problems, read the *last digit* of the amount — only pennies (the 1¢ pieces) can change it, so the units digit alone often pins the smallest-coin count and collapses the casework.
2005 · #16 A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color....

A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color. The Martian pulls out one sock at a time without looking. How many socks must the Martian remove from the drawer to be certain there will be 5 socks of the same color?

Show answer
Answer: D — 13.
Show hints
Hint 1 of 2
'To be certain' means plan for the unluckiest draw possible. Ask: what's the most socks you could hold and still not have 5 of any one color?
Still stuck? Show hint 2 →
Hint 2 of 2
This is the pigeonhole idea: pile each color as high as it can go without hitting the target (4 each), then the very next sock is forced to push some color over.
Show solution
Approach: pigeonhole — build the worst case, then add one
  1. Imagine the meanest possible luck: 4 red, 4 white, 4 blue. That's 12 socks and still no color has reached 5.
  2. There's nowhere left to hide — the 13th sock must be a 4th color's... no, must be the 5th of some color. So 13 guarantees it.
  3. Why this transfers: for 'how many to guarantee' problems, find the largest haul that fails the goal (here 3×4 = 12), then add 1. The five legs in the story are pure distraction — only the three colors matter.
2004 · #11 The numbers −2, 4, 6, 9 and 12 are rearranged according to these rules: The largest isn't first, but it is in one of the first three...

The numbers −2, 4, 6, 9 and 12 are rearranged according to these rules: The largest isn't first, but it is in one of the first three places. The smallest isn't last, but it is in one of the last three places. The median isn't first or last. What is the average of the first and last numbers?

Show answer
Answer: C — 6.5.
Show hints
Hint 1 of 2
The question only asks about the endpoints, so don't solve the full ordering — just figure out which numbers are banned from the ends. Each rule kicks one specific number off at least one end.
Still stuck? Show hint 2 →
Hint 2 of 2
The strategy is answer only what's asked via elimination: rather than placing all five numbers, rule out who can't be on the ends. Whoever's left must be on the ends — and you never needed the middle three.
Show solution
Approach: rule out the ends, ignore the middle
  1. Identify the three special values: largest 12, smallest −2, median 6. Now read the rules as bans on the endpoints: the largest 'isn't first' and lives in the first three (so not last either) → 12 is off both ends; the smallest 'isn't last' and lives in the last three (so not first) → −2 is off both ends; the median 'isn't first or last' → 6 is off both ends.
  2. Three of the five numbers are forbidden from both endpoints, so the two endpoints must be the survivors: 4 and 9.
  3. Average of the ends: (4 + 9) ÷ 2 = 6.5.
  4. The transferable lesson: when a puzzle asks for one feature, attack that feature directly. We never determined whether 4 or 9 is first — and we never had to, because their average is the same either way.
CHAPTER 3

Eliminate wrong answers — make every guess a smart guess

THEORY

Sometimes the toolbox doesn't crack it and time runs short. That's fine — on these contests there is no penalty for a wrong answer, so you should put a letter on every problem. But a blind 1-in-5 guess is a waste — you can almost always do better.

The secret: you often don't need the whole answer. One small, cheap-to-compute property of the answer can knock out most of the choices.

units digit must be 1 →13579

Find one property of the answer, and four choices fall.

THE TRICK

Before guessing, run down this checklist. Each tactic is something you can compute in seconds:

TacticThe moveCrosses off choices that…
Units digitCompute only the last digitend in the wrong digit
ParityAsk: is the answer odd or even?have the wrong parity
Size / estimateGet the rough magnitudeare far too big or too small
Must divideThe answer has to be a multiple (or factor) of somethingaren't multiples of it
Plug in the choicesTest each option in the problem's conditionfail the condition
Odd one outIf four choices share a pattern, suspect the loner (use with care)— pick the one that breaks the pattern

Most problems hand you at least one of these for free. Two of them together usually leave a single survivor.

WORKED EXAMPLE
PROBLEM · 2012 #12

What is the units digit of 132012?

A) 1 B) 3 C) 5 D) 7 E) 9

What is the units digit of 132012?   (A) 1   (B) 3   (C) 5   (D) 7   (E) 9

You will never compute 132012. You don't have to — the question only asks for one property: the last digit.

Only the units digit of the base matters, so track powers of 3:

31=3, 32=9, 33=27, 34=81, then 3, 9, 7, 1, … — a cycle of 4: (3, 9, 7, 1).

2012 is a multiple of 4, so we land on the end of a cycle → units digit 1. That's choice (A) — and notice we never needed the actual number.

Even if the cycle had slipped your mind, the units digit of an odd power of an odd number is odd, and 5 only appears from a base ending in 5 — so (C) is out instantly, and a quick estimate of where the cycle lands clears the rest.

Answer: A — 1.
RULE OF THUMB

Never leave a blank. Before you guess, find one property of the answer — units digit, parity, size, a factor it must have — and delete every choice that fails it. A 1-in-2 guess is worth far more than a 1-in-5.

MORE LIKE THIS
2012 · #12 What is the units digit of 132012?

What is the units digit of 132012?

Show answer
Answer: A — 1.
Show hints
Hint 1 of 2
You'll never compute 132012 — and you don't have to. When you multiply, only the units digit of each factor affects the units digit of the answer, so 132012 ends in the same digit as 32012.
Still stuck? Show hint 2 →
Hint 2 of 2
Now list a few powers of 3 and watch the last digit: 3, 9, 7, 1, then 3 again. It cycles with period 4 — so the answer depends only on where 2012 lands in that cycle of 4.
Show solution
Approach: units digits repeat in a short cycle — find the position
  1. The units digit of a product depends only on the units digits being multiplied, so 132012 ends in the same digit as 32012. The big base is irrelevant.
  2. List the last digits of powers of 3: 31→3, 32→9, 33→7, 34→1, 35→3… They loop every 4 powers: (3, 9, 7, 1).
  3. So divide the exponent by 4 and look at the leftover: 2012 = 4 × 503 with leftover 0, meaning we land exactly on the end of a cycle — the 4th spot, which is 1.
  4. This transfers to every units-digit problem: last digits always cycle (period 1, 2, or 4 for single digits); find the cycle length, then reduce the exponent by that length. A leftover of 0 lands on the last entry, not the first.
1997 · #25 All the even numbers from 2 to 98 inclusive, except those ending in 0, are multiplied together. What is the units digit of the product?

All the even numbers from 2 to 98 inclusive, except those ending in 0, are multiplied together. What is the units digit of the product?

Show answer
Answer: D — 6.
Show hints
Hint 1 of 2
A units digit only depends on the units digits of the factors — the tens never reach the ones place. So 12, 22, 32, … all behave like '2', and the long list shrinks to a repeating pattern of 2, 4, 6, 8.
Still stuck? Show hint 2 →
Hint 2 of 2
For a units digit of a huge product, replace each factor by its units digit, group the repeats, and use the fact that units digits of powers cycle.
Show solution
Approach: reduce to units digits, group, then use power cyclicity
  1. Excluding multiples of 10, each block of ten (2,4,6,8 then 12,14,16,18 …) contributes the units digits 2, 4, 6, 8. Their product ends like 2 × 4 × 6 × 8 = 384, i.e. units digit 4.
  2. From 2 to 98 there are 10 such blocks, so the overall units digit is that of 4¹⁰.
  3. Powers of 4 cycle 4, 6, 4, 6, …: 4² = 16 ends in 6, and any power of 6 ends in 6, so 4¹⁰ = (4²)⁵ ends in 6.
  4. You'll see it again: units digits of nⁿ-style products are tamed by (1) keeping only units digits and (2) exploiting their short repeating cycle — never multiply the giant number out.
1999 · #24 When 19992000 is divided by 5, the remainder is

When 19992000 is divided by 5, the remainder is

Show answer
Answer: D — 1.
Show hints
Hint 1 of 2
You'll never compute 1999²⁰⁰⁰ — and you don't have to. The remainder when dividing by 5 depends only on the units digit, and the units digit of a power depends only on the units digit of the base. So really you're asking: what does 9²⁰⁰⁰ end in?
Still stuck? Show hint 2 →
Hint 2 of 2
Units digits of powers always fall into a short repeating cycle. List a few powers of 9 and the pattern jumps out; then use whether the exponent is odd or even.
Show solution
Approach: the units digit cycles — find where the even exponent lands
  1. Dividing by 5 only cares about the last digit (10, 20, 30, … are all multiples of 5), and the last digit of a power only depends on the base's last digit, 9.
  2. Powers of 9 cycle in their units digit: 9, 81, 729, … → 9, 1, 9, 1, … Odd exponent → ends in 9, even exponent → ends in 1. Since 2000 is even, 1999²⁰⁰⁰ ends in 1.
  3. A number ending in 1 is one more than a multiple of 10 (hence of 5), so the remainder is 1. The transferable idea: for last-digit or mod-5/mod-10 questions, ignore the giant number and ride the short repeating cycle of units digits.
Another way — reduce the base mod 5 first:
  1. Modulo 5, 1999 leaves remainder 4 (since 2000 is a multiple of 5), so 1999²⁰⁰⁰ ≡ 4²⁰⁰⁰ (mod 5).
  2. And 4 ≡ −1 (mod 5), so 4²⁰⁰⁰ ≡ (−1)²⁰⁰⁰ = 1 (mod 5).
  3. The remainder is 1. Spotting that the base is −1 away from a multiple of 5 makes an even power collapse to 1 instantly — a clean trick once you've met modular arithmetic.
1996 · #15 The remainder when the product 1492 · 1776 · 1812 · 1996 is divided by 5 is

The remainder when the product 1492 · 1776 · 1812 · 1996 is divided by 5 is

Show answer
Answer: E — 4.
Show hints
Hint 1 of 2
Never multiply those huge four-digit numbers! When you divide by 5, only the LAST digit decides the leftover (because 5 divides evenly into every 10, 100, 1000…). So just watch the units digits.
Still stuck? Show hint 2 →
Hint 2 of 2
The units digit of the whole product comes only from multiplying the units digits together. Find that final units digit, then ask how much is left over after taking out 5s.
Show solution
Approach: only the units digit matters
  1. Dividing by 5 only cares about the last digit, since 5 splits evenly into 10, 100, 1000…. The four factors end in 2, 6, 2, 6, and the product's last digit is the last digit of 2·6·2·6 = 144, which is 4.
  2. A number ending in 4 has leftover 4 after pulling out as many 5s as possible (every number ending in 0 or 5 is a clean multiple of 5, so an ending of 4 sits 4 past the last one).
  3. Why this transfers: for 'remainder when divided by 5 (or 10, or 2),' chop everything down to units digits first. The last digit of a product depends only on the last digits of the factors — a giant computation shrinks to one tiny multiplication.
CHAPTER 4

Two tricks for the very hardest problems

THEORY

By now you have the everyday habits, a toolbox to start a blank problem, and a way to guess smart. The last chapter is the ceiling: the hardest problems on the test — the last handful, where the difficulty spikes. Those are where the kid going for a top score actually battles. Two specific moves help here, and neither one requires more math knowledge. They’re ways of using the problem against itself.

Trick 1 — engineering induction

When a problem has a variable like “there are n people in a row” and you can’t compute the answer directly, try n = 1, then n = 2, then n = 3. Write the answers in a column. Look for the pattern. Assume it continues.

This isn’t a formal proof — but in competition math, it’s almost always right. The contest setters write problems where the pattern is honest.

Example. “How many regions does n straight lines divide the plane into, if no two are parallel and no three meet at a point?” Compute small cases: n=0 → 1 region. n=1 → 2. n=2 → 4. n=3 → 7. n=4 → 11. Differences: 1, 2, 3, 4 — each new line adds one more region than the previous. Pattern locked. For n=10, regions = 1 + (1+2+…+10) = 56.

Trick 2 — use the freedom in the problem

If the problem says “in any triangle” or “for any rectangle,” then ANY example you pick will give the right answer.

Pick the easiest one. Equilateral triangle. Square. Numbers like 1 or 10. The problem PROMISED the answer doesn’t depend on which one you pick — so use the simplest.

Example. “In an equilateral triangle ABC, point P is inside. The sum of distances from P to the three sides is constant. What is it?” The problem says “constant” — so the answer doesn’t depend on where P is. Pick P at the center. Now everything is symmetric and you can read off the answer in one line.

If the problem says “works for any X,” pick the easiest X. The setter has already done the heavy lifting.
THE TRICK

Both tricks share a philosophy: let the structure of the problem do work for you. Engineering induction lets the small cases reveal the pattern. The freedom trick lets you replace a hard configuration with an easy one. Neither one requires more math — they require recognizing that the problem allows you to simplify.

WORKED EXAMPLE
PROBLEM · 2017 #13

Peter, Emma, and Kyler played chess with each other. Peter won 4 games and lost 2 games. Emma won 3 games and lost 3 games. If Kyler lost 3 games, how many games did he win?

A) 0 B) 1 C) 2 D) 3 E) 4

Same problem as ch.1 (Peter, Emma, Kyler chess). But notice another way to think about it — the ‘use the freedom’ angle.

The problem gives us just enough info: three losses, two players’ wins, and a structural constraint (every game has 1 winner and 1 loser). If we listed every possible game outcome, the casework would explode. But the problem promised the answer is determined — so there’s a structural fact that pins it down. Look for it. Find: total wins = total losses. Done.

Every well-formed contest problem has the just-enough property. If you feel like you’re drowning in possibilities, you’re missing the structural fact. Pause and look for it.

This is the meta-lesson: when you’re stuck, the problem is trying to give you a shortcut you haven’t spotted yet. Slow down. What constraint connects EVERY piece of given info? That’s usually the move.

Answer: B — 1 win.
RULE OF THUMB

Engineering induction: try n=1, 2, 3, spot the pattern, continue. Use the freedom: when the problem says “for any X,” pick the easiest X. And in general: if a problem feels too hard, you’re missing a structural fact. Slow down and look.

MORE LIKE THIS
2019 · #25 Alice has 24 apples. In how many ways can she share them with Becky and Chris so that each of the three people has at least two apples?

Alice has 24 apples. In how many ways can she share them with Becky and Chris so that each of the three people has at least two apples?

Show answer
Answer: C — 190 ways.
Show hints
Hint 1 of 2
The "at least 2 each" rule is the only obstacle — so satisfy it up front. Hand everyone their 2 apples first; whatever's left can be split with no rules at all.
Still stuck? Show hint 2 →
Hint 2 of 2
Now it's "split N identical apples among 3 people, zero allowed." That's stars and bars: lay out the apples in a row and choose where 2 dividers go.
Show solution
Approach: give the minimum first, then unrestricted stars and bars
  1. Pre-give 2 apples to each person (6 used), so the floor is automatically met. That leaves 18 apples to hand out among the three with no lower limit — the hard constraint is gone.
  2. Picture the 18 apples in a row; placing 2 dividers among them splits them into the three shares (a person can get 0). Choosing 2 divider slots out of 18 + 2 = 20 positions gives C(20, 2) = 190.
  3. Why this transfers: a "each gets at least k" condition is removed by pre-allotting k to everyone, converting it to the standard zero-allowed stars-and-bars count C(n + r − 1, r − 1).
2024 · #25 A small airplane has 4 rows of seats with 3 seats in each row. Eight passengers have boarded the plane and are distributed randomly...

A small airplane has 4 rows of seats with 3 seats in each row. Eight passengers have boarded the plane and are distributed randomly among the seats. A married couple is next to board. What is the probability there will be 2 adjacent seats in the same row for the couple?

Show answer
Answer: C — 20/33.
Show hints
Hint 1 of 2
Counting WHERE the couple can sit is messy — there are many ways to leave an open pair. Flip it: count the seatings where the couple CAN'T sit together (no open adjacent pair), which is far more rigid, then subtract.
Still stuck? Show hint 2 →
Hint 2 of 2
The 8 passengers can sit in C(12,8) = 495 ways. Per row L-M-R, an adjacent open pair is blocked exactly when M is taken OR both L and R are taken. Case-split on k = how many of the 4 middle seats are occupied.
Show solution
Approach: complementary counting on middle-seat occupancies
  1. Counting the "couple fits" seatings directly is a tangle, so count the COMPLEMENT — seatings with no open adjacent pair anywhere — and subtract from the total. Total ways to seat 8 passengers in 12 seats (order ignored): C(12, 8) = 495.
  2. For NO adjacent pair to be open in a row L–M–R: either M is occupied, or both L and R are occupied. Casework on k = number of rows with M occupied:
  3. k = 0: all four M's empty ⇒ all 8 edge seats filled. 1 way.
  4. k = 1: 4 choices of row, then 2 choices for the extra passenger in that row's edges. 8 ways.
  5. k = 2: C(4,2) = 6 row-choices × C(4,2) = 6 placements of remaining 2 passengers in the 4 unfilled edges. 36 ways.
  6. k = 3: C(4,3) = 4 row-choices × C(6,3) = 20 placements of remaining 3 passengers. 80 ways.
  7. k = 4: all middles filled (4 passengers); C(8,4) = 70 placements of the remaining 4 on edges. 70 ways.
  8. Total "no open pair": 1 + 8 + 36 + 80 + 70 = 195. So the favorable count = 495 − 195 = 300.
  9. Probability = 300495 = 2033. This transfers: when "at least one good spot exists" has many overlapping ways to happen, count the cleaner complement ("no good spot") instead — here the no-pair condition reduced to a tidy per-row rule and a single case-split.
2023 · #25 Fifteen integers a1, a2, a3, …, a15 are arranged in order on a number line. The integers are equally spaced and have the property that1...

Fifteen integers a1, a2, a3, …, a15 are arranged in order on a number line. The integers are equally spaced and have the property that

1 ≤ a1 ≤ 10,   13 ≤ a2 ≤ 20,   and   241 ≤ a15 ≤ 250.

What is the sum of the digits of a14?

Show answer
Answer: A — 8.
Show hints
Hint 1 of 2
‘Equally spaced integers’ means an arithmetic sequence: every step adds the same whole number d. The whole problem turns on pinning down that single d.
Still stuck? Show hint 2 →
Hint 2 of 2
The span a15a1 = 14d. Squeeze it: subtract the smallest a1 from the largest a15 for the upper end and vice-versa, getting 231 ≤ 14d ≤ 249. Only one multiple of 14 lives there.
Show solution
Approach: nail d from bounds, then a1, then a14
  1. Equally spaced = arithmetic, so a fixed integer d is added each step. The clever part: although a1 and a15 are each only known within a window, their difference 14d is squeezed into a narrow range — and that range may contain just one multiple of 14.
  2. Widest and narrowest gaps: 241 − 10 ≤ 14d ≤ 250 − 1, i.e. 231 ≤ 14d ≤ 249. The only multiple of 14 in there is 238 = 14 × 17, so d = 17.
  3. Now back-substitute: a2 = a1 + 17 ≤ 20 forces a1 ≤ 3, while a15 = a1 + 238 ≥ 241 forces a1 ≥ 3. The two pincers meet at a1 = 3.
  4. a14 = a15d = (3 + 238) − 17 = 224, so the digit sum is 2 + 2 + 4 = 8. This transfers: when loose bounds multiply into a tight one, a divisibility condition (here ‘multiple of 14’) often leaves a single survivor — squeeze, then sieve.
2022 · #25 A cricket randomly hops between 4 leaves, on each turn hopping to one of the other 3 leaves with equal probability. After 4 hops, what...

A cricket randomly hops between 4 leaves, on each turn hopping to one of the other 3 leaves with equal probability. After 4 hops, what is the probability that the cricket has returned to the leaf where it started?

Show answer
Answer: E — 7/27.
Show hints
Hint 1 of 2
Don't track which of the four leaves — the three non-start leaves all behave identically. Collapse the whole thing to one number: pn = the chance of being on the start leaf after n hops.
Still stuck? Show hint 2 →
Hint 2 of 2
Build a one-step rule. If you're on start, you must leave (so you got there only from a non-start leaf); from any non-start leaf, exactly 1 of the 3 hops returns to start. So pn+1 = (1 − pn) · 13.
Show solution
Approach: collapse 4 states to 1 by symmetry, then step a recursion
  1. Insight: the three leaves that aren't the start are interchangeable, so you never need to know which one the cricket is on — only whether it's home. Track a single number pn = P(on starting leaf after n hops).
  2. One-step rule: to be on start next hop, the cricket must currently be off-start (probability 1 − pn) and then pick the one returning hop out of 3. So pn+1 = (1 − pn) · 13.
  3. Iterate from p0 = 1: p1 = 0, p2 = 13, p3 = 29, p4 = (1 − 29) ÷ 3 = 79 ÷ 3 = 727.
  4. You'll see this again: when many states behave the same, merge them into one tracked quantity (here “home vs. away”) — a multi-state random walk becomes a single tidy recursion.
Another way — just count the paths (all are equally likely):
  1. Each hop is 1 of 3 equally likely choices, so the 4 hops give 34 = 81 equally likely paths. Count how many end back at the start.
  2. Such a return path must use the start as a “stepping point” an even number of times in the middle. Counting the closed length-4 walks gives 21 of them.
  3. Probability = 2181 = 727 — matching the recursion, a good cross-check.
⬢ FINAL TEST

Habit-builder problems

Five mid-difficulty problems where the lightest path requires reading carefully and using structure, not brute-force computation.

2017 · #13 Peter, Emma, and Kyler played chess with each other. Peter won 4 games and lost 2 games. Emma won 3 games and lost 3 games. If Kyler...

Peter, Emma, and Kyler played chess with each other. Peter won 4 games and lost 2 games. Emma won 3 games and lost 3 games. If Kyler lost 3 games, how many games did he win?

Show answer
Answer: B — 1 win.
Show hints
Hint 1 of 2
You're not told how many games were played — and you don't need to be. Every single game produces exactly one winner and one loser, so across everyone, total wins must equal total losses.
Still stuck? Show hint 2 →
Hint 2 of 2
Counting principle: when each event creates one of each kind, the two totals are forced equal. Add up the losses, set wins to match, solve for the unknown.
Show solution
Approach: total wins = total losses
  1. Each game makes one winner and one loser, so summed over all three players, wins = losses. This balance lets you skip working out who played whom.
  2. Total losses: 2 + 3 + 3 = 8. So total wins must also be 8: 4 + 3 + Kyler = 8.
  3. Kyler's wins = 8 − 7 = 1.
  4. Why this transfers: any tournament/handshake/edge-counting setup where each event contributes equally to two tallies lets you equate the tallies instead of reconstructing the schedule.
2022 · #5 Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as...

Anna and Bella are celebrating their birthdays together. Five years ago, when Bella turned 6 years old, she received a newborn kitten as a birthday present. Today the sum of the ages of the two children and the kitten is 30. How many years older than Bella is Anna?

Show answer
Answer: C — 3 years older.
Show hints
Hint 1 of 2
The two ages you can actually pin down are Bella's and the kitten's — nail those today, and the total does the rest.
Still stuck? Show hint 2 →
Hint 2 of 2
Bella was 6 five years ago, so she's 11; the kitten was newborn, so it's 5. Subtract both from 30 to uncover Anna's age, then compare.
Show solution
Approach: pin down the ages you can know first, then let the total reveal the unknown
  1. Insight: the kitten is the easy clue, not a distraction — “newborn five years ago” means it's exactly 5 today. And Bella, 6 five years ago, is 11 today. Both ages are now fixed.
  2. Anna is the only mystery, and the total 30 hands her to us: Anna = 30 − 11 (Bella) − 5 (kitten) = 14.
  3. Anna − Bella = 14 − 11 = 3 years.
  4. Sanity check: 14 + 11 + 5 = 30. ✓
2019 · #19 In a tournament there are six teams that play each other twice. A team earns 3 points for a win, 1 point for a draw, and 0 points for a...

In a tournament there are six teams that play each other twice. A team earns 3 points for a win, 1 point for a draw, and 0 points for a loss. After all the games have been played it turns out that the top three teams earned the same number of total points. What is the greatest possible number of total points for each of the top three teams?

Show answer
Answer: C — 24 points each.
Show hints
Hint 1 of 2
To push the top three as high as possible, give them every point that's "free" — let all three crush the bottom three in every game. The only points in question are the ones they fight over among themselves.
Still stuck? Show hint 2 →
Hint 2 of 2
A win-then-loss split between two teams yields 3 + 0 = 3 points total, but a draw-draw yields only 1 + 1 = 2. So to maximize and keep the trio tied, settle their head-to-heads with decisive wins, not draws.
Show solution
Approach: sweep the bottom, split decisively among the tied top
  1. Each top team plays the bottom three twice each = 6 games. Winning all of them gives 6 × 3 = 18 points — the maximum any team can grab from outside the trio.
  2. Within the top three, the three pairs play twice each. To keep all three level, give each pair a 1-win, 1-loss split. A win is worth 3 and a loss 0 (better than two draws at 1 each), and the splits cancel out so the trio stays tied.
  3. Each top team sits in 2 of those pairs and wins one game in each: +3 + 3 = 6 more.
  4. Maximum each = 18 + 6 = 24.
  5. Why this transfers: in "maximize a tied group" problems, hand the group all the outside wins, then realize that 3-for-a-win beats splitting points via draws — symmetry keeps the tie while decisive results keep the total high.
2024 · #9 All of the marbles in Maria's collection are red, green, or blue. Maria has half as many red marbles as green marbles and twice as many...

All of the marbles in Maria's collection are red, green, or blue. Maria has half as many red marbles as green marbles and twice as many blue marbles as green marbles. Which of the following could be the total number of marbles in Maria's collection?

Show answer
Answer: E — 28 marbles.
Show hints
Hint 1 of 2
The three colors lock together in fixed ratios, so the total can't be just any number. Name the smallest pile with a variable and the others follow — what does their sum have to be a multiple of?
Still stuck? Show hint 2 →
Hint 2 of 2
Technique: pick the color that makes the others whole. Red is smallest, so let r = red, green = 2r, blue = 4r. Total 7r must be a multiple of 7.
Show solution
Approach: fix the ratios into one variable, find the hidden multiple
  1. Choose the variable to dodge fractions. "Half as many red as green" makes green double the red, so let r = red (the smallest). Then green = 2r, and blue = twice green = 4r.
  2. Total = r + 2r + 4r = 7r — whatever r is, the total is a multiple of 7.
  3. Only 28 = 7 × 4 among the choices is a multiple of 7. This transfers: when quantities are tied by ratios, the total is always a fixed multiple, so the answer must be divisible by the sum of the ratio parts (here 1 + 2 + 4 = 7) — you can often skip straight to that divisibility test.
2005 · #16 A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color....

A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color. The Martian pulls out one sock at a time without looking. How many socks must the Martian remove from the drawer to be certain there will be 5 socks of the same color?

Show answer
Answer: D — 13.
Show hints
Hint 1 of 2
'To be certain' means plan for the unluckiest draw possible. Ask: what's the most socks you could hold and still not have 5 of any one color?
Still stuck? Show hint 2 →
Hint 2 of 2
This is the pigeonhole idea: pile each color as high as it can go without hitting the target (4 each), then the very next sock is forced to push some color over.
Show solution
Approach: pigeonhole — build the worst case, then add one
  1. Imagine the meanest possible luck: 4 red, 4 white, 4 blue. That's 12 socks and still no color has reached 5.
  2. There's nowhere left to hide — the 13th sock must be a 4th color's... no, must be the 5th of some color. So 13 guarantees it.
  3. Why this transfers: for 'how many to guarantee' problems, find the largest haul that fails the goal (here 3×4 = 12), then add 1. The five legs in the story are pure distraction — only the three colors matter.
APPENDIX

Test-day habits quick-reference

Memorize these

THE SEVEN HABITS

  1. Read the question twice. Underline the question word. What does it actually ask?
  2. Circle the tiny words. “inclusive,” “except,” “positive,” “non-negative,” “at most,” “different,” “distinct.”
  3. Match the units. Cents vs dollars. Minutes vs hours. Inches vs feet.
  4. Plug your answer back in. Does it satisfy every condition the problem stated?
  5. Don’t trust mental math past 3 digits. Write it on scratch.
  6. Re-read your final letter. The bubble has to match your work.
  7. Two-minute rule. If a problem’s taking too long, mark it and move on.

USE THE ANSWERS

The answer choices are part of the problem. Ask: what do they have in common? What’s DIFFERENT about each?

  • All whole numbers → the answer is a whole number.
  • Three choices obviously too big or too small → cross them off without solving.
  • Choices differ by units digit → find the units digit; you’re done.
  • Choices differ by parity → find the parity first.

STUCK? RUN THE TOOLBOX

  • Work backward when the finish is clearer than the start — undo each step (add→subtract, times→divide).
  • Try the extreme case when sizes are free — push a quantity to its smallest or simplest value.
  • Make a table when facts pile up — let the grid do the remembering.
  • Split into cases on “how many ways” — tidy, non-overlapping cases that miss nothing.

THE THREE-PART CHECK

  1. Conditions: does your answer satisfy every “and” and “each” in the problem?
  2. Ballpark: is it roughly the size a quick estimate predicts?
  3. Units & question: right units, and the thing actually asked (total not part, count not value)?
Common traps
  • Stopping at step 1. The question may have asked for X+Y, but you found just X.
  • Wrong unit. Answer is right in seconds but the question wanted minutes.
  • Off-by-one inclusive vs exclusive. “Pages 5 to 12” is 8 pages, not 7.
  • Bubbling the wrong letter. You wrote (C) but bubbled (B). A 2-second re-read prevents this.
  • Burning time on a hard problem. Every minute past 2 on one problem is two easy problems you didn’t reach.
  • Casework that overlaps or leaves a gap. Cases must miss nothing and double-count nothing — organize them around one thing (e.g. the number of dimes) and march through it in order.
  • Forgetting to divide by 2. When you count handshakes or pairs by “each of \(n\) does \(n-1\),” every pair is counted twice — divide by 2.
Warm-ups

Practice these habits on every problem — they should feel automatic by test day:

  • Underline the question word on every problem you solve.
  • Before computing, scan the answer choices — what kind of number is the answer?
  • After you write your answer, plug it back in.
  • Set a 2-minute timer per problem in practice. Mark anything you can’t finish.

For the last handful of problems (#20–25), two moves do most of the heavy lifting:

  • Engineering induction. When the problem has a variable like “\(n\) people in a row,” compute \(n=1, 2, 3\), write the answers in a column, and find the pattern. It isn’t a proof, but contest patterns are honest. (Lines cutting a plane: \(1, 2, 4, 7, 11, \ldots\) — each new line adds one more region than the last.)
  • Use the freedom. If a problem says it holds for any triangle / rectangle / number, then any example gives the right answer — so pick the easiest one (equilateral, square, the number 1 or 10). The setter promised the answer doesn’t depend on your choice.
  • The structural fact. If a hard problem feels like drowning in possibilities, you’re missing one fact that connects every given (e.g. “every game has one winner and one loser” \(\Rightarrow\) total wins = total losses). Slow down and hunt for it before computing.