Consider a bag of marbles in which each marble is a different color. If we draw marbles one at a time from the bag without replacement, how many different ordered sequences (permutations) of the marbles are possible? How many different unordered sets (combinations)?

Permutations
Combinations

Choose how many marbles the bag should contain:

Select a column on the table to visualise all possible permutations or combinations of the marbles.

$r$	0	1	2	3	4
\(\displaystyle{^{n}P_{r}}\) \(\displaystyle{^{n}C_{r}}\)	1