A train has n seats, where n≥2. For a particular journey, all n seats have been sold, and each of the n passengers has been allocated a seat.
The passengers arrive one at a time and are labelled T1,…,Tn according to the order in which they arrive: T1 arrives first and Tn arrives last. The seat allocated to Tr (r=1,…,n) is labelled Sr.
Passenger T1 ignores their allocation and decides to choose a seat at random (each of the n seats being equally likely). However, for each r≥2, passenger Tr sits in Sr if it is available or, if Sr is not available, chooses from the available seats at random.
(i) Let Pn be the probability that, in a train with n seats, Tn sits in Sn. Write down the value of P2 and find the value of P3.
(ii) Explain why, for k=2,3,…,n−1,P(Tn sits in Sn∣T1 sits in Sk)=Pn−k+1,and deduce that, for n≥3,Pn=n1(1+r=2∑n−1Pr).(iii) Give the value of Pn in its simplest form and prove your result by induction.
(iv) Let Qn be the probability that, in a train with n seats, Tn−1 sits in Sn−1. Determine Qn for n≥2.