Alicia is writing the program for a video game. For one part of the game she uses the rule (x,y)->(x-3,y+4) to move points on
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
First, transform the fraction inside the square root into the following:
.
Next, you can take the square root of 36 (), which is 6 (
).
Then, you can take the square root of 169 ( ), which is 13 (
)
Answer:
Step-by-step explanation:
<h2>First question</h2>The only possibilities where there is exactly 1 tail are:
- (t,h,h,h,h)
- (h,t,h,h,h)
- (h,h,t,h,h)
- (h,h,h,t,h)
- (h,h,h,h,t)
those are 5 favorable outcomes.
where <em>h represent heads</em> and <em>t represent tails. </em>There are total number of outcomes after tossing the coin 5 times. Because every time you toss the coin, you have 2 possibilities, and as you do it 5 times, those are
options. We can conclude from this that
The probability that exactly 1 is a tail is .
We already know the total number of outcomes; 32. Now we need to find the number of favorable outcomes. In order to do that, we can divide our search in three cases: <em>1.-there are no tails, 2.-exactly 1 is a tail, 3.- exactly 2 are tails.</em>
The first case is 1 when every coin is a head. The second case we already solved it, and there are 5. The third case is the interesting one, we can count the outcomes as we did in the previous questions, but that's only because there are not too many outcomes. Instead we are going to use combinations:
We need to have <u>2</u> tails, the other coins are going to be heads. We made <u>5</u> tosses, then the possible combinations are
Finally, we conclude that there are 1 + 5 + 10 favorable outcomes, and this implies that
The probability that at most 2 are tails is .