Permutations

A permutation counts the ways to choose r items from n different items and put them in order. The first spot has n choices, and the second has n−1n-1 because one item is used, so you multiply these. A different order counts as a different case.

Chalcack concept card · Reviewed by the Chalcack team ·

There are 3 × 2 = 6 ways to pick 1st and 2nd place from A, B and C.

Formulas

  • nPr=n×(n−1)×⋯×(n−r+1){}_nP_r = n \times (n-1) \times \cdots \times (n-r+1) (multiply r numbers, starting at n and going down by 1)
  • nPn=n!=n×(n−1)×⋯×2×1{}_nP_n = n! = n \times (n-1) \times \cdots \times 2 \times 1

When to use it

Use it when order matters, such as lining people up, assigning seats, or choosing a president and a vice president.

Worked example

Choose a president and a vice president from 4 people. Step 1: any of the 4 people can be president, so 4 ways. Step 2: the vice president is one of the other 3, so 3 ways. Step 3: 4P2=4×3=12{}_4P_2 = 4 \times 3 = 12, so the answer is 12 ways.

Common mistake

If order does not matter, like picking 2 representatives, using a permutation counts (A, B) and (B, A) twice. Use a combination for those problems.

Related concepts

All 181 math concepts