Class 11 Math: Permutations and Combinations Quick Revision Chapter Summary

Need to review the entire chapter before a test? This quick revision guide summarizes all the core concepts, topics, and equations taught in Class 11 Permutations and Combinations to help you refresh your memory instantly.

Core Topics At a Glance

### 📌 Fundamental principle of counting 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).

### 📌 Factorial notation 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.

### 📌 Permutations formula nPr 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.

### 📌 Combinations formula nCr 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.

### 📌 Simple applications 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).

Key Formulas Mind Map

• Permutations nPr: `^nP_r = \frac{n!}{(n-r)!}` - Arrangements of n items taken r at a time....
• Combinations nCr: `^nC_r = \frac{n!}{r!(n-r)!}` - Selections of n items taken r at a time....

Revision Checklist

1. Review the subtopic guides and outline notes.
2. Practice writing the key formulas from memory.
3. Solve at least 3 worked examples and check your steps.
4. Take a timed practice quiz to verify your speed.