Answer:
There are 10,701,600 different ways for Derek to plan the menu.
Step-by-step explanation:
We use the combinations formula, because the order that the appetizers, entrees and side dishes are going to be selected does not matter. For example, appetizers A then appetizer B is the same outcomes as appetizer B then appetizer A.
Combinations formula:
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
Derek will choose
5 appetizers from a set of 16.
4 entrees from a set of 8.
4 side dishes from a set of 7.
How many different ways are there for Derek to plan the menu?
We multiply the number of possible outcomes for appetizers, entrees and side dishes.
[tex]T = C_{16,5}*C_{8,4}*C_{7,4} = \frac{16!}{11!5!}*\frac{8!}{4!4!}*\frac{7!}{3!4!} = 4368*70*35 = 10701600[/tex]
There are 10,701,600 different ways for Derek to plan the menu.