All the worked exercises of the chapter, in order of appearance in the book: hypergeometric distribution, discrete and continuous distributions with the cumulative distribution function, Shannon entropy, modular arithmetic and RSA cryptography.
- Poker, two aces in five cards
- Urn of 10 balls, full distribution
- Quality control, hypergeometric vs binomial
- Urn of 12 balls, mean and variance
- Lottery, the quintet
- Three sixes in ten dice rolls
- Lifetime of a component
- Gaussian exam mark
- Mean and variance of a binomial
- Calls to a switchboard
- Mean of the exponential distribution
- Entropy of a binomial
- Study of the function -p log p
- Entropy and Huffman coding
- Coin versus die
- Modular exponentiation with Fermat
- Computing phi(36)
- Modular inverse with extended Euclid
- RSA with p=5 and q=7
- Why Fermat’s little theorem