The number of unique combinations that can be formed by picking one object from each of k different sets of objects is equal to no(na) (m) (n)".
where the size of the first set is ny, the size of the second set is n2, and so
forth.

Arestaurant offers a $12 dinner special that has 5 choices for an appetizer, 12 choices for an entrée, and 4 choices for a dessert. how many different meals are available when you select an appetizer, an entrée, and a dessert? a meal can be chosen in nothing ways. (type a whole number.)

Solve for n? [tex]z = \frac{3}{4} mn[/tex]

Write the expression as a single natural logarithm. 2 in a - 4 in y