Permutation Formula

A permutation is an ordered arrangement of objects — the number of ways to choose and order r items from n distinct items is P(n,r) = n!/(n-r)!.

The Formula

P(n,r)=n!(n−r)!

Ask yourself: Does swapping two of the chosen items create a different valid outcome?

Quick example

Arrange 3 people in 3 chairs: 3!=3×2×1=6 ways

Notation

P(n,r), nPr, or Prn all denote permutations of r items from n

What this formula means

A permutation is an ordered arrangement of objects — the number of ways to choose and order r items from n distinct items is P(n,r)=n!(n−r)!.

A permutation is like seating friends in numbered seats. With five friends and three numbered seats, seat 1 has 5 candidates, seat 2 has 4 and seat 3 has 3. Moving two friends between seats creates a new seating, which is why order counts; on an unnumbered bench, it would be a combination.

Formal view

P(n,r)=n!(n−r)!=n(n−1)(n−2)⋯(n−r+1) for 0≤r≤n

Worked examples

Example 1

easy
In how many ways can 3 students be arranged in a line from a group of 7?
Show solution

Answer

P(7,3)=210

First step

1.
Recall the permutation formula for ordered selections: P(n,r)=n!(n−r)!, where n=7 and r=3.

Full solution

  1. 2.
    Expand the factorial ratio: P(7,3)=7!(7−3)!=7!4!=7×6×5
  2. 3.
    Calculate the product: 7×6×5=210
Permutations count ordered arrangements. Since the order in a line matters (ABC differs from BAC), we use permutations rather than combinations.

Example 2

medium
How many distinct arrangements of the letters in the word MISSISSIPPI are there?

Example 3

medium
Solve for n: P(n,2)=72.

Common mistakes

  • Using a permutation when order doesn't matter — that overcounts by r!; use a combination instead.
  • Allowing repeats — P(n,r) assumes distinct items each used once; repeats need the counting principle.
  • Confusing n and r in n!(n−r)! — n is the pool, r is how many positions you fill.

Why this formula matters

Permutations count arrangements far too many to list: 10 runners can fill 1st, 2nd and 3rd in 10×9×8=720 ways. Those counts become probability denominators, such as the 1720 chance of guessing the exact podium at random. Treat ordered outcomes as unordered, or the reverse, and the count is off by a factor of r!.

Frequently asked questions

What is the Permutation formula?

A permutation is an ordered arrangement of objects — the number of ways to choose and order r items from n distinct items is P(n,r)=n!(n−r)!.

How do you use the Permutation formula?

Use a permutation when you choose items and arrange them, and the positions differ: 1st, 2nd and 3rd places, a president and vice-president, a code where no digit repeats, the order of songs in a playlist. Each item is used at most once. If the chosen items form a group with no roles (a team, a committee, a hand of cards), use a combination. If items can repeat, as in a PIN, multiply n by itself r times.

What do the symbols mean in the Permutation formula?

P(n,r), nPr, or Prn all denote permutations of r items from n

Why is the Permutation formula important in Math?

Permutations count arrangements far too many to list: 10 runners can fill 1st, 2nd and 3rd in 10×9×8=720 ways. Those counts become probability denominators, such as the 1720 chance of guessing the exact podium at random. Treat ordered outcomes as unordered, or the reverse, and the count is off by a factor of r!.

What do students get wrong about Permutation?

The procedure for permutation is the easy part; the trap is using a permutation when order doesn't matter. Asking "Does swapping two of the chosen items create a different valid outcome?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

What should I learn before the Permutation formula?

Before studying the Permutation formula, you should understand: factorial.