\(\,\)
There are 28 colleges in Cambridge, of which two (New Hall and Newnham) are for women only; the others admit both men and women. Seven women, Anya, Betty, Celia, Doreen, Emily, Fariza and Georgina, are all applying to Cambridge. Each has picked three colleges at random to enter on her application form.
Solution:
I have a bag containing \(M\) tokens, \(m\) of which are red. I remove \(n\) tokens from the bag at random without replacement. Let \[ X_{i}=\begin{cases} 1 & \mbox{ if the ith token I remove is red;}\\ 0 & \mbox{ otherwise.} \end{cases} \] Let \(X\) be the total number of red tokens I remove.
Solution:
Each of my \(n\) students has to hand in an essay to me. Let \(T_{i}\) be the time at which the \(i\)th essay is handed in and suppose that \(T_{1},T_{2},\ldots,T_{n}\) are independent, each with probability density function \(\lambda\mathrm{e}^{-\lambda t}\) (\(t\geqslant0\)). Let \(T\) be the time I receive the first essay to be handed in and let \(U\) be the time I receive the last one.
Solution: