Course contentsShow
← Mathematics
Lesson 2581 of 3,12152. CombinatoricsFree lesson

Computing Permutation Values

Practice calculating P(n,r) for various values and simplifying factorial expressions.

Computing Permutation Values

What you'll learn: You'll practice calculating exact permutation values using the formula P(n,r) and simplify factorial expressions efficiently.

The Core Idea

Now that you understand the permutation formula P(n,r) = n!/(n-r)!, it's time to build computational fluency. Computing permutation values involves substituting specific numbers into this formula and simplifying—often by canceling factorial terms strategically rather than computing massive factorials separately.

Smart Simplification Strategy

Instead of calculating full factorials independently, expand just enough to cancel:

Example 1: Find P(7,3)

Rather than computing 7! = 5040 and 4! = 24 separately:

P(7,3) = 7!/(7-3)! = 7!/4!
       = (7 × 6 × 5 × 4!)/4!
       = 7 × 6 × 5
       = 210

Notice we only multiplied 3 factors—exactly r terms starting from n and counting down.

Example 2: Find P(10,2)

P(10,2) = 10!/8!
        = (10 × 9 × 8!)/8!
        = 10 × 9
        = 90

Example 3: Simplify P(n,n)

P(n,n) = n!/(n-n)! = n!/0! = n!/1 = n!

This confirms that arranging all n objects uses all n! permutations.

Pattern Recognition

For P(n,r), you're essentially computing n(n-1)(n-2)···(n-r+1)—exactly r consecutive descending integers starting at n.

Think of it like filling r positions: n choices for first position, (n-1) for second, and so on for r slots total.

Key Takeaway: Computing permutations efficiently means expanding factorials minimally—write out just enough terms to cancel the denominator, then multiply what remains. This keeps calculations manageable and prevents computational overflow with large numbers.