Answer:
Standard deviation of given data = 3.16227
Step-by-step explanation:
<u><em>Step(i)</em></u>:-
Given sample size 'n' = 5
Given data 4, 6,8,10,12
![Mean = \frac{4+6+8+10+12}{5} = 8](https://tex.z-dn.net/?f=Mean%20%3D%20%5Cfrac%7B4%2B6%2B8%2B10%2B12%7D%7B5%7D%20%3D%208)
Mean of the sample x⁻ = 8
Standard deviation of the sample
![S.D = \sqrt{\frac{Sum(x-x^{-} )^{2} }{n-1}}](https://tex.z-dn.net/?f=S.D%20%3D%20%5Csqrt%7B%5Cfrac%7BSum%28x-x%5E%7B-%7D%20%29%5E%7B2%7D%20%7D%7Bn-1%7D%7D)
<u><em>Step(ii)</em></u>:-
Given data
x : 4 6 8 10 12
x-x⁻ : 4 - 8 6-8 8-8 10-8 12-8
(x-x⁻) : -4 -2 0 2 4
(x-x⁻)² : 16 4 0 4 16
![S.D = \sqrt{\frac{16+4+0+4+16}{4}}](https://tex.z-dn.net/?f=S.D%20%3D%20%5Csqrt%7B%5Cfrac%7B16%2B4%2B0%2B4%2B16%7D%7B4%7D%7D)
S.D = √10 = 3.16227
<u><em> Final answer</em></u>:-
The standard deviation = 3.16227
Answer:
The manager can select a team in 61425 ways.
Step-by-step explanation:
The order in which the cashiers and the kitchen crews are selected is not important. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
![C_{n,x} = \frac{n!}{x!(n-x)!}](https://tex.z-dn.net/?f=C_%7Bn%2Cx%7D%20%3D%20%5Cfrac%7Bn%21%7D%7Bx%21%28n-x%29%21%7D)
In how many ways can the manager select a team?
2 cashiers from a set of 10.
4 kitchen crews from a set of 15. So
![T = C_{10,2}*C_{15,4} = \frac{10!}{2!(10-2)!}*\frac{15!}{4!(15-4)!} = 45*1365 = 61425](https://tex.z-dn.net/?f=T%20%3D%20C_%7B10%2C2%7D%2AC_%7B15%2C4%7D%20%3D%20%5Cfrac%7B10%21%7D%7B2%21%2810-2%29%21%7D%2A%5Cfrac%7B15%21%7D%7B4%21%2815-4%29%21%7D%20%3D%2045%2A1365%20%3D%2061425)
The manager can select a team in 61425 ways.
Answer:
False i just did it
Step-by-step explanation:
For 27) D
For 28) A
Hope that helps!
Answer: Equilateral triangles are also right triangles sometimes. All angles of an equilateral are congruet sometimes.