20 applicants are interviewed for a job. The interviewer creates an ordered list (first to last) of the best 6 applicants. How many ways are

Step-by-step explanation:

The question is incomplete. Here is the complete question.

20 applicants are interviewed for a job. The interviewer creates an ordered list (first to last) of the best 6 applicants. How many ways are there for the interviewer to create the list?

Since the question deals with selection, we will apply the combination rule. Generally, if r objects are to be selected from n pool of objects, this can be done in nCr number of ways.

nCr = n!/(n-r)!r!

According to the question, if the the interviewer is to select 6 applicants from a pool of 20 applicants that are interviewed for a job, this can be done in 20C6 number of ways.

20C6 = 20!/(20-6)!6!

20C6 = 20!/14!6!

20C6 = 20*19*18*17*16*15*14!/14!*6*5*4*3*2

20C6 =  20*19*18*1716*15/6*5*4*3*2

20C6 = 27,907,200/720

20C6 = 38,760 different ways.

Hence, the interviewer can create the list in 38,760 different ways.

step-by-step explanation:

hans did not square the 40-unit side; he merely multiplied it by 2.   incorrect.

y -5 = (-1/4)(x + 8)

step-by-step explanation: