Suppose that a computer software company has 30
programmers. use factorials to write the number of different ways
they couldselect a group of 6 of the programmers to work on a
particularproject.

Step-by-step explanation:

Given : The total number of programmers in the company = 30

The company wants to select a group of 6 programmers to work on a  particular project.

Since the order of selecting them does not matters , therefore we use combinations.

The number of combinations of r things taken from n things is given by :-

here, n= 30 and r= 6

So the number of different ways to form they could select a group of 6 would be

i.e. Total ways =593775

In terms of factorials , the number of total ways to form they could select a group of 6 is .

infinitely many solutions

step-by-step explanation:

we have been given the equation;

2(2x + 3) = -4 + 2(2x + 5)

we need to determine the value of x.

2(2x + 3), we expand this expression to obtain 4x + 6

similarly 2(2x + 5) will become 4x + 10

now we have;

4x + 6 = -4 + 4x + 10

4x + 6 = 4x + 10 - 4

4x + 6 = 4x + 6

the expression on the left hand side is identical to the one on the right hand side. therefore, we are looking at just a single straight line whose equation is;

y = 4x + 6

consequently, we shall have infinitely many solutions

the answer is d. (1.2, -4.7) on edgn

hope this !