ita; exercise C.1.11 - bin(n,j+k) ≤ bin(n,j)bin(n-j,k)
ita; exercise C.1.12 - (unsolved) upper bound for bin
ita; exercise C.1.13 - bin(2n,n) w/ Stirling
ita; exercise C.1.14 - max(H(λ))
ita; exercise C.1.15 - Σbin(n,k)k
ita; got a solution for C.1.12
ita; exercise C.2.1 - Shakespearean characters flipping coins
ita; exercise C.2.2 - Boole\'s inequality
ita; exercise C.2.3 - three cards from a deck in order
ita; exercise C.2.4 - A or not-A given B
ita; exercise C.2.5 - probability of n events happening
ita; exercise C.2.6 - random fraction with a coin
ita; exercise C.2.7 - pairwise, but not mutually independent
ita; exercise C.2.8 - conditionally independent, but not independent
ita; exercise C.2.9 - the Monty Hall problem
ita; exercise c.2.10 - Three Prisoners' Problem