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:
Step-by-step explanation:
circumference
The middle section is n(n+1)
The top row is n+2
The bottom row is 2n+1
So the rule for the total number of tiles will be the sum of the above rules...
s(n)=n(n+1)+n+2+2n+1
s(n)=n^2+n+n+2+2n+1
s(n)=n^2+4n+3
Answer:
156 in squared
Step-by-step explanation:
So the formulas will be stated below
Parallelogram Area= 1/2h(b1+b2)
Square Area= Bh
So first do
(4)(12+6)
(4)(18)
No need to half it bc there's the same shape at the bottom
72+18+30+36
6(3)
3x5(2)
12(3)
Answer:
cosA = √(21/25)
Step-by-step explanation:
We know
sin²(A) + cos²(A) = 1
Next, we know that sin(A) = 2/5. Plugging that into our equation, we get
(2/5)² + cos²A = 1
4/25 + cos²A = 1
subtract 4/25 from both sides to isolate cos²A
cos²A = 1 - 4/25 = 25/25-4/25 = 21/25
square root both sides to get
cosA = √(21/25)
We do not include -√(21/25) in our possible answer for cosA because this is in quadrant 1, so cosA must be positive.
