Your progress
Ticks are kept only in this browser: clearing your browsing data or changing device loses them. · ·

JMC 2019 Q11

JMCCurrent spec5 marksCounting, Probability & Logic

11. Two players \(X\) and \(Y\) take alternate turns in a game, starting with the diagram alongside.

At each turn, one player writes one of 1, 2 or 3 in an empty circle, so that no two circles connected by an edge contain the same number. A player loses when they cannot go. In each of the five diagrams below it is \(Y\)’s turn.

In which of the diagrams can \(Y\)’s move ensure that \(X\) loses the game?

Five versions of the diagram, labelled A to E, with different circles already numbered
Five circles joined by edges like a pentagon with one diagonal; two circles contain 2 and 1

Junior Mathematical Challenge 2019, Question 11. © UK Mathematics Trust. Original paper on ukmt.org.uk