Skip to main content
Mathematics LibreTexts

3.4: Combinatorics- Second Counts

  • Page ID
    88855
  • \( \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}}\)

    Terminology

    Permutations, presented in Section Subsection 1.5.1, count the number of ways to permute, or rearrange, objects. Note that when permuting objects, some can be ignored. For example Table \(\PageIndex{1}\) are all permutations of two characters from the alphabet \(\{a,b,c\}\).

    Table \(\PageIndex{1}\) Permutations of \(\{a,b,c\}\).
    ba ca
    ab cb
    ac bc

    Sometimes the order of objects is unimportant. The number of outcomes can still be counted. These are called combinations. The combinations of two letters from the alphabet \(\{a,b,c\}\). are ab, ac, bc.

    Practice

    Discover a Method

    Checkpoint \(\PageIndex{2}\)

    How many permutations of two letters from the alphabet \(\{a,b,c\}\). are there? How many combinations of two letters from the alphabet \(\{a,b,c\}\). are there? How do you get the combinations count from the permutations count?

    Checkpoint \(\PageIndex{3}\)

    How many permutations are there of three letters from the alphabet \(\{a,b,c,d\}\)? Select three of these letters. How many ways can you order these three letters? How does this help count the number of combinations of three letters from this alphabet?

    Use the Method

    Checkpoint \(\PageIndex{4}\)

    How many permutations of three letters from the English alphabet (26 characters) are there?

    Checkpoint \(\PageIndex{5}\)

    If 10 people participate in a race and only the first three places are recorded, how many possible results are there?

    Checkpoint \(\PageIndex{6}\)

    How many permutations of the letters of the word ‘greet’ are there?

    Checkpoint \(\PageIndex{7}\)

    (a) Suppose 10 people apply for three, identical jobs. In how many orders can three of these 10 people be hired?

    (b) How many ways are there to permute these three people?

    (c) If the first problem counted the number of ways to order three (3) of ten (10) people and the second problem counted the number of ways any particular three can be ordered, how can these be combined to count the number of ways to select three (3) out of ten (10) people?

    Checkpoint \(\PageIndex{8}\)

    How many ways are there to select two types of ice cream from a selection of 14?

    Checkpoint \(\PageIndex{9}\)

    If a set has 15 elements, how many subsets of 4 elements exist?


    This page titled 3.4: Combinatorics- Second Counts is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Mark A. Fitch via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.

    • Was this article helpful?