Answer:
The width is 102
Step-by-step explanation:
Hope this helps! :)
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:
10
Step-by-step explanation:
I first took away 60 from 195, as she already had 60 points. Than we were left with 135 points and since she gets 13.5 points every time she visits, I divided 135 by 13, which gives us 10.
x+(x+8)+(x+100)=750
3x+108=750
3x=642
x=214
So your numbers are 214, 222 and 314