Skip to content
Easy

Factorial Notation

Simple Explanation

The factorial of a positive integer n, written n!, is the product of every positive integer up to n: n! = nΓ—(nβˆ’1)Γ—(nβˆ’2)Γ—...Γ—2Γ—1. By definition, 0! = 1.

Why Do We Need It?

Factorials show up constantly throughout this chapter β€” they count the number of ways to fully arrange a set of distinct objects, and they are the building block of every permutation and combination formula.

Formula

Factorial Notation

n! = n Γ— (nβˆ’1) Γ— (nβˆ’2) Γ— ... Γ— 2 Γ— 1, with 0! = 1 by definition

The factorial of a positive integer n is the product of every positive integer up to n β€” it counts the number of ways to arrange n distinct objects in a row.

n
β€” a non-negative integer

When to use it: Whenever the number of full arrangements of a set of distinct objects is needed, or as a building block in permutation and combination formulas.

Worked Example

Evaluate a factorial

Evaluate 6!.

    Why Does This Work?

    n! directly counts the number of ways to arrange n distinct objects in a row: there are n choices for the first position, nβˆ’1 remaining choices for the second, nβˆ’2 for the third, and so on β€” multiplying these choices together (by the Fundamental Counting Principle) gives exactly n!.

    Real-Life Example

    Counting delivery route orders

    A delivery driver has 6 different stops to make and wants to know how many different orders they could visit them in.

    6! gives this count directly β€” a genuinely large number (720) that quickly grows even larger as more stops are added.

    Practice

    Evaluate 5! / 3!.

    Easy

    Common mistake

    Forgetting that 0! is defined to equal 1 (not 0) β€” this special case comes up often in the permutation and combination formulas later in this chapter.

    Quick Review

    • n! = nΓ—(nβˆ’1)Γ—...Γ—2Γ—1.
    • 0! = 1, by definition.
    • n! counts the number of ways to arrange n distinct objects in a row.