Question 1
24 marks
Visiting five factories: bounds on the shortest route and a Markov chain
- Geometry and trigonometry
- Statistics and probability
(a)
3 marks
From the nearest is (40), then from the nearest is (50), from the nearest is (60), from the nearest is (90), then (80) and back to (85).
(b)(i)
3 marks
Start at . Pick the shortest available edge each time: (50), (60), (90), (80).
(b)(ii)
2 marks
Add the two shortest edges from , which are and .
(c)(i)
1 mark
The column for gives the probabilities of the next factory after visiting , and .
(c)(ii)
1 mark
The column for adds to 1: .
(c)(iii)
1 mark
The column for adds to 1: .
(d)(i)
1 mark
Audrey starts at .
(d)(ii)
2 marks
- The fifth factory is after four transitions, so use .
- The probability that it is .
(d)(iii)
5 marks
- From the second factory is (probability 0.7) or (probability 0.3). The fifth factory is the same as the second if, after three more steps, she is back at it.
- Using : the probability of going from to in 3 steps is 0.248 and from to in 3 steps is 0.251.
(e)(i)
2 marks
Find the steady state vector on the calculator.
(e)(ii)
3 marks
She travels from home to the factory and back, so each visit is the distance to the factory (A 40, B 85, C 160, D 100, E 70).

