Final answer:
There are 38,760 ways in which the interviewer can create an ordered list of the best 6 applicants from the 20 interviewed.
Step-by-step explanation:
To create an ordered list of the best 6 applicants from the 20 interviewed, we can use the concept of permutations. The interviewer needs to select 6 applicants from the pool of 20, and the order in which they are selected matters. The formula to calculate the number of permutations is nPr = n! / (n-r)!, where n is the total number of items and r is the number of items to be selected. In this case, n = 20 and r = 6.
Substituting these values into the formula, we get 20P6 = 20! / (20-6)! = 20! / 14! = 20 x 19 x 18 x 17 x 16 x 15 = 38,760. Therefore, there are 38,760 ways in which the interviewer can create an ordered list of the best 6 applicants from the 20 interviewed.