Re: Harder HSC Papers
Another way of thinking about it:
Each possible string "HTTHHTTHT..." can be given two running counts of the heads and tails in the first n letters.
Eg for the above example these counts are:
0,1,1,1,2,3,...
0,0,1,2,2,2,...
P(m,n) is the probability that the first...