Permutations and Combinations form the backbone of counting techniques in Class 11 Mathematics. The uploaded PDF is designed as a complete learning resource under the updated NCERT syllabus and is useful for CBSE and JEE aspirants. It begins with the idea of elementary combinatorics and gradually moves through the fundamental principles of counting, permutations, combinations, circular permutations, distributions, and advanced applications like derangements and inclusion–exclusion. The material is supported by solved illustrations, exercises, and proficiency tests to strengthen understanding.

I decided to write about this topic because students often feel overwhelmed by the large number of formulas in Permutations and Combinations. However, once the logic behind counting is understood, this chapter becomes one of the most scoring areas in algebra. This article presents the core ideas from the PDF in a simple, structured, and exam-focused way so that learners can revise confidently and apply concepts correctly in problem-solving.

Introduction to Combinatorics

Combinatorics is a branch of mathematics that deals with counting the number of ways in which objects can be arranged or selected without actually listing them. The chapter starts by explaining that instead of physically counting each possibility, we use mathematical principles to determine results quickly and accurately.

For example, if a room has 5 rows and each row has 7 chairs, the total number of chairs is obtained by multiplication:
5 × 7 = 35

This idea leads directly to the fundamental principles of counting.

Fundamental Principle of Counting

There are two basic rules:

Multiplication Principle

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 ways.

Example from the PDF:
Finding three-digit numbers where all digits are distinct, odd, and the number is a multiple of 5.
Only 5 can be in the units place, then remaining odd digits fill tens and hundreds places.
Total ways = 1 × 4 × 3 = 12

Addition Principle

If one task can be done in m ways and another task in n ways, then either of the tasks can be done in m + n ways.

These two principles form the base of almost every problem in this chapter.

What Are Permutations?

A permutation is an arrangement of objects where order matters.

Example:
Arranging letters A, B, C
ABC and CBA are different permutations.

Formula for Permutations

Number of permutations of n different objects taken r at a time:

nPr = n(n − 1)(n − 2)…(n − r + 1)
nPr = n! / (n − r)!

Special cases:

• nP0 = 1
• nP1 = n
• nPn = n!

Important Results on Permutations

Some useful cases discussed in the PDF:

• If one particular object must always be included:
  (n − 1)P(r − 1)
• If one particular object is never included:
  (n − 1)Pr
• If repetition is allowed:
  Number of permutations = n^r

Permutations When All Objects Are Not Distinct

If among n objects, p are alike of one kind, q alike of another kind, r alike of a third kind:

Number of permutations = n! / (p! q! r!)

Example:
Arrangements using letters of the word MATHEMATICS considering repeated letters.

Download this MATHS 11 – PERMUTATIONS _ COMBINATIONS PDF File: Click Here

Circular Permutations

When objects are arranged in a circle:

• If clockwise and anticlockwise arrangements are considered different:
  (n − 1)!
• If they are considered the same (necklaces, garlands):
  (n − 1)! / 2

Example from the PDF:
If 20 persons sit around a round table, total arrangements = 19!

What Are Combinations?

A combination is a selection of objects where order does not matter.

Example:
Selecting 2 students out of A, B, C
AB and BA represent the same combination.

Formula for Combinations

nCr = n! / [r!(n − r)!]

Important properties:

• nC0 = nCn = 1
• nCr = nC(n − r)
• Greatest value of nCr occurs at r = n/2 (if n is even)

Important Results on Combinations

• If one object must always be included:
  (n − 1)C(r − 1)
• If one object must be excluded:
  (n − 1)Cr

Selection from Identical Objects

If there are a1 identical objects of one type, a2 of another type, and so on:

Number of ways of selecting at least one object
= (a1 + 1)(a2 + 1)… − 1

Example from PDF:
5 oranges, 4 mangoes, 3 bananas
Selections with at least one fruit = (6)(5)(4) − 1 = 119

Distribution of Identical Objects

Number of ways to distribute n identical objects among r persons:

• When empty groups are allowed:
  (n + r − 1)C(r − 1)
• When each person gets at least one:
  (n − 1)C(r − 1)

Derangements

A derangement is an arrangement where no object is in its original position.

Number of derangements of n objects:

Dn = n! [1 − 1/1! + 1/2! − 1/3! + …]

Example:
Placing letters into wrong envelopes.

Methods of Inclusion and Exclusion

Used to count outcomes when conditions overlap.

Basic idea:

Total = Sum of individual cases
− Sum of pairwise overlaps

• Sum of triple overlaps
  − …

This method is especially useful in advanced counting problems.

Why This Chapter Is Important for Exams

• High weightage in CBSE and competitive exams
• Many MCQs are formula-based
• Builds foundation for probability and advanced algebra