Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Solve Coin Toss Probability Problems

Each toss of a fair coin is heads or tails with chance 12\frac{1}{2}, independent of the others. With nn tosses there are 2n2^n equally likely sequences, and counting them answers most questions.

Recognize the problem

Trigger words: coin, toss, flip, heads, tails, exactly, at least one, in a row, biased coin. A fixed number of tosses and a question about how many heads or which pattern.

Set it up

  1. 1. OutcomesWrite each result as a sequence of H and T; nn tosses give 2n2^n sequences.
  2. 2. Exactly k headsChoose the positions of the heads: (nk)\binom{n}{k} sequences.
  3. 3. At least oneUse the complement: 1−P(no heads)=1−(12)n1 - P(\text{no heads}) = 1 - \left(\frac{1}{2}\right)^n.
  4. 4. A patternA fixed sequence such as HTH has chance (12)n\left(\frac{1}{2}\right)^n; multiply the tosses because they are independent.
  5. 5. Biased coinIf P(H)=p≠12P(H) = p \neq \frac{1}{2}, sequences are no longer equally likely; weight each one by pk(1−p)n−kp^k(1-p)^{n-k}.
→Now solve it: How to find a probability by counting outcomesFor a fair coin, divide the favorable sequences by 2n2^n by counting outcomes. For a biased coin, use the binomial probability method.
Interpret the result. Give a fraction over 2n2^n or a decimal rounded to 44 places. Check the symmetry for a fair coin: kk heads and kk tails have the same probability.

Worked examples

Example 1 · exactly two heads in three tosses

count sequences
HHT,HTH,THHHHT, HTH, THH: (32)=3\binom{3}{2} = 3 of 88
choose where the heads go
P=38P = \frac{3}{8}

Example 2 · at least one head in five tosses

complement
no heads: only TTTTTTTTTT, 132\frac{1}{32}
P=1−132=3132P = 1 - \frac{1}{32} = \frac{31}{32}

Example 3 · a biased coin

binomial
P(H)=0.6P(H) = 0.6, four tosses, exactly three heads
(43)(0.6)3(0.4)=4⋅0.216⋅0.4\binom{4}{3}(0.6)^3(0.4) = 4 \cdot 0.216 \cdot 0.4
four positions for the tail
P=0.3456P = 0.3456

See it happen

Each extra toss doubles the number of sequences, so a tree of nn tosses has 2n2^n tips. The number of tips with exactly kk heads is (nk)\binom{n}{k}, which is why the middle counts are largest. Toss many times in the coin toss visualizer.

Common mistakes

Counting head totals as outcomes

✗ three tosses: 0,1,2,30, 1, 2, 3 heads, each 14\frac{1}{4}
✓ two heads covers 33 of 88 sequences: 38\frac{3}{8}

The gambler's fallacy

✗ after HHHHHHHH, tails is more likely
✓ tosses are independent: still 12\frac{1}{2}

Equal weights for a biased coin

✗ P(H)=0.6P(H) = 0.6: three heads in four tosses =416= \frac{4}{16}
✓ weight each sequence: 4⋅0.63⋅0.4=0.34564 \cdot 0.6^3 \cdot 0.4 = 0.3456