Essentially, the outcome after carrying out the n tosses is a total of r heads (which implies n-r tails). Your task is to determine how many arrangements of the r heads and n-r tails are possible if the first "slot" is taken up by a head, and there is basically no restriction on the remaining r-1 heads and n-r tails. Does that make the question easier for you to answer?

## Bookmarks