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:

In this question:
4 guests from a set of 15. So

The first 4 guests can arrive in 32,760 ways.
Answer:
uh.
Step-by-step explanation:
Answer:
D
Step-by-step explanation:
just took that test
Answer:
B) 0
Step-by-step explanation:
If the eponent is 0 then the number is equal to 1 so 4^0 = 1
Plug 0 into the polynomial function: 4(0)^2 = 0^2 = 0
1 > 0