Class XI Mathematics

Chapter 6: Permutations and Combinations

Standard NCERT & CBSE aligned study curriculum. Master concepts, track accuracy, revise weak areas, and challenge yourself with 9 customized practice modes.

Chapter Overview

Welcome to Class XI Mathematics: Permutations and Combinations. This chapter forms a core structural component of the math syllabus, designed to build analytical rigor and key formula models.

Use the detailed subtopic guide below to review standard definitions, key mathematical rules, and study guidelines.

Prerequisite Concepts

Whole NumbersFactorisation

Detailed Subtopics Study Guide

Review detailed conceptual explanations, mathematical equations, and guidelines for each subtopic in this chapter:

1Fundamental principle of counting

Concept Explanation

The fundamental principle of counting states that if one event can occur in 'm' ways, and a second event can occur in 'n' ways, then the two events in succession can occur in m x n ways (Multiplication Principle) or m + n ways if they are mutually exclusive (Addition Principle).

Mathematical Representation
\text{Total Ways} = m \times n \, (\text{AND}), \quad \text{Total Ways} = m + n \, (\text{OR})
Study Guideline: Use multiplication when events are dependent or sequential ('and'); use addition when events are mutually exclusive alternatives ('or').

2Factorial notation

Concept Explanation

For a positive integer n, factorial (n!) is the product of all positive integers less than or equal to n. By definition, 0! is equal to 1.

Mathematical Representation
n! = n \cdot (n-1) \cdot (n-2) \cdots 3 \cdot 2 \cdot 1, \quad 0! = 1
Study Guideline: Simplify factorials in fractions by expanding the larger factorial until it matches the smaller one, then canceling (e.g., 8!/6! = 8 * 7 * 6! / 6! = 56).

3Permutations formula nPr

Concept Explanation

A permutation is an ordered arrangement of a set of objects. The number of permutations of n distinct objects taken r at a time is denoted as nPr.

Mathematical Representation
^nP_r = \frac{n!}{(n-r)!} \quad \text{where } 0 \le r \le n
Study Guideline: Use permutations when the order of arrangement is important (e.g., forming words, codes, or seating arrangements).

4Combinations formula nCr

Concept Explanation

A combination is a selection of objects where the order does not matter. The number of combinations of n distinct objects taken r at a time is denoted as nCr.

Mathematical Representation
^nC_r = \frac{n!}{r!(n-r)!} \quad \text{where } 0 \le r \le n
Study Guideline: Use combinations when selecting groups where order does not matter (e.g., selecting teams, hands of cards, or sub-committees).

5Simple applications

Concept Explanation

Practical applications of permutations and combinations include finding the number of diagonals in a polygon, the number of handshakes in a room, or word arrangements under specific constraints (e.g., vowels together).

Mathematical Representation
\text{Diagonals of n-gon} = \binom{n}{2} - n, \quad \text{Handshakes of n people} = \binom{n}{2}
Study Guideline: For word arrangements with vowels together, bundle the vowels into a single 'mega-letter' to find permutations, then multiply by the internal permutations of the vowels.