Question 14
Consider a regular hexagon. Paul wishes to colour each of the vertices of the hexagon in green, red or blue, in such a way that there are no neighbouring vertices coloured in the same colour. What is the total number of ways Paul can do such a colouring?
Section B instruction: Show your detailed solution. Each question is worth 20 points.
Section B instruction: Show your detailed solution. Each question is worth 20 points.