Counting Principles, Permutations, and Combinations Worked Examples Cheatsheet and Study Guide

How to start a counting principles, permutations, and combinations problem without guessing

This worked-examples version of counting principles, permutations, and combinations is designed to show the order of thought, not just the final result. Worked examples are useful because they expose the order of thought: identify the controlling condition, choose the right model or rule, and only then compute or conclude. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Turn every counting problem into a sequence of choices before you reach for a formula. If you skip that order, even familiar formulas become fragile under slight wording changes. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Electing officers

A club must choose president, vice president, and treasurer from the same group of students. The aim here is why offices create ordered outcomes. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

1. Notice that each role is distinct, so changing who gets which role changes the result.
2. Count the options stage by stage as positions are filled without replacement.
3. Then, if desired, compress that stage count into permutation notation.

This example is a reliable test of whether you really understand ‘order matters.’ (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Forming a committee

A class must choose four students to serve on a review committee, with no special roles assigned. The aim here is why membership matters but arrangement does not. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

1. Recognise that the committee is the same regardless of internal listing order.
2. Avoid counting each group multiple times through different arrangements.
3. Use a combination count because the outcome is an unordered set of members.

Placing this side by side with the officer example usually locks the distinction in place. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Decision table for recurring counting principles, permutations, and combinations problems

Problem type	First move	Key check	Typical payoff
Electing officers	Notice that each role is distinct, so changing who gets which role changes the result.	Count the options stage by stage as positions are filled without replacement.	This example is a reliable test of whether you really understand ‘order matters.‘
Forming a committee	Recognise that the committee is the same regardless of internal listing order.	Avoid counting each group multiple times through different arrangements.	Placing this side by side with the officer example usually locks the distinction in place.

Patterns the worked examples were meant to teach

When a task is completed in stages and each stage has a fixed number of options, the total number of outcomes is found by multiplying the stage counts. (OpenStax Precalculus 2e: 11.5 Counting Principles)

If who or what goes first, second, or third matters, you are in permutation territory. Order creates different outcomes, so the count is larger than the corresponding unordered selection count. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Using permutations when the problem is really about groups is a common reason a solution feels right while still landing on the wrong conclusion. Test whether order changes the meaning of the answer before choosing a formula. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Continue through the counting principles, permutations, and combinations cluster

• Open counting principles, permutations, and combinations Overview when you want the broad conceptual map before diving back into detail.
• Open counting principles, permutations, and combinations Exam Essentials when you want the highest-yield version of the same topic under time pressure.
• This is the page you are already on, so use the note below it as your benchmark for what that variant should deliver.
• Open counting principles, permutations, and combinations Revision Checklist when you want a memory audit instead of another long explanation.
• Open counting principles, permutations, and combinations Common Mistakes when you want to debug the predictable traps that keep appearing in your answers.

Maths pages that reinforce this worked examples

• applications of integration in context Worked Examples is the nearest same-variant page if you want a comparable angle on a neighboring maths topic.

• linear regression and least squares Worked Examples is the next same-variant page if you want to keep the revision mode but change the content.

• Browse the full maths cheatsheet archive if you want a broader subject sweep after this page.

Counting principles, permutations, and combinations FAQ for Worked Examples

What question should I ask first in a counting problem?

Ask whether the result changes when order changes. That single question often decides whether you need permutations or combinations. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Why is the multiplication principle so important?

Because many more advanced counting formulas are just condensed versions of sequential stage counting. If you understand the stages, the formulas become much easier to trust and remember. (OpenStax Precalculus 2e: 11.5 Counting Principles)

When would I use the addition principle instead?

Use addition when the problem has non-overlapping alternative cases rather than a sequence of required choices. In other words, add for either-or cases and multiply for and-then cases. (OpenStax Precalculus 2e: 11.5 Counting Principles)

What is the best way to avoid overcounting?

Describe exactly what counts as one outcome before you calculate anything. If rearranging the same members does not create a new outcome, you need to avoid counting those rearrangements separately. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Source trail for counting principles, permutations, and combinations

• OpenStax Precalculus 2e: 11.5 Counting Principles was used for the the multiplication principle is the backbone of counting framing in this worked examples maths page.
• Mathematics LibreTexts: Permutations and Combinations was used for the permutations are about ordered selection framing in this worked examples maths page.

Extra consolidation for counting principles, permutations, and combinations

Turn every counting problem into a sequence of choices before you reach for a formula. The formula becomes obvious once the choice structure is clear. A stronger final pass is to connect the multiplication principle is the backbone of counting to permutations are about ordered selection and then force yourself to explain what changes between them instead of memorising each heading in isolation. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

When a task is completed in stages and each stage has a fixed number of options, the total number of outcomes is found by multiplying the stage counts. If who or what goes first, second, or third matters, you are in permutation territory. Order creates different outcomes, so the count is larger than the corresponding unordered selection count. Read those two ideas as one chain and notice how they control the way you would justify the topic in an exam, lab write-up, or data interpretation setting. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

To make that chain usable, walk the process through describe the choice stages and check whether order matters. List the decisions the problem is really asking you to make. Ask whether swapping positions or labels creates a genuinely different outcome. The point is not just to know the labels, but to know why this order reduces confusion when the prompt becomes more detailed or wordy. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

A club must choose president, vice president, and treasurer from the same group of students. This example is a reliable test of whether you really understand ‘order matters.’ Put that beside forming a committee and ask what stays stable across both examples even when the surface details change. That comparison work is usually where durable understanding starts to replace pattern-matching. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

This overcounts outcomes because it treats rearrangements of the same members as different. Test whether order changes the meaning of the answer before choosing a formula. Once you can correct that error on purpose, look for forgetting whether choices are without replacement as the next likely point of failure so the topic gets cleaner with each pass instead of just feeling more familiar. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)

Quick recall prompts

• Restate the multiplication principle is the backbone of counting in one sentence without leaning on the phrasing already used above. (OpenStax Precalculus 2e: 11.5 Counting Principles)
• Link that sentence to describe the choice stages so the topic feels like a sequence of moves instead of a loose list of facts. (OpenStax Precalculus 2e: 11.5 Counting Principles)
• Rehearse electing officers out loud and ask what evidence or condition you would check first. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)
• Scan your next answer for using permutations when the problem is really about groups before you decide the response is finished. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)
• Compare this worked examples page with counting principles, permutations, and combinations Revision Checklist if you want the same content reframed for a different study task.

Placing this side by side with the officer example usually locks the distinction in place. If the topic still feels thin after that, move through the sibling and neighboring pages linked above and turn this page into the anchor note that keeps the whole cluster internally connected. (OpenStax Precalculus 2e: 11.5 Counting Principles; Mathematics LibreTexts: Permutations and Combinations)