The probability that you can get N heads in a row would be:
Let <span>p</span> be the probability of flipping a heads. Let <span>x</span> be number of flips needed to achieve <span>h </span>consecutive heads. The solution is <span><span>E(x) = (<span><span>1−<span>p^h) / (</span></span><span><span>p^h</span>(1−p))</span></span></span></span>
This expression may be derived as follows. The probability of being successful immediately is <span><span>p^r.</span></span> However, one might get a tails immediately. In that case, the number of flips needed is <span><span>1+E(x) </span></span>(one flip has been used and we are back to the original position). We might get a heads and then a tails. In this case two flips have been used and we are back to the original position. Continue this up to <span><span>h−1</span></span> heads followed by a tails in which case <span>h</span> flips have been used and we are back to the original position.
Answer:
Please check the explanation.
Step-by-step explanation:
Given the equations
solving the system of the equations
Arrange the equation variables for elimination
solve
Divide both sides by -3
Therefore, the solutions to the system of the equations are:
But, it seems none of the options is true.
Y = 2x + 1
y = 2(-1) + 1
y= -2 + 1
y= -1
Answer:
Reduce 87/297 to lowest terms
The simplest form of 87297 is 2999.
The domain of this equation is the lowest x value to the highest x value. For example: lowest is -4 and highest is 3. You would write it as [-4,3]
For this equation, the domain is (-infinity,infinity) because there is no lowest or highest x value.
