The distinction is that permutations count ordered arrangements, whereas combinations count unordered selections; for distinct objects chosen at a time without repetition, these are represented by and , respectively. The learner understands that treating equivalent groups as different overcounts combinations, and applies the distinction to finite counting and elementary probability situations, without extending to advanced generalized or repeated-selection cases.
When counting, first ask:
Does the order of the objects matter?
Here, is the total number of distinct objects, and is the number chosen.
There are students: Alice, Ben, Carlos, Dana, Emma, and Farah.
The committee is the same group as . Therefore, order does not matter, so use a combination:
There are possible committees.
The factor in the denominator removes the overcounting caused by arranging the same three students in different orders.
Now the roles are different. For example, Alice as president and Ben as vice president is different from Ben as president and Alice as vice president. Therefore, order matters, so use a permutation:
There are possible assignments.
A useful check is that each group of students can be assigned to the three roles in ways:
So, use a combination for an unordered group and a permutation when the positions or roles make the order important.
Click a topic below to practice the foundational skills you'll need, learn the steps, or master this skill
Earned ?