Business Mathematics and Statistics · Ch 2 — Algebra (Partial Fractions, Permutations, Combinations, Mathematical Induction, Binomial Theorem)
Permutations — nPr, Arrangements with Repetition, and Circular Permutations
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 distinct things taken at a time, written , counts the number of ways to arrange objects chosen from distinct objects, order mattering:
Special cases: (arranging all objects) and (there is exactly one way to arrange nothing).
Permutations when some things are alike (repetition). If objects are to be arranged but of them are alike of one kind, alike of a second kind, and so on, the number of distinct arrangements is
This divides out the arrangements that look identical because some objects cannot be told apart.
Circular permutations. Arranging 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 distinct people around a round table is
(one person's position is fixed as a reference, and the remaining 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 . …
nPr = n!/(n-r)!, the number of ordered arrangements of r objects chosen from n di …
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 …