Skip to content

Business Mathematics and Statistics · Ch 2 — Algebra (Partial Fractions, Permutations, Combinations, Mathematical Induction, Binomial Theorem)

Permutations — nPr, Arrangements with Repetition, and Circular Permutations

4

Permutations — nPr, Arrangements with Repetition, and Circular Permutations

A permutation is an arrangement of objects in a definite order — changing the order gives a different permutation.

Permutations of nn distinct things taken rr at a time, written nPr^{n}P_{r}, counts the number of ways to arrange rr objects chosen from nn distinct objects, order mattering:

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

Special cases: nPn=n!^{n}P_{n} = n! (arranging all nn objects) and nP0=1^{n}P_{0} = 1 (there is exactly one way to arrange nothing).

Permutations when some things are alike (repetition). If nn objects are to be arranged but p1p_1 of them are alike of one kind, p2p_2 alike of a second kind, and so on, the number of distinct arrangements is

n!p1! p2! ⋯ pk!\frac{n!}{p_1!\, p_2!\, \cdots \, p_k!}

This divides out the arrangements that look identical because some objects cannot be told apart.

Circular permutations. Arranging nn distinct objects around a circle is different from arranging them in a row, because a circular arrangement has no fixed starting point — rotating everyone by one seat gives what looks like the same arrangement. The number of distinct ways to seat nn distinct people around a round table is

(n−1)!(n-1)!

(one person's position is fixed as a reference, and the remaining n−1n-1 people are arranged relative to that position). If, in addition, a clockwise arrangement is considered identical to its mirror-image anticlockwise arrangement (as with beads on a necklace, where the object can be flipped over), the count halves to (n−1)!2\dfrac{(n-1)!}{2}. …

Definition 1nPr (Permutation of n things taken r at a time)

nPr = n!/(n-r)!, the number of ordered arrangements of r objects chosen from n di …

Definition 2Circular permutation

The number of distinct ways to arrange n distinct objects around a circle, equal to (n-1)! (halved further to (n-1)!/2 if clockwise and anticlockwise arrangemen …