Pick what you want, print the page. The answer key comes with it, on its own sheet, and it tells you the mistake behind every wrong choice — not just which letter is right.
This exact URL always produces this exact sheet — bookmark it and the answer key will still match next term. Print with your browser; the controls and the site navigation are left off the page.
1.Suppose it is true that some birds cannot fly. Which of these must also be true?[3]
ANo birds can fly
BAll birds can fly
CMost birds cannot fly
DExactly one bird cannot fly
ENot all birds can fly
2.Nadia gave half her stickers to her brother, then 6 more to a friend. She has 9 left. How many stickers did she start with?[4]
A15
B21
C24
D30
E36
3.Two apples balance three pears. One apple weighs 90 grams. How many grams does one pear weigh?[4]
A45
B60
C90
D135
E180
4.Ana says: "Bo and I are both liars." Each child is either always truthful or always a liar. Who is telling the truth?[4]
AAna only
BBo only
Cboth of them
Dneither of them
Eit cannot be decided
5.All the red boxes are heavy. Box X is not heavy. What must be true?[4]
ABox X is red
BBox X is not red
CBox X is blue
DSome red boxes are light
ENothing can be said about box X
6.Cards numbered 1 to 10 lie face up. You take any six of them. Must two of your cards add up to 11?[4]
AYes, always
BYes, but only if you take the card numbered 1
CNo, six cards can be chosen that avoid it
DOnly if the six numbers are consecutive
EIt cannot be decided without knowing the cards
7.Ana says "Bo is lying." Bo says "Cal is lying." Cal says "Ana and Bo are both lying." How many of the three are telling the truth?[5]
A0
B1
C2
D3
Eit cannot be decided
8.Seven cups all stand upside down. In one move you must turn over exactly two cups. Can all seven ever stand the right way up?[5]
AYes, in 4 moves
BYes, in 7 moves
CYes, but it takes many moves
DIt depends which two cups you pick
ENo, it is impossible
9.A 4 by 4 board has two opposite corner squares removed, leaving 14 squares. Each domino covers exactly two squares that share an edge. Can 7 dominoes cover the board?[5]
Text description of the figure
A 4 by 4 chessboard-style grid coloured in alternating light and dark squares, with the top-left and bottom-right squares removed. Both removed squares were the same colour.
AYes, and there is exactly one way
BYes, and there are several ways
CNo, because 14 is not divisible by 2
DIt depends which corners are removed
ENo, because the colours do not balance
10.A bag holds 5 black and 6 white stones. You repeatedly remove two stones: if they match you put a black one in, if they differ you put a white one in. What colour is the last stone?[5]
Ablack
Bwhite
Cit depends on the order of the moves
Dthe bag never gets down to one stone
Ewhite if the first two stones match
11.One of nine identical-looking coins is slightly heavier. Using only a balance, what is the smallest number of weighings that is certain to find it?[5]
A1
B2
C3
D4
E8
12.The numbers 1 to 10 stand in a row. A move swaps two neighbours. After exactly 45 moves, can the row be back in its starting order?[5]
AYes, always
BYes, if the swaps are chosen well
CNo, because 45 is not a multiple of 10
DNo, because the number of moves is odd
EIt depends which numbers are swapped
13.The numbers 1 to 8 are on a board. A move rubs out two of them and writes their difference, larger minus smaller. After seven moves one number is left. Can it be 1?[5]
AYes, and there are many ways
BYes, but only one way
CNo, the last number is always even
DNo, the last number is always 0
EIt depends on the order of the moves
14.The numbers 1 to 10 are written on a board. You repeatedly rub out any two of them and write down their positive difference instead, until a single number is left. What can be said about that final number?[5]
AIt is always odd
BIt is always even
CIt can be either odd or even
DIt is always zero
EIt is always 1
15.An 8 by 8 chessboard has two opposite corner squares removed, leaving 62 squares. Each domino covers exactly two squares that share an edge. Can the 62 squares be covered exactly by 31 dominoes?[5]
ANo, because the two removed corners share a colour, so 32 squares of one colour remain and only 30 of the other
BYes, because 62 is even and 31 dominoes cover exactly 62 squares
CNo, because 62 is not divisible by 4
DYes, but only if the dominoes may be placed diagonally
ENo, because the board is no longer rectangular
Kangaroo Atlas · https://kangaroo-atlas.vercel.app · seed 2 · CC BY-NC-SA 4.0 · Independent project, not affiliated with Math Kangaroo in USA, NFP.
Answer key — Math Kangaroo practice
Each wrong choice carries the thinking that produces it. When a student picks C, this is what they were doing.
1.E — Not all birds can flyKA-0146Reading a logical statement precisely
AI read some cannot as meaning none can, which is a far stronger claim.
BI chose a statement that directly contradicts the one I was given.
CI read some as meaning a majority, when it only guarantees at least one.
DI read some as meaning exactly one, when it means at least one.
2.D — 30KA-0007Working backwards
AI added the 6 and the 9 and stopped, forgetting to undo the halving at the start.
BI undid the steps in the order they were written instead of reversing the order as well as the operations.
CI doubled the 9 first and then added the 6, which reverses the steps in the wrong order.
EI doubled twice because giving half away felt like it should be undone more than once.
3.B — 60KA-0093Weighing and balance puzzles
AI halved the apple's weight, as if one apple balanced two pears.
CI assumed a pear must weigh the same as an apple because the two sides balance.
DI multiplied the apple's weight by three halves the wrong way round, making the pear heavier.
EI gave the total weight of the two apples rather than the weight of one pear.
4.B — Bo onlyKA-0096Truth-tellers and liars
AI took Ana's statement at face value without checking whether a truthful person could say it.
CI decided nobody was lying without testing Ana's statement against that assumption.
DI believed Ana's statement even after concluding she was a liar, which is what a liar's statement cannot be.
EI gave up when Ana's statement looked circular, instead of testing one assumption all the way through.
5.B — Box X is not redKA-0099Reading a logical statement precisely
AI read the rule backwards, as if being heavy were what makes a box red.
CI assumed not red must mean one particular other colour, when the rule says nothing about which.
DI contradicted the rule I was given rather than applying it to box X.
EI decided one fact could not settle anything, without testing what would follow if X were red.
6.A — Yes, alwaysKA-0102Informal proof by contradiction
BI found one pair that works and assumed the argument depended on that particular card.
CI tried a couple of selections, did not find a pair, and stopped looking.
DI looked for a pattern in the numbers rather than at how many pairs there are to avoid.
EI thought the answer depended on which six were taken, when the counting settles it for every choice.
7.B — 1KA-0017Truth-tellers and liars
AI assumed everyone could be lying at once without checking that Cal's statement would then be true.
CI found one consistent truth-teller and added another without testing whether both could hold together.
DI assumed everyone was telling the truth without noticing that Ana's statement then contradicts Bo's.
EI gave up after one assumption led to a contradiction, instead of trying the other assumption.
8.E — No, it is impossibleKA-0028Parity arguments
AI found a sequence that turned over most of the cups and assumed the last one could be fixed somehow.
BI matched the number of moves to the number of cups without checking whether the target is reachable at all.
CI assumed that with enough moves any arrangement can be reached.
DI thought the choice of which cups to flip could change whether the target is reachable.
9.E — No, because the colours do not balanceKA-0034Coloring arguments
AI assumed that because 14 is even, seven dominoes must fit somehow.
BI tried a few arrangements, got most of the board covered, and assumed a full covering existed.
CI claimed the right answer for the wrong reason, since 14 is in fact divisible by 2.
DI thought removing a different pair of opposite corners could change the colour balance, but opposite corners always share a colour.
10.A — blackKA-0043Invariants and monovariants
BI noticed there are more white stones than black ones and guessed the majority colour would survive.
CI tried a few orders, saw different-looking positions along the way, and assumed the ending must vary too.
DI did not notice that every move takes two stones out and puts one back, so the count falls by exactly one each time.
EI assumed the first move settles the outcome instead of looking for a quantity that no move can change.
11.B — 2KA-0094Weighing and balance puzzles
AI assumed one weighing could separate nine possibilities, but it has only three outcomes.
CI split the coins into halves each time, which wastes the balance's third outcome.
DI weighed the coins one against another in pairs rather than in groups.
EI compared each coin with a known good one in turn, which always works but is nowhere near the fewest.
12.D — No, because the number of moves is oddKA-0097Parity arguments
AI assumed enough moves can undo anything, without asking what each move preserves.
BI tried a few sequences that nearly worked and assumed a better choice would finish the job.
CI reached for the number of items rather than for what a single swap actually changes.
EI thought the choice of swaps could change the outcome, when every swap has the same effect.
13.C — No, the last number is always evenKA-0098Invariants and monovariants
AI found sequences ending in small numbers and assumed 1 was among the reachable ones.
BI assumed a hard-looking question must have exactly one answer.
DI found one sequence ending in 0 and assumed every sequence must end there.
EI thought the order could change the outcome, when the quantity that decides it never changes.
14.A — It is always oddKA-0167Parity arguments
BI checked the parity of the count of numbers rather than of their sum.
CI tried two examples, got different answers, and concluded nothing is forced.
DI assumed differences must shrink all the way to nothing.
EI found one sequence of moves ending at 1 and assumed every sequence must.
15.A — No, because the two removed corners share a colour, so 32 squares of one colour remain and only 30 of the otherKA-0176Coloring arguments
BI checked that the counts match but a matching count does not make a covering possible.
CI invented a divisibility condition; dominoes cover two squares, so only divisibility by 2 could matter.
DI changed the rules rather than testing them; the question says dominoes cover squares sharing an edge.
EI appealed to the shape, but plenty of non-rectangular regions can be tiled by dominoes.