Here we shall use the binomial distribution formula to evaluate the probability:
let the probability that the temp will be above 80 be P(F)=2/3;
Probability that the temp will be below 80 be P(F')=1/3
thus,
The probability that the temp will be above 80 for 20 days for the month of June will be:
P(F)=n!/((n-x)!x!)p^xq^(n-x)
p=2/3 and q=1/3, n=30, x=20
plugging the values in the equation we obtain:
P(F)=30!/(10!*20!)*(2/3)^20*(1/3)^(30-20)
P(F)=0.153
It is -8y+12
You have to multiply 4 by -2 which equals -8
Then you do 4x3 which equals 12
Answer:
The members of the cabinet can be appointed in 121,080,960 different ways.
Step-by-step explanation:
The rank is important(matters), which means that the order in which the candidates are chosen is important. That is, if we exchange the position of two candidates, it is a new outcome. So we use the permutations formula to solve this quesiton.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:

If there are 14 eligible candidates for these positions (where rank matters), how many different ways can the members of the cabinet be appointed?
Permutations of 8 from a set of 14. So

The members of the cabinet can be appointed in 121,080,960 different ways.
Answer: 11am
Step-by-step explanation:
To solve this, we have to calculate the lowest common multiple of 20 and 30. This will be:
20 = 20, 40, 60, 80, 100
30 = 30, 60, 90, 120, 150.
Here, the lowest common multiple is 60.
Therefore, we add 60 minutes to 10am. This will be:
= 10am + 1 hour
= 11 am
The next time that both buses leave at the same time would be 11am