I toss a fair coin 100 times in a row. If the expected number of times that two Heads are tossed consecutively is equal to N , what is the value of 1 0 0 N ?
Clarification : A run of three or more Heads in a row will contribute more than one instance of consecutive Heads. If three Heads are tossed in a row, then two Heads have been tossed consecutively twice. If six Heads are tossed in a row, then two Heads have been tossed consecutively five times, and so on. For example, two Heads have been tossed consecutively 11 times in the following sequence of 30 tosses:
T H H T H H H H T H H H T H T H H H H H T T T T H H T H T T
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I used a shorter version of your 2nd method, the last of nth toss can be either H or T and the n+1th toss can be H or T, the number of head pairs increases by 1 1/4 th of the time and remains the same rest of the time
So (Nn+1)=1/4((Nn)+1)+3/4(Nn) or (N n+1)=(N n)+1/4
In 1 0 0 tosses, we have 9 9 "double tosses". In each one of these 9 9 "double tosses", two heads will come up with probability 1 / 4 . Then the expected value of two heads in a row is 9 9 ∗ ( 1 / 4 ) = 2 4 . 7 5
That's basically it. Because we can add expectations it does not matter that the outcomes of the various "double tosses" are not independent of each other.
The total different result we can have in 1 0 0 toss is 2 1 0 0 .
If we write the result of 1 0 0 toss in a row, we can see that there are 9 9 positions for two heads.
Example:
First position : HH####...
Second position : #HH###...
Third position : ##HH##...
........
Each position has 2 9 8 different path.
The the total number of two heads in all result is 2 9 8 ∗ 9 9
The expected number ( N ) is 2 9 8 ∗ 9 9 / 2 1 0 0 = 2 4 . 7 5
1 0 0 N = 2 4 . 7 5 ∗ 1 0 0 = 2 4 7 5
This is not quite right. You say that the "total number of two heads" is 2 9 8 × 9 9 . This is not correct, or really meaningful. It is possible to get no double heads at all, by alternately tossing Heads and Tails. You have to introduce expectation at an earlier stage of your argument.
The probability of getting HH in any one of the 9 9 possible places is 2 9 8 / 2 1 0 0 = 1 / 4 . As in the other two solutions, you can multiply 1 / 4 by 9 9 to get the correct expectation.
Log in to reply
Sorry Sir, what I mean in "total number of two heads" is the number of "two heads" in all possible outcome of 1 0 0 tosses, it is not 9 9 "double heads" appears in each position. So in #, we can fill it with either H or T .
Log in to reply
How are you sure you are not double-counting? The sequence #HHH##### contributes (at least) two HHs. Your argument can be made to work, but it still needs to be tidied up to be clear, and the tidying-up approach is likely to bring you back to the indicator random variables I discussed...
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Expected Value - Problem Solving
Suppose that I toss a coin n times in a row. For any 1 ≤ j ≤ n − 1 , let X j be the random variable which is equal to 1 if Heads is tossed by the j t h and ( j + 1 ) s t coins, and 0 otherwise, so that the total number of occurrences of consecutive Heads is X = X 1 + X 2 + ⋯ + X n − 1 . It is clear that E [ X j ] = P [ X j = 1 ] = 4 1 for each 1 ≤ j ≤ n − 1 , and hence that N = E [ X ] = E [ X 1 ] + E [ X 2 ] + ⋯ + E [ X n − 1 ] = 4 1 ( n − 1 ) .
For n = 1 0 0 , the value of 1 0 0 N is 2 5 × 9 9 = 2 4 7 5 .
For those who are not comfortable with using random variables like this, here is another approach. Let H n be the expected number of consecutive Heads obtained in n tosses, given that the first toss is Heads, and let T n be the expected number of consecutive Heads obtained in n tosses, given that the first toss is Tails. If N n is the number of consecutive Heads obtained in n tosses, then (conditioning on the outcome of the first toss) we have N n = 2 1 ( H n + T n ) .
Conditioning on the outcome of the second toss tells us that H n = 2 1 ( 1 + H n − 1 ) + 2 1 T n − 1 = 2 1 + N n − 1 T n = 2 1 H n − 1 + 2 1 T n − 1 = N n − 1 Averaging these equations gives N n = 4 1 + N n − 1 . Since N 1 = 0 we obtain N n = 4 1 ( n − 1 ) .