  We use a coin flipping model for the random partition and Chebyshev's
inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for
the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.
