All categories

2 years ago

I WILL MARK YOU THE BRAINLYEST IF YOU HELP ME PLEASE!!!!!

Mathematics

2 answers:

Ganezh [65]2 years ago

7 0

Answer:

it's B

50(-x+2)

LuckyWell [14K]2 years ago

6 0

Answer:

hoesty ill pick c or a ut you risk it for the biscuit

Step-by-step explanation:

Hope this helps leave a heart pls ad if you have questios im here c:

You might be interested in

Jason wants to buy a game that cost $20. He earns $2 every time he washes the

Reika [66]

Answer:

Step-by-step explanation:

10 x 2 = 20

10 - 3 = 6

7 0

2 years ago

Rewrite the equation below so that it does not have fractions.

rjkz [21]

.75x+4=.75

hope this helps!

4 0

3 years ago

Read 2 more answers

I need help with this geometry

Whitepunk [10]

I’m not sure but you can use a calculator I saw a fantasy one at Walmart with A SCREEN ON IT!??? it’s $100 but it would probably help ALOT

7 0

3 years ago

Linear relationships? Would it be B?

mart [117]

It would be C
hope it helped

3 0

2 years ago

A corporation must appoint a president, chief executive officer (CEO), chief operating officer (COO), and chief financial off

Yakvenalex [24]

Answer:

a) The officers can be appointed in 24024 different ways.

b) The committee can be appointed in 1001 different ways.

c) 1.1% probability of randomly selecting the committee members and getting the three youngest of the qualified candidates

Step-by-step explanation:

The order in which the officers are appointed is important(the first is the president, second the CEO and so on...). So the permutations formula will be used.

Otherwise, in the committee there are no roles, so the order is not important. So the combinations formula will be used.

Permutations formula:

The number of possible permutations of x elements from a set of n elements is given by the following formula:

$P_{(n,x)} = \frac{n!}{(n-x)!}$

Combinations formula:

$C_{n,x}$ 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)!}$

A. How many different ways can the officers be appointed?

4 from a set of 14, with roles. So a permutation.

$P_{(14,4)} = \frac{14!}{(14-4)!} = 24024$

The officers can be appointed in 24024 different ways.

B. How many different ways can the committee be appointed?

4 from a set of 14, without roles. So combination

$C_{14,4} = \frac{14!}{4!(14-4)!} = 1001$

The committee can be appointed in 1001 different ways.

C. What is the probability of randomly selecting the committee members and getting the three youngest of the qualified candidates?

A probability is the number of desired outcomes divided by the number of total outcomes.

Desired outcomes.

The three youngest(1 combination), and one of the other 14-3 = 11. So $D = 1*11 = 11$

Total outcomes:

From B., 1001, so $T = 1001$

Probability:

$p = \frac{D}{T} = \frac{11}{1001} = 0.011$

1.1% probability of randomly selecting the committee members and getting the three youngest of the qualified candidates

8 0

3 years ago