Skip to main content
Ch. 8 - Sequences, Induction, and Probability
Blitzer - College Algebra 8th Edition
Blitzer8th EditionCollege AlgebraISBN: 9780136970514Not the one you use?Change textbook
Chapter 9, Problem 73

Evaluate the expression. *permutation notation* the number of permutations 9 things taken 5 at a time (sub 9)P(sub 5)

Verified step by step guidance
1
Understand the permutation formula: The number of permutations of n things taken r at a time is given by the formula: P(n,r)=n!(n-r)!, where n! is the factorial of n.
Identify the values of n and r from the problem: Here, n = 9 and r = 5. This means we are calculating the number of permutations of 9 things taken 5 at a time.
Substitute the values of n and r into the formula: P(9,5)=9!(9-5)!.
Simplify the denominator: Calculate (9-5)!, which is 4!. The formula now becomes: 9!4!.
Expand and simplify the factorials: Write out 9! as 9×8×7×6×5×4!, and cancel the 4! in the numerator and denominator. This leaves: 9×8×7×6×5.

Verified video answer for a similar problem:

This video solution was recommended by our tutors as helpful for the problem above.
Video duration:
2m
Was this helpful?

Key Concepts

Here are the essential concepts you must grasp in order to answer the question correctly.

Permutations

Permutations refer to the different ways in which a set of items can be arranged or ordered. In mathematics, the number of permutations of 'n' items taken 'r' at a time is calculated using the formula P(n, r) = n! / (n - r)!, where 'n!' denotes the factorial of 'n'. This concept is crucial for understanding how to count arrangements when the order of selection matters.
Recommended video:
7:11
Introduction to Permutations

Factorial

A factorial, denoted as 'n!', is the product of all positive integers up to 'n'. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. Factorials are fundamental in combinatorics, particularly in calculating permutations and combinations, as they provide a way to quantify the total arrangements of a set of items.
Recommended video:
5:22
Factorials

Combination vs. Permutation

The distinction between combinations and permutations is essential in combinatorial mathematics. While permutations consider the order of selection (e.g., ABC is different from ACB), combinations focus solely on the selection itself, disregarding order (e.g., ABC is the same as ACB). Understanding this difference is vital when determining which formula to apply in problems involving arrangements.
Recommended video:
3:18
Permutations vs. Combinations