I am trying to figure out the problem below.
The number of ways a coin can be tossed 6 times so that there is exactly 3 heads and no two heads occur in a row is?
At first it seemed like it would just be .5•.5•.5•.5•.5•.5 which would be 0.015625, since none of the outcomes are dependent on each other. Then as I was reading the question more carefully, I thought maybe the answer is 2? Since there are only 2 outcomes for each toss?
All help greatly appreciated.