Past exam of the mathematics course of the University of Cambridge 2001 ia Paper 2 12F Solution Created 2026-09-24 Updated 2026-10-14
Fix any starting village and let be the pickup distance, the subsequent passenger distance. From each vertex, the four possible pickup distances are , each with probability . From each pickup village, the three other possible destinations have distances , each with probability .
Sharing the pickup village does not by itself give independence. Here it does hold because the conditional distribution of is the same for every pickup village: for all allowed ,Thus has the taxi distance convolution on a rectangular road cycle. Counting the twelve equally likely pairs givesNo other distances are possible. The probability distribution is the same for every starting village, so no assumption about the previous customer's destination is needed.
The separate moments are , , and . Independence therefore givesAs a check from the displayed probability mass function, and subtracting gives the same variance.