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.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
2.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
3.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
4.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
5.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
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.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.
2.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.
3.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.
4.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.
5.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.