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?Hi,
A fair coin is tossed n times. What is the probability of heads on the
first toss given that r heads were obtained in the n tosses?
Does anyone know how to do this - solution is r/n
If we consider a situation where for every n tosses, we get exactly r heads, then we can calculateWould it be valid to say that since there were heads in tosses, each toss has on average an chance to be heads?
I'd be very careful about this. Using the term "average" usually implies that you're calculating something via sampling, which is not what you're doing here, since you're after a theoretical answer.Would it be valid to say that since there were heads in tosses, each toss has on average an chance to be heads?