IYMC Logo

Permutations vs Combinations and Why We Divide

By Julia Berens · · 4 min read

Glowing cyan and deep blue rings spiral inward against a nearly black background, creating an abstract tunnel effect.

The difference between permutations vs combinations shows up when a club has eight members and needs three of them for a project. If you only need a team, the result is a list of names, and swapping two names on that list changes nothing. If you need a coordinator, a recorder, and a presenter, swapping two people changes who does each job. In both cases you pick three different people, but you count different outcomes.

Permutations vs combinations with the same eight people

Start with the three jobs. Choose the coordinator first: any of the eight members can take that role. Once the coordinator is chosen, seven people are available to be recorder. For every coordinator and recorder pair, six people are left for presenter. That gives 8 × 7 × 6 = 336 assignments. This assumes that each member can do any of the jobs and no one holds two roles.

This is a permutation count. You can write each assignment as an ordered list with the coordinator first, the recorder second, and the presenter third. The order in which you actually make the decisions does not matter. You could pick the presenter first and still get 336 assignments. What matters is that the positions in the finished list mean different things.

Now remove the job titles. You only want to know which three people are on the team. You could still write down a first name, a second name, and a third name and get 336 lists. But those lists are not 336 different teams. Writing the same three names in another order does not create another group. Counting teams is a combination problem.

Why each team shows up six times

Label the members of one particular team A, B, and C. If you list all the ways those three people could fill the three roles, the lists are ABC, ACB, BAC, BCA, CAB, and CBA. For example, ABC gives A the coordinator job, while BAC gives that job to B. These are distinct assignments, but both use exactly the same three people.

The six lists are not a coincidence. With the team fixed, you have three choices for the first position, two for the second, and one for the last. So there are 3 × 2 × 1 = 6 arrangements. The same reasoning works for every team. The names change, but the number of ways to arrange three different people does not.

Imagine sorting all 336 assignments into piles by team membership. Every assignment belongs in exactly one pile, and every pile contains exactly six assignments. Since you want one count per pile rather than one count per assignment, divide 336 by 6. There are 56 teams. The key is not just that the ordered count contains repeats. It is that every team is repeated the same number of times.

Where the two formulas come from

Suppose you have n distinct people and want to select k of them, with nobody selected twice and 0 ≤ k ≤ n. To fill k distinct positions, start with n choices and reduce the number of available choices by one after each selection. For positive k, the last factor is n − k + 1. With eight people and three positions, those factors were 8, 7, and 6.

Factorial notation gives a short way to write the product. For a positive integer n, n! is the product of the integers from 1 through n, and 0! is defined as 1. Dividing n! by (n − k)! cancels the factors below the ones you need. For instance, 8!/5! leaves 8 × 7 × 6.

  • Permutations: P(n, k) = n! / (n − k)!
  • Combinations: C(n, k) = n! / [k!(n − k)!]

The extra k! in the combination formula removes the arrangements within each group. Another way to see the relationship is to build the assignments in two steps: choose the group, then put its members into the positions. Each group produces k! assignments, so multiplying the number of groups by k! gives the permutation count. The two formulas count the same choices at different levels of detail.

Use a swap to check what counts

Before choosing a formula, write down one possible outcome and swap two of the selected people. If the swap changes the result the problem asks you to count, the positions of those two people are distinct. First and second place in a race pass this test: reversing the runners changes who won. Choosing two runners to represent a school does not: the same two runners still represent the school.

Some problems fall between a fully ordered assignment and a team with no roles. Suppose the club needs one coordinator and two helpers, with no distinction between the helpers. Swapping the coordinator with a helper changes the outcome. Swapping the helpers does not. Start with the 336 ordered assignments, but divide by 2 rather than 6. Each outcome appears twice because only the two helper positions can be switched without changing it. The count is 168.

If you use the IYMC training and practice problems to work on explaining your reasoning, try naming exactly what gets counted twice before you write a division step. The Mathematics Explained articles offer more examples of working from a problem's conditions rather than reaching straight for a formula.

Try counting the same outcome two ways

From six people, pick a four-person team with one spokesperson. The other three members have no special roles. Try counting first by choosing the team, then by choosing the spokesperson before anyone else.

Team first: There are C(6, 4) = (6 × 5 × 4 × 3) / (4 × 3 × 2 × 1) = 15 teams. For each one, any of its four members can be spokesperson, giving 15 × 4 = 60 outcomes.

Spokesperson first: There are six choices for the spokesperson. For each one, choose three ordinary members from the five remaining people. Since C(5, 3) = (5 × 4 × 3) / (3 × 2 × 1) = 10, this gives 6 × 10 = 60 outcomes. The spokesperson is distinct in both counts, even though only the second method chooses that person first.

Frequently asked questions

Why do we divide by 3! for a three-person team?

Every team of three distinct people appears in exactly 3! = 6 ordered lists. Dividing the number of lists by six counts each team once.

Does it matter which role I fill first?

No. The order of your decisions does not change the count, as long as you track who fills each distinct role.

Can a problem have both distinct roles and interchangeable spots?

Yes. With a coordinator and two interchangeable helpers, swapping just the helpers leaves the outcome unchanged, so each outcome appears twice in the fully ordered count.