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

JK 2016 Q16

JKCurrent spec6 marksCounting, Probability & Logic

16. The diagram shows part of a river which has two islands in it. There are six bridges linking the islands and the two banks as shown. Leonhard goes for a walk every day in which he walks over each bridge exactly once. He always starts at point \(A\), goes first over bridge 1 and always finishes at point \(B\). What is the maximum number of days that he can walk without repeating the order in which he crosses the bridges?

  1. A 2
  2. B 4
  3. C 5
  4. D 6
  5. E More than 6
A grey river with two white islands; point A is on the top bank and point B on the top bank further right; bridge 1 joins the top bank to the left island, bridge 2 joins the left island to the bottom bank, bridges 3 and 4 join the two islands, bridge 5 joins the right island to the top bank and bridge 6 joins the right island to the bottom bank

Junior Kangaroo 2016, Question 16. © UK Mathematics Trust. Original paper on ukmt.org.uk