Loading [MathJax]/jax/output/CommonHTML/jax.js

Algebra Review VIII: Permutations and Combinations

A. Permutations

A permutation is an arrangement or order of distinct elements in a set. The number of permutations or arrangements of n distinct objects is n! (pronounced “n factorial”).

n!=(n)(n1)(n2)(2)(1)

Example 1. How many ways can you arrange five books on a shelf?

There are 5! possible ways to arrange five books on a shelf.

5!=(5)(4)(3)(2)(1)=120

Example 2. Use the answer in Example 1 to help determine the number of ways to arrange seven books on a shelf.

There are 7! possible ways to arrange seven books on a shelf.

7!+765!5431=765!=76120=5040

Suppose that instead of choosing all five of the books and arranging them as in Example 1, you only had space on your shelf for three books. In this case, you want “the number of permutations of five books taken three at a time,” which we express as 5P3. More generally, the number of permutations of n distinct objects taken k at a time, expressed as nPk, can be computed as follows:

nPk=n!(nk)=(n)(n1)(nk+1)

Example 3. How many ways can you select three books from five books and arrange them on a shelf?

5P3=5!(53)!=5432121=60

Example 4. Show the calculations for the number of permutations of 25 distinct objects taken 4 at a time.

5P3=25!(254)!=25!21!=2524232221!21!=303,606

Calculator Note: TI-84 graphing calculators will compute both factorials and permutations. Here are the steps for using a TI-84 to compute the answers to Examples 1 and 4:

To compute 5!:

To compute 25P4:

The output below shows the screen from the TI-84 after performing these two calculations.

image

Practice Exercises

Calculate the following showing the mathematical steps needed for the calculation. (In other words, do not use the built-in calculator functions for factorials or permutations.)

  1. 8!
  2. 15P5
  3. 30P2
  4. 27P3
  5. Use your calculator’s built-in function for nPk to calculate 50P10.

B. Combinations

A combination is a selection of a subset of a specific size, say k, from a set of n distinct elements where the order of the selection does not matter. We can express the number of combinations as nCk, which is often pronounced as “n choose k.”

Example 1. Suppose you have five books and want to choose three of the five to give to a friend as a gift. How many possible ways can this gift be selected?

In Example 3 in Algebra Review VIII, item A, Permutations (above), we calculated the number of ways that we could select three books out of five and arrange them: 5P3=60. But here, the order of the selection does not matter—the selected books will all go in the same gift box. So Book A, Book B, and Book C is the same gift as Book C, Book B, and Book A. There are 3! arrangements of the three selected books. So our answer should be 5P3/3!=606=10.

Page AR-30

The number of ways to choose k distinct objects from n distinct objects (where the order of the selection does not matter) is

nCk=nPkk!=n!(nk)!k!

Example 2. Find the number of possible ways to choose a three-person committee from a club with 50 members.

50C3=50!(503)!3!=50494847!47!3!=2550491648321=254916=19,600

Example 3. Show the calculations for 25C4. Compare its value with 25P4 in Example 4 from Algebra Review VIII, item A, Permutations (page AR-29).

25C4=25!(251)!4!=252423222121!4!=252423224321=222322=12,65025P4=303,600whichis4!×25C4or24×25C4

Calculator Note: TI-84 graphing calculators will compute combinations. Here are the steps for using a TI-84 to compute 25C4 from Example 3:

image

Practice Exercises

Calculate the following showing the mathematical steps needed for the calculation. (In other words, do not use the built-in calculator function for combinations.)

  1. 15C5
  2. 30C2
  3. 27C3
  4. 50C10
  5. Use your calculator’s built-in function for nCk to calculate 50C20.
[Leave] [Close]