All categories

4 years ago

Need help with questions number4. Please.

Mathematics

1 answer:

Ulleksa [173]4 years ago

6 0

The answer is 3,900 sq ft

You might be interested in

Please help! view the picture :) due soon

arlik [135]

The answer is 30~~~~~~~~

3 0

3 years ago

Keiko has seven colors of lanyard. She uses three different colors to make a keychain. How many different combinations can she c

AleksAgata [21]

Combination = doesn't matter what order
Permutation = order matters

There are two methods to work out combinations.

Method 1 List out possibilities
123 124 125 126 127 134 135 136 137 145 146 147 156 157 167
234 235 236 237 245 246 247 256 257 267
345 346 347 356 357 367
456 457 467
567

For a total of 35 combinations.

Method 2 Use a formula.
It's a rather complicated one, so only use it if you have a lot of possibilities.

$\frac{n!}{r!(n-r)!} = \frac{7!}{3!(7-3)!} = \frac{7!}{3!*4!} = \frac{7*6*5*4*3*2*1}{3*2*1*4*3*2*1} = \frac{7*6*5}{3*2*1}=\frac{210}6=35$

(n is the number of choices, r is the amount you choose, and ! is a function that multiplies together all numbers down to 1)

7 0

4 years ago

Sarah dreams of going to medical school and giving quality medical care to people who live in countries in crisis. Which of the

miss Akunina [59]

I would say World Health Organization because that is for the world and Sally dreams of going to medical school and giving quality medical care to people who live in countries in crisis.

4 0

3 years ago

Find f(-5) if f(x)=lx+1l A.6 b.5 c.4

3241004551 [841]

Answer:

its C

Step-by-step explanation:

f(x) = |(-5)+1|

f(x)=|4|

absolute value of 4 is 4

4 0

3 years ago

Read 2 more answers

There are 11 candidates for three postions at a restaraunt. One postion is for a cook. The second position is for a food server

LenaWriter [7]

Answer:

165 combinations possible

Step-by-step explanation:

This is a combination problem as opposed to a permutation, because the order in which we fill these positions is not important. We are merely looking for how many ways each of these 11 people can be rearranged and matched up with different candidates, each in a different position each time. The formula can be filled in as follows:

₁₁C₃ = $\frac{11!}{3!(11-3)!}$

which simplifies to

₁₁C₃ = $\frac{11*10*9*8!}{3*2*1(8!)}$

The factorial of 8 will cancel out in the numerator and the denominator, leaving you with

₁₁C₃ = $\frac{990}{6}$

which is 165

6 0

3 years ago