Answer:
D. Begin at 36 and move four units to the left three times
Step-by-step explanation:
The given expression is 36 - 3(4)
It means "it starts with 36 less 3 times 4."
Here "less" means we have to move to the left
Therefore, the answer is "D. Begin at 36 and move four units to the left three times"
Thank you.
Answer:
The probability that she will not get a hit until her fourth time at bat in a game is 0.103
Step-by-step explanation:
Previous concepts
The geometric distribution represents "the number of failures before you get a success in a series of Bernoulli trials. This discrete probability distribution is represented by the probability density function:"
Let X the random variable that measures the number os trials until the first success, we know that X follows this distribution:
Solution to the problem
For this case we want this probability

And using the probability mass function we got:
The probability that she will not get a hit until her fourth time at bat in a game is 0.103
Answer:
B = 129
Step-by-step explanation:
Opposite angles of a parallelogram are equal (or congruent)
A and C are both 51.
All angles in a parallelogram equal 360
Take both the known angles and substract from 360, than divide by 2.
B = (360 - 51 - 51)/2
B = 129
This is the easiest way to solve this problem:
Imagine this represents how many combinations you can have for each of the 4 wheels (each blank spot for one wheel): __ __ __ __
For the first situation it says how many combos can we make if no digits are repeated.
We have 10 digits to use for the first wheel so put a 10 in the first slot
10 __ __ __
Since no digit can be repeated we only have 9 options for the second slot
10 9_ __ __
Same for the third slot, so only 8 options
<u>10</u> <u> 9 </u> <u> 8 </u> __
4th can't be repeated so only 7 options left
<u>10</u> <u> 9 </u> <u> 8 </u> <u> 7
</u><u>
</u>Multiply the four numbers together: 10*9*8*7 = 5040 combinations
For the next two do the same process as the one above.
If digits can be repeated? You have ten options for every wheel so it would look like this: <u>10</u> <u>10</u> <u>10</u> <u>10
</u>
10*10*10*10 = 10,000 combinations
If successive digits bust be different?
We have 10 for the first wheel, but second wheel only has 9 options because 2nd number can't be same as first. The third and fourth wheels also has 9 options for the same reason.
<u>10</u> <u> 9</u><u> </u> <u> 9 </u> <u> 9 </u>
10*9*9*9 = 7290 combinations
Answer:
Step-by-step explanation:
The problem relates to filling 8 vacant positions by either 0 or 1
each position can be filled by 2 ways so no of permutation
= 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2
= 256
b )
Probability of opening of lock in first arbitrary attempt
= 1 / 256
c ) If first fails , there are remaining 255 permutations , so
probability of opening the lock in second arbitrary attempt
= 1 / 255 .