A Comprehensive Guide to
Permutations
Combinatorics and Discrete Mathematics Study Series
June 30, 2026
Abstract
This guide provides an in-depth analysis of permutations, a fundamental concept in com-
binatorics and probability. It covers the Fundamental Counting Principle, linear permuta-
tions, permutations with repetitions, circular configurations, and practical problem-solving
examples with step-by-step solutions.
Contents
1 Introduction to Permutations 2
1.1 The Fundamental Counting Principle . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Factorial Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2 Core Formulas and Types of Permutations 2
2.1 Linear Permutations (Distinct Objects) . . . . . . . . . . . . . . . . . . . . . . . 2
2.2 Permutations with Repetition (Identical Objects) . . . . . . . . . . . . . . . . . . 2
2.3 Circular Permutations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
3 Worked Examples and Practice Problems 4
3.1 Example 1: Basic Linear Arrangement . . . . . . . . . . . . . . . . . . . . . . . . 4
3.2 Example 2: Arranging Letters with Indistinguishable Elements . . . . . . . . . . 4
3.3 Example 3: Circular Seating Arrangements . . . . . . . . . . . . . . . . . . . . . 4
3.4 Example 4: Permutations with Constraints . . . . . . . . . . . . . . . . . . . . . 4
1
1 Introduction to Permutations
In mathematics, a permutation is an arrangement of all or part of a set of objects with regard
to the order of the arrangement. Unlike combinations, where order does not matter, order is
critical in permutations. For instance, the arrangement ABC is distinct from BAC.
1.1 The Fundamental Counting Principle
The foundational pillar of permutations is the Fundamental Counting Principle. It states
that if one event can occur in m ways and a second independent event can occur in n ways, then
the two events can occur in succession in m × n ways. This generalizes to any finite number of
events.
1.2 Factorial Notation
For any positive integer n, the product of all positive integers less than or equal to n is called
n factorial, denoted as n!:
n! = n × (n − 1) × (n − 2) × · · · × 3 × 2 × 1 (1)
By mathematical convention, to ensure formula consistency:
0! = 1 (2)
2 Core Formulas and Types of Permutations
2.1 Linear Permutations (Distinct Objects)
When selecting and arranging r unique elements from a total pool of n distinct objects without
replacement, the number of unique permutations is denoted by P (n, r) or n Pr , and is given by
the formula:
n!
P (n, r) = (3)
(n − r)!
If all n objects are selected and arranged (r = n), the formula simplifies to:
n! n!
P (n, n) = = = n! (4)
(n − n)! 0!
2.2 Permutations with Repetition (Identical Objects)
If a set consists of n objects where n1 are of one identical type, n2 are of another identical type,
. . . , and nk are of a k-th identical type, the total number of distinct linear permutations is:
n!
Total Permutations = (5)
n1 ! × n2 ! × · · · × nk !
2.3 Circular Permutations
When objects are arranged in a circle rather than a straight line, shifting every object by one
position does not create a new arrangement because their relative positions remain unchanged.
• If the orientation matters (e.g., seating people around a table where left and right neigh-
bors matter):
Circular Permutations = (n − 1)! (6)
2
• If the orientation does not matter (e.g., assembling beads on a necklace where flipping the
necklace over yields the same relative view):
(n − 1)!
Circular Permutations = (7)
2
3
3 Worked Examples and Practice Problems
3.1 Example 1: Basic Linear Arrangement
Problem: In how many ways can a president, a secretary, and a treasurer be chosen from a
club of 12 members, assuming no member can hold more than one office?
Solution: Since the offices are distinct, the order of selection matters. We are finding the
number of permutations of 12 objects taken 3 at a time (n = 12, r = 3).
12! 12!
P (12, 3) = = = 12 × 11 × 10 = 1320 ways
(12 − 3)! 9!
3.2 Example 2: Arranging Letters with Indistinguishable Elements
Problem: Calculate the number of distinct arrangements that can be formed using all the
letters in the word MATHEMATICS.
Solution: First, count the total number of letters, n = 11. Next, identify repeating letters:
• M appears 2 times (n1 = 2)
• A appears 2 times (n2 = 2)
• T appears 2 times (n3 = 2)
• H, E, I, C, S each appear 1 time
Using the formula for identical objects:
11! 39, 916, 800 39, 916, 800
Total arrangements = = = = 4, 989, 600
2! × 2! × 2! 2×2×2 8
3.3 Example 3: Circular Seating Arrangements
Problem: 6 executives are attending a boardroom meeting. In how many different ways can
they be seated around a circular conference table?
Solution: Since this is a circular permutation where left-and-right orientation relative to
the table positions matters, we fix one person to break the rotational symmetry.
Ways = (n − 1)! = (6 − 1)! = 5! = 5 × 4 × 3 × 2 × 1 = 120 ways
3.4 Example 4: Permutations with Constraints
Problem: How many 4-digit numbers can be formed using the digits 0, 1, 2, 3, 4, 5 if repetitions
are not allowed and the number must be even?
Solution: A 4-digit number cannot begin with 0. To be even, it must end in 0, 2, or 4. We
analyze this by breaking it into two mutually exclusive cases:
1. Case 1: The number ends in 0. The units digit is fixed (1 option). The thousands
digit can be any of the remaining 5 digits (1, 2, 3, 4, 5). The remaining 2 positions can
be filled by arranging any 2 of the remaining 4 digits:
WaysCase 1 = 1(for 0) × 5 × P (4, 2) = 5 × (4 × 3) = 60 ways
2. Case 2: The number ends in 2 or 4. The units digit has 2 options. The thousands
digit cannot be 0 and cannot be the digit chosen for the unit place, leaving 4 available
options. The remaining 2 positions are filled by arranging any 2 of the remaining 4 digits
(including 0):
WaysCase 2 = 2(for 2 or 4) × 4(thousands place) × P (4, 2) = 2 × 4 × 12 = 96 ways
4
Summing both cases yields the total valid permutations:
Total even numbers = 60 + 96 = 156