Permutations and combinations show up in many statistics, probability, and business-math assignments. You may be asked how many outfits are possible, how many ways books can be arranged, how many prize winners can be selected, or how many samples can contain a defective item.
The questions look different, but most counting problems use the same few ideas: the Fundamental Counting Principle, factorials, permutations, combinations, and probability. This guide explains the difference between those methods and walks through common examples step by step.
Learning references: OpenStax probability chapter and OpenStax probability key terms.
Quick answer: Use the Fundamental Counting Principle when choices happen in stages. Use a permutation when order matters. Use a combination when order does not matter. For probability, count the favorable outcomes and divide by the total possible outcomes.
Table of Contents
- The Fundamental Counting Principle
- Permutations: When Order Matters
- Combinations: When Order Does Not Matter
- Counting Unique Pairs
- Probability and Arrangements
- How to Know Which Method to Use
- Worked Answer Key
- Common Mistakes Students Make
- How to Explain Counting Problems Clearly
- Frequently Asked Questions
The Fundamental Counting Principle
The Fundamental Counting Principle is used when a situation involves several choices made in sequence. If the first step has 8 choices, the second step has 3 choices, and the third step has 5 choices, the total number of outcomes is found by multiplying the choices:
For example, suppose a student owns 8 pairs of pants, 1 shirt, 8 ties, and 7 jackets. If one of each item must be worn, the number of possible outfits is:
Therefore, the student can create 448 different outfits.
The same idea applies when forming three-letter words from seven letters. If repetition is allowed, there are seven choices for each position:
So, 343 three-letter arrangements are possible when repetition is allowed.
If repetition is not allowed, the number of available letters decreases after each choice:
This gives 210 possible arrangements without repetition.
Permutations: When Order Matters
A permutation is used when the order of the objects matters. Arranging books on a shelf, assigning first, second, and third place, and ordering songs in a recital are permutation problems because changing the order creates a different result.
When all objects are arranged, factorial notation is often used:
For example, suppose a pianist wants to arrange five different pieces in a recital program. There are:
Therefore, the pianist can arrange the pieces in 120 different ways.
The same method can be used to arrange four books on a shelf:
There are 24 possible arrangements.
Another example involves awarding first, second, and third prizes in a contest with 605 contestants. Because first, second, and third place are different positions, order matters:
There are 220,348,260 possible ways to award the prizes.
Combinations: When Order Does Not Matter
A combination is used when items are being selected and the order of selection does not matter. Choosing three chip flavors is a combination problem because the same three flavors count as one selection no matter which one is named first.
The common combination formula is:
Suppose someone must choose 3 different bags of chips from 10 available varieties. Choosing barbecue, cheese, and sour cream is the same selection regardless of order.
Therefore, there are 120 different selections.
Quality-control example with defective laptops
Combinations are also useful in quality-control problems. Suppose a shipment contains 131 laptops, including 7 defective laptops, and a specialist chooses 5 laptops.
The total number of possible samples is:
Since 7 laptops are defective, there are 124 non-defective laptops. The number of samples containing no defective laptops is:
To determine how many samples contain at least one defective laptop, subtract the samples containing no defective laptops from the total number of samples:
Therefore, 72,452,632 samples contain at least one defective laptop.
For exactly one defective laptop, choose 1 defective laptop from the 7 defective laptops and 4 good laptops from the 124 good laptops:
This illustrates how combinations can be multiplied when a selection contains items from different categories.
Counting Unique Pairs
Some counting problems involve pairs of people. Suppose two swim teams each have 8 players, giving a total of 16 swimmers. If every swimmer gives a high five to every other swimmer exactly once, the number of high fives is:
Therefore, 120 high fives occur.
A combination is appropriate because a high five between Player A and Player B is the same pair as a high five between Player B and Player A. Reversing the names does not create a new high five.
Probability and Arrangements
Counting techniques can also be used to calculate probability. The basic probability structure is:
Suppose eight CDs are randomly placed in a rack. There are:
possible arrangements. Only one of those arrangements places the CDs in alphabetical order. Therefore, the probability is:
This shows why counting rules matter in probability. Once you know the total number of possible arrangements, probability questions become much easier to organize.
For another real-life example of combinations in probability, see Statskan’s guide to Powerball odds and expected value. Lottery jackpot odds use combinations because the order of the white balls does not matter.
How to Know Which Method to Use
The most important step in solving counting problems is identifying what the question is asking. Do not start with a formula first. Start by asking whether choices happen in stages, whether order matters, and whether repetition is allowed.
| Question clue | Method to use | Example |
|---|---|---|
| Several independent choices are made | Fundamental Counting Principle | Outfits using pants, shirts, ties, and jackets |
| Order matters | Permutation | First, second, and third place winners |
| Order does not matter | Combination | Choosing 3 chip flavors from 10 varieties |
| One outcome is compared with all outcomes | Probability using counting | Probability that 8 CDs are in alphabetical order |
Fast decision rule: Ask, “Does changing the order create a different result?” If yes, use a permutation. If no, use a combination.
Worked Answer Key
Here is a clean answer-key version of the examples above. This format is useful when you need to show final answers for a homework check.
| Problem | Method | Answer |
|---|---|---|
| 8 pairs of pants, 1 shirt, 8 ties, and 7 jackets | Fundamental Counting Principle | 8 x 1 x 8 x 7 = 448 outfits |
| Three-letter words from seven letters, repetition allowed | Fundamental Counting Principle | 7 x 7 x 7 = 343 arrangements |
| Three-letter words from seven letters, no repetition | Permutation-style counting | 7 x 6 x 5 = 210 arrangements |
| Arrange five recital pieces | Permutation | 5! = 120 arrangements |
| Arrange four books on a shelf | Permutation | 4! = 24 arrangements |
| Award first, second, and third prizes among 605 contestants | Permutation | 605 x 604 x 603 = 220,348,260 ways |
| Choose 3 chip flavors from 10 varieties | Combination | C(10, 3) = 120 selections |
| Choose 5 laptops from 131 | Combination | C(131, 5) = 297,602,656 samples |
| Samples with at least one defective laptop | Complement rule with combinations | C(131, 5) – C(124, 5) = 72,452,632 samples |
| Samples with exactly one defective laptop | Category combinations | C(7, 1) x C(124, 4) = 65,668,757 samples |
| High fives among 16 swimmers | Combination | C(16, 2) = 120 high fives |
| Eight CDs in alphabetical order | Permutation probability | 1 / 40,320 |
Common Mistakes Students Make
Using permutations for every problem
If order does not matter, using a permutation will usually overcount the outcomes.
Ignoring repetition
Repetition allowed and repetition not allowed can produce very different answers.
Forgetting the complement rule
For “at least one” problems, it is often easier to subtract the “none” case from the total.
Confusing probability with counting
Counting gives the number of outcomes. Probability compares favorable outcomes with total outcomes.
How to Explain Counting Problems Clearly
A strong homework answer should not only give the final number. It should also explain why the chosen method fits the wording of the problem.
- Identify whether the problem involves stages, arrangements, selections, pairs, or probability.
- State whether order matters.
- State whether repetition is allowed.
- Write the formula or multiplication setup.
- Show the final answer with a short interpretation.
Example explanation
Why is choosing 3 chip flavors from 10 a combination?
It is a combination because the same three flavors count as one selection even if they are listed in a different order. Since order does not matter, the correct setup is C(10, 3) = 120.
If your assignment moves from counting into probability distributions, the binomial distribution calculator may help with fixed-trial probability questions. If the problem uses a two-way table, read the conditional probability student grades example. For broader practice, use the statistics calculators hub or ask an online statistics tutor to check the setup.
Need Help With Permutations and Combinations?
Statskan can help you identify the correct counting method, check formulas, and explain probability homework in clear steps.
Submit Your Statistics Question Statistics Homework HelpFrequently Asked Questions
A permutation is used when order matters. A combination is used when order does not matter. Arranging books is a permutation. Choosing a group of books is a combination.
Use the Fundamental Counting Principle when a task has several steps and each step has a certain number of choices. Multiply the number of choices for each step.
nPr means the number of permutations of r objects selected from n objects. It is used when order matters.
nCr means the number of combinations of r objects selected from n objects. It is used when order does not matter.
A high five between two people is the same pair regardless of which name is listed first. Because the order of the pair does not create a new outcome, combinations are used.
Permutations and combinations help count total possible outcomes and favorable outcomes. Probability is then calculated by dividing favorable outcomes by total outcomes.
Leave a Reply