Each toss of a fair coin is heads or tails with chance 21, independent of the others. With n tosses there are 2n 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. OutcomesWrite each result as a sequence of H and T; n tosses give 2n sequences.
2. Exactly k headsChoose the positions of the heads: (kn) sequences.
3. At least oneUse the complement: 1−P(no heads)=1−(21)n.
4. A patternA fixed sequence such as HTH has chance (21)n; multiply the tosses because they are independent.
5. Biased coinIf P(H)=p=21, sequences are no longer equally likely; weight each one by pk(1−p)n−k.
Interpret the result. Give a fraction over 2n or a decimal rounded to 4 places. Check the symmetry for a fair coin: k heads and k tails have the same probability.
Worked examples
Example 1 · exactly two heads in three tosses
count sequences
HHT,HTH,THH: (23)=3 of 8
choose where the heads go
P=83
Example 2 · at least one head in five tosses
complement
no heads: only TTTTT, 321
P=1−321=3231
Example 3 · a biased coin
binomial
P(H)=0.6, four tosses, exactly three heads
(34)(0.6)3(0.4)=4⋅0.216⋅0.4
four positions for the tail
P=0.3456
See it happen
Each extra toss doubles the number of sequences, so a tree of n tosses has 2n tips. The number of tips with exactly k heads is (kn), which is why the middle counts are largest. Toss many times in the coin toss visualizer.