From Fundamentals to Permutations

Introduction

Permutations and Combinations form the foundation of counting in mathematics. They help us answer questions like:

• How many ways can we arrange objects?
• How many selections are possible?

Before moving to advanced concepts, it is essential to build a strong understanding of the fundamentals.

1. Fundamental Principles of Counting

These are the building blocks of all counting problems.

1.1 Fundamental Principle of Counting

If one task can be done in m ways and another task can be done in n ways, then both tasks together can be done in:

m × n

This is also known as the multiplication principle.

1.2 Multiplication Rule

When events occur one after another (sequentially), we multiply the number of choices.

Example:
You have:

• 3 shirts
• 2 pants

Total number of outfits = 3 × 2 = 6

1.3 Addition Rule

When choices are mutually exclusive (either/or situation), we add the number of ways.

Example:
You can travel:

• by bus in 4 ways
• or by train in 3 ways

Total ways = 4 + 3 = 7

Key Difference

• Use multiplication when tasks happen together
• Use addition when there is a choice between options

2. Factorial Notation

2.1 Definition

Factorial of a number n is defined as:

n! = n × (n − 1) × (n − 2) × … × 1

Examples:
5! = 120
4! = 24

Special Case

0! = 1

This is important in many formulas and simplifications.

2.2 Properties of Factorial

• n! = n × (n − 1)!
• n! / (n − 1)! = n

2.3 Simplification Using Factorials

Example:
6! / 4! = (6 × 5 × 4!) / 4! = 6 × 5 = 30

Always expand only as much as needed and cancel common terms.

3. Permutations

3.1 What is a Permutation?

A permutation is an arrangement of objects where order matters.

3.2 Formula for Permutations

P(n, r) = n! / (n − r)!

3.3 Permutations of Distinct Objects

Example:
Arrange 3 letters from A, B, C, D

P(4, 3) = 4! / 1! = 24

Since order matters, ABC and BAC are considered different.

3.4 Permutations when All Objects are Used

If all n objects are arranged:

Total arrangements = n!

Example:
Arrange A, B, C

3! = 6

Arrangements:
ABC, ACB, BAC, BCA, CAB, CBA

3.5 Permutations with Repetition Allowed

Each position can be filled independently.

Total arrangements = n^r

Example:
Form 3-digit numbers using digits {1, 2, 3}

Total numbers = 3^3 = 27

Repetition is allowed, so numbers like 111 and 222 are valid.

3.6 Circular Permutations

In circular arrangements, rotations are considered the same.

Total arrangements = (n − 1)!

Example:
Arrange 4 people around a table

(4 − 1)! = 3! = 6

3.7 Permutations with Identical Objects

When some objects are identical, we divide by factorial of repetitions.

Total arrangements = n! / (p! q! r!)

Example:
Arrange letters of AAB

3! / 2! = 3

Arrangements:
AAB, ABA, BAA

Summary

• Counting principles form the base of all problems
• Factorials simplify complex calculations
• Permutations deal with arrangements where order matters
• Different cases include distinct objects, repetition, circular arrangements, and identical objects

Final Insight

Most errors in permutations occur due to:

• ignoring whether order matters
• misunderstanding repetition
• improper factorial simplification

Recommendation

To understand the concept in depth, learn it from the Math By Series – Permutations and Combinations Book, available on Amazon. You can also explore a wide range of books under the Math By Rishabh Series and Mathematics Elevate Series for structured learning and advanced problem-solving.