Let h be the number of heads and t the number of tails obtained before the total reaches 30 points.
Each head gives 10 points and each tail gives 5 points, so
10h+5t=30⟹2h+t=6
The non-negative integer solutions of 2h+t=6 are found by assigning values to h:
h0123t=6−2h6420
Thus four ordered pairs (h,t) are possible: (0,6),(1,4),(2,2),(3,0).
For each pair, the tosses are arranged in (h+t) positions.
Number of favourable sequences =(hh+t), and since the coin is fair, the probability of any specific sequence of h+t tosses is (21)h+t.
Therefore the probability contribution of a pair (h,t) is (hh+t)(21)h+t.
Compute each term:
(h,t)=(0,6):(h,t)=(1,4):(h,t)=(2,2):(h,t)=(3,0):(06)(21)6=641(15)(21)5=325(24)(21)4=166=83(33)(21)3=81
Add the four contributions:
641+325+83+81=641+6410+6424+648=6443
The required probability is 6443, already in lowest terms, so m=43,n=64.
Hence m+n=43+64=107.
Option C which is: 107