Question

Jude Enjoys Eating Potato Chips. He likes to place 3 chips together in a stack to make interesting flavours. If he only has one flavour of chip, for example, original, then he will only have one way to stack the chips: original, original, original, which can be written as O,O,O
The order in which the chips are stacked does not matter. For example, Jude has two different flavours: original and pizza. Stacking them as original, orginal, pizza (O,O, P) would be the same as stacking them as original, pizza, orignal (O,P,O.). In both stacks, he had two original-flavor chips and one pizza-flavor chip.

If Jude has four flavours, Original (O), pizza (P), and chicken (C) and BQQ (B), how many different stacks can he make

Answer 1

Using the combination formula, it is found that he can make 4 different stacks.

The order in which the balls are selected is not important, as stated in the problem. hence the combination formula is used to solve this question. If the order was important, then the permutation formula would be used.

What is the combination formula?

$C_{n,x}$ is the number of different combinations of x objects from a set of n elements, given by:

$C_{n,x} = \frac{n!}{x!(n-x)!}$

In this problem, he has four flavors, and will choose three of them for the stacks, hence the number of different stacks is given as follows:

$C_{4,3} = \frac{4!}{3!1!} = 4$

He can make 4 different stacks.

More can be learned about the combination formula at brainly.com/question/25821700

#SPJ1