Respuesta :
Answer:
The first 4 guests can arrive in 32,760 ways.
Step-by-step explanation:
The order in which the guests arrive is important. For example, A,B,C,D is a different outcome to B,A,C,D. So we use the permutations formula to solve this question.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
[tex]P_{(n,x)} = \frac{n!}{(n-x)!}[/tex]
In this question:
4 guests from a set of 15. So
[tex]P_{(15,4)} = \frac{15!}{(15-4)!} = 32760[/tex]
The first 4 guests can arrive in 32,760 ways.
Answer:
the first 4 guests can arrive in 32,760 ways.
Step-by-step explanation:
how many ways can the first 4 guests arrive at a party if 15 guests have been invited.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
[tex]P_{(n,x)} = \frac{n!}{(n-x)!}[/tex]
4 guests from a set of 15
P(15,4) = 15 * 14 * 13 * 12
= 32760
Therefore, the first 4 guests can arrive in 32,760 ways.