Re: HSC 2016 MX2 Combinatorics Marathon
\\ $For coins$ \ c_1, c_2, \dots , c_n \ $we have probability$ \ c_i \ $returning heads is$ \ p_i \ $for all$ \ i = 1,2, \dots , n
\\ $Let the probability that the first$ \ m \ $coins return$ \ k \ $coins be$ \ s(m,k)
\\ $Find a recurrence...