Skip to main content
Mathematics LibreTexts

3.1: Permutations

  • Page ID
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    We begin by looking at permutations, because these are a straightforward application of the product rule. The word “permutation” means a rearrangement, and this is exactly what a permutation is: an ordering of a number of distinct items in a line. Sometimes even though we have a large number of distinct items, we want to single out a smaller number and arrange those into a line; this is also a sort of permutation.

    Definition: Permutation

    A permutation of \(n\) distinct objects is an arrangement of those objects into an ordered line. If \(1 ≤ r ≤ n\) (and \(r\) is a natural number) then an r-permutation of \(n\) objects is an arrangement of \(r\) of the \(n\) objects into an ordered line.

    So a permutation involves choosing items from a finite population in which every item is uniquely identified, and keeping track of the order in which the items were chosen.

    Since we are studying enumeration, it shouldn’t surprise you that what we’ll be asking in this situation is how many permutations there are, in a variety of circumstances. Let’s begin with an example in which we’ll calculate the number of \(3\)-permutations of ten objects (or in this case, people).

    Example \(\PageIndex{1}\)

    Ten athletes are competing for Olympic medals in women’s speed skating (1000 metres). In how many ways might the medals end up being awarded?


    There are three medals: gold, silver, and bronze, so this question amounts to finding the number of \(3\)-permutations of the ten athletes (the first person in the \(3\)-permutation is the one who gets the gold medal, the second gets the silver, and the third gets the bronze).

    To solve this question, we’ll apply the product rule, where the aspects that can vary are the winners of the gold, silver, and bronze medals. We begin by considering how many different athletes might get the gold medal. The answer is that any of the ten athletes might get that medal. No matter which of the athletes gets the gold medal, once that is decided we move our consideration to the silver medal. Since one of the athletes has already been awarded the gold medal, only nine of them remain in contention for the silver medal, so for any choice of athlete who wins gold, the number of choices for who gets the silver medal is nine. Finally, with the gold and silver medalists out of contention for the bronze, there remain eight choices for who might win that medal. Thus, the total number of ways in which the medals might be awarded is \(10 · 9 · 8 = 720\).

    We can use the same reasoning to determine a general formula for the number of \(r\)-permutations of \(n\) objects:

    Theorem \(\PageIndex{1}\)

    The number of \(r\)-permutations of \(n\) objects is \(n(n − 1). . .(n − r + 1)\)


    There are \(n\) ways in which the first object can be chosen (any of the \(n\) objects). For each of these possible choices, there remain \(n-1\) objects to choose for the second object, etc.


    We use \(n!\) to denote the number of permutations of \(n\) objects, so

    \[n! = n(n − 1). . . 1\].

    By convention, we define \(0! = 1\).

    Definition: Factorial

    We read \(n!\) as “\(n\) factorial,” so \(n\) factorial is \(n(n − 1). . . 1\). Thus, the number of r-permutations of \(n\) objects can be re-written as \(\dfrac{n!}{(n − r)!}\). When \(n = r\) this gives \(\dfrac{n!}{0!} = n!\), making sense of our definition that \(0! = 1\).

    Example \(\PageIndex{2}\)

    There are 36 people at a workshop. They are seated at six round tables of six people each for lunch. The Morris family (of three) has asked to be seated together (side-by-side). How many different seating arrangements are possible at the Morris family’s table?


    First, there are \(3! = 6\) ways of arranging the order in which the three members of the Morris family sit at the table. Since the tables are round, it doesn’t matter which specific seats they take, only the order in which they sit matters. Once the Morris family is seated, the three remaining chairs are uniquely determined by their positions relative to the Morris family (one to their right, one to their left, and one across from them). There are 33 other people at the conference; we need to choose three of these people and place them in order into the three vacant chairs. There are \(\dfrac{33!}{(33 − 3)!} = \dfrac{33!}{30!}\) ways of doing this. In total, there are \(6 \left( \dfrac{33!}{30!} \right) = 196,416\) different seating arrangements possible at the Morris family’s table.

    By adjusting the details of the preceding example, it can require some quite different thought processes to find the answer.

    Example \(\PageIndex{3}\)

    At the same workshop, there are three round dinner tables, seating twelve people each. The Morris family members (Joy, Dave, and Harmony) still want to sit at the same table, but they have decided to spread out (so no two of them should be side-by-side) to meet more people. How many different seating arrangements are possible at the Morris family’s table now?


    Let’s begin by arbitrarily placing Joy somewhere at the table, and seating everyone else relative to her. This effectively distinguishes the other eleven seats. Next, we’ll consider the nine people who aren’t in Joy’s family, and place them (standing) in an order clockwise around the table from her. There are \(\dfrac{33!}{(33 − 9)!}\) ways to do this. Before we actually assign seats to these nine people, we decide where to slot in Dave and Harmony amongst them.


    (In the above diagram, the digits \(1\) through \(9\) represent the nine other people who are sitting at the Morris family’s table, and the \(J\) represents Joy’s position.) Dave can sit between any pair of non-Morrises who are standing beside each other; that is, in any of the spots marked by small black dots in the diagram above. Thus, there are eight possible choices for where Dave will sit. Now Harmony can go into any of the remaining seven spots marked by black dots. Once Dave and Harmony are in place, everyone shifts to even out the circle (so the remaining black dots disappear), and takes their seats in the order determined.

    We have shown that there are \(\dfrac{33!}{24!} · 8 · 7\) possible seating arrangements at the Morris table. That’s a really big number, and it’s quite acceptable to leave it in this format. However, in case you find another way to work out the problem and want to check your answer, the total number is \(783\), \(732\), \(837\), \(888\), \(000\).

    Exercise \(\PageIndex{1}\)

    Use what you have learned about permutations to work out the following problems. The sum and/or product rule may also be required.

    1. Six people, all of whom can play both bass and guitar, are auditioning for a band. There are two spots available: lead guitar, and bass player. In how many ways can the band be completed?
    2. Your friend Garth tries out for a play. After the auditions, he texts you that he got one of the parts he wanted, and that (including him) nine people tried out for the five roles. You know that there were two parts that interested him. In how many ways might the cast be completed (who gets which role matters)?
    3. You are creating an \(8\)-character password. You are allowed to use any of the \(26\) lowercase characters, and you must use exactly one digit (from \(0\) through \(9\)) somewhere in the password. You are not allowed to use any character more than once. How many different passwords can you create?
    4. How many \(3\)-letter “words” (strings of characters, they don’t actually have to be words) can you form from the letters of the word STRONG? How many of those words contain an s? (You may not use a letter more than once.)
    5. How many permutations of \(\{0, 1, 2, 3, 4, 5, 6\}\) have no adjacent even digits? For example, a permutation like 5034216 is not allowed because \(4\) and \(2\) are adjacent.

    This page titled 3.1: Permutations is shared under a CC BY-NC-SA license and was authored, remixed, and/or curated by Joy Morris.

    • Was this article helpful?