Sign in to save

Bookmark this page so you can find it later.

Sign in to save

Bookmark this page so you can find it later.

Permutations & Combinations Master Reference cheat sheet - grade 9-12

Click image to open full size

Math Grade 9-12

Permutations & Combinations Master Reference Cheat Sheet

A printable reference covering factorials, permutations, combinations, arrangements with repetition, and counting principles for grades 9-12.

Download PNG

Permutations and combinations help students count outcomes without listing every possibility. This cheat sheet covers the main counting rules used in algebra, probability, statistics, and discrete math. Students need it to decide when order matters, when repetition is allowed, and which formula matches a situation. It is useful for homework, test review, and probability problems involving selections or arrangements. The core ideas begin with the multiplication principle and factorial notation. Permutations count ordered arrangements, while combinations count unordered selections. Many problems can be solved by identifying the total number of items nn, the number chosen rr, and whether repeats are allowed. When events involve several stages, add counts for separate cases and multiply counts for connected choices.

Key Facts

  • The factorial of a positive integer is n!=n(n1)(n2)21n! = n(n - 1)(n - 2)\cdots 2\cdot 1, and 0!=10! = 1.
  • The multiplication principle says that if one choice has aa options and the next has bb options, then the total number of ordered outcomes is aba\cdot b.
  • The number of permutations of nn distinct objects taken rr at a time is P(n,r)=n!(nr)!P(n,r) = \frac{n!}{(n-r)!}.
  • The number of combinations of nn distinct objects taken rr at a time is C(n,r)=(nr)=n!r!(nr)!C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}.
  • If order matters and repetition is allowed, the number of length rr arrangements from nn choices is nrn^r.
  • If order does not matter and repetition is allowed, the number of selections is (n+r1r)\binom{n+r-1}{r}.
  • The number of distinct arrangements of nn objects with repeated groups of sizes aa, bb, and cc is n!a!b!c!\frac{n!}{a!b!c!}.
  • For combinations, symmetry gives (nr)=(nnr)\binom{n}{r} = \binom{n}{n-r}, so choosing rr items is equivalent to leaving out nrn-r items.

Vocabulary

Factorial
A factorial, written n!n!, is the product of all positive integers from nn down to 11, with 0!=10! = 1.
Permutation
A permutation is an arrangement where the order of the selected items matters.
Combination
A combination is a selection where the order of the selected items does not matter.
Repetition
Repetition means an item may be chosen more than once in the same counting process.
Multiplication Principle
The multiplication principle states that choices made in stages are counted by multiplying the number of options at each stage.
Binomial Coefficient
A binomial coefficient, written (nr)\binom{n}{r}, counts the number of ways to choose rr items from nn items without order.

Common Mistakes to Avoid

  • Using permutations when order does not matter is wrong because it counts the same group multiple times, such as counting ABCABC and CBACBA as different teams.
  • Using combinations when order matters is wrong because positions or rankings create different outcomes, such as 11st, 22nd, and 33rd place winners.
  • Forgetting the value 0!=10! = 1 is wrong because formulas like P(n,n)=n!0!P(n,n) = \frac{n!}{0!} and (nn)=n!n!0!\binom{n}{n} = \frac{n!}{n!0!} depend on it.
  • Allowing repetition when the problem says items are distinct or cannot be reused is wrong because formulas like nrn^r assume every choice remains available each time.
  • Adding when choices happen together is wrong because staged choices use multiplication; for example, 44 shirts and 33 pants make 43=124\cdot 3 = 12 outfits, not 4+3=74 + 3 = 7.

Practice Questions

  1. 1 How many ways can 55 students line up in a row?
  2. 2 A club has 1212 members. How many different committees of 44 members can be chosen?
  3. 3 A password uses 33 letters chosen from 2626 letters, and repetition is allowed. How many passwords are possible?
  4. 4 A teacher chooses 33 students for a committee and also ranks 33 students for first, second, and third prize. Explain why one situation uses combinations and the other uses permutations.