Skip to content

Business Mathematics and Basic Statistics · Ch 8 — Permutations and Combinations

Permutations — Meaning and Formula (nPr)

2

Permutations — Meaning and Formula (nPr)

Meaning of a permutation

A permutation is an arrangement of a group of objects in a definite ORDER. Placing the same 3 people into the roles of President, Secretary and Treasurer in a different order gives three genuinely different outcomes — that is the hallmark of a permutation problem: order matters.

Building the formula from first principles

Suppose rr objects, chosen out of nn distinct objects, are placed into rr positions in a row:

  • The 1st position can be filled in nn ways (any of the nn objects).
  • The 2nd position can then be filled in (n−1)(n-1) ways (one object is already used up).
  • The 3rd position can be filled in (n−2)(n-2) ways.
  • … continuing, the rr-th position can be filled in (n−r+1)(n-r+1) ways.

By the counting principle, the total number of arrangements is the product of these descending factors:

nPr=n(n−1)(n−2)⋯(n−r+1)^{n}P_{r} = n(n-1)(n-2)\cdots(n-r+1)

Multiplying and dividing by (n−r)!(n-r)! turns this into the compact factorial form used throughout this chapter:

nPr=n!(n−r)!,0≤r≤n, n,r∈W^{n}P_{r} = \frac{n!}{(n-r)!}, \qquad 0 \le r \le n,\ n,r \in \mathbb{W}

Note

Two boundary cases worth remembering

nP0=n!n!=1^{n}P_{0} = \dfrac{n!}{n!} = 1 (there is exactly one way to arrange "nothing"), and nPn=n!0!=n!^{n}P_{n} = \dfrac{n!}{0!} = n! (arranging all nn objects, in every possible order).

Evaluating nPr^{n}P_{r}

To evaluate nPr^{n}P_{r}, either apply the formula directly, or — usually faster — write out just the first rr descending factors of n!n!: …

Definition 1Permutation

A permutation of rr objects chosen from nn distinct objects is an ARRANGEMENT of those rr objects in a definite order. Two permutations differing only in the order of the same …