Factorial Examples: 41 Problems with Answers

Worked examples of Factorial to try before you open each solution, then practice problems with answers.

Worked Examples

Example 1

easy
Compute 7!.
Show solution

Answer

7!=5040

First step

1.
Recall the factorial definition: n!=n×(n−1)×⋯×2×1. Write out 7!: 7!=7×6×5×4×3×2×1

Full solution

  1. 2.
    Multiply step by step: 7×6=42, then 42×5=210, then 210×4=840, then 840×3=2520.
  2. 3.
    Complete the product: 2520×2=5040, so 7!=5040.
The factorial n! is the product of all positive integers from 1 to n. By convention, 0!=1. Factorials grow extremely fast.

Example 2

medium
Simplify 10!8!.

Example 3

medium
Simplify (n+1)!(n−1)!.

Example 4

medium
Compute (83) using factorials.

Example 5

medium
Simplify n!⋅(n+1)(n+1)!.

Example 6

hard
Compute the number of trailing zeros in 25!.

Example 7

hard
Compute the largest power of 2 that divides 10!.

Example 8

hard
How many distinct arrangements of the letters in 'MATHEMATICS' (11 letters) exist?

Example 9

challenge
Find the number of trailing zeros in 100!.

Practice Problems

Try each one, then open the solution to compare your method.

Example 1

easy
Evaluate 6!4!⋅2!.

Example 2

medium
Solve for n: n!(n−2)!=30.

Example 3

easy
Compute 4!.

Example 4

easy
Compute 0!.

Example 5

easy
Compute 6!5!.

Example 6

easy
Compute 1!.

Example 7

easy
Compute 3!+2!.

Example 8

easy
Compute 5!.

Example 9

easy
How many ways can 4 distinct people line up?

Example 10

easy
Compute 7!7!.

Example 11

medium
Compute 8!6! 2!.

Example 12

medium
Solve for n: n!(n−2)!=20.

Example 13

medium
Compute 10!8!.

Example 14

medium
How many trailing zeros does 10! have?

Example 15

medium
Compute 9!3! 6!.

Example 16

medium
Express 7×6×5 as a ratio of factorials.

Example 17

medium
Simplify (n+1)!n!.

Example 18

medium
Compute 6!2! 2! 2!.

Example 19

medium
Compute 9!7!.

Example 20

challenge
Show that n!=n×(n−1)! and use it to compute 5! from 4!=24.

Example 21

challenge
For how many positive integers n is n! divisible by 100? Find the smallest such n.

Example 22

challenge
Simplify (n+2)!n! to a polynomial in n.

Example 23

easy
Compute 6!.

Example 24

easy
How many distinct ways can 5 different books be arranged on a shelf?

Example 25

easy
Compute 5!3!2!.

Example 26

easy
In how many ways can 3 distinct friends sit in 3 chairs in a row?

Example 27

medium
Solve for n: n!=120.

Example 28

medium
How many distinct arrangements of the letters in the word 'BOOK' are there?

Example 29

medium
How many distinct 7-letter arrangements exist for the letters in 'MISSING'?

Example 30

hard
Solve for n in (n2)=45.

Example 31

hard
In a class of 30, how many ways can a committee of 4 be chosen?

Example 32

hard
Solve for n: (n+1)!=42⋅(n−1)!.

What to focus on

Core idea: n! is the product of every whole number from n down to 1, and it counts how many ways to arrange n things in a row.

Common stuck point: The procedure for factorial is the easy part; the trap is setting 0!=0. Asking "Am I counting the ways to arrange all n distinct items, multiplying n down to 1?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

Ask yourself: Am I counting the ways to arrange all n distinct items, multiplying n down to 1?

Concept recap

The factorial of a non-negative integer n, written n!, is the product of all positive integers from 1 to n: n!=n⋅(n−1)⋯2⋅1.

A factorial counts down a shrinking menu. Hand out n different chocolates to n friends, one each: the first friend picks from all n, the next from n−1, and the last friend gets the one that remains. Multiply those menu sizes and you have n!, the number of ways the chocolates can be shared out.

Read the full lesson on Factorial

Background knowledge

These ideas may be useful before you work through the harder examples.

multiplication