Hoeffding's inequality can be applied to the important special case of identically distributed Bernoulli random variables, and this is how the inequality is often used in combinatorics and computer science. We consider a coin that shows heads with probability and tails with probability . We toss the coin times. The expected number of times the coin comes up heads is . Furthermore, the probability that the coin comes up heads at most times can be exactly quantified by the following expression: