Questions
3–5 questions per paper
Difficulty
Medium-Hard
Importance
Critical for JEE Main/Advanced and high-level aptitude sections
Overview
Permutations and Combinations form the mathematical bedrock of counting, probability, and discrete structures in competitive exams. Mastery of this topic is essential for JEE and competitive aspirants to tackle complex arrangement and selection problems systematically. The core focus is distinguishing between order-dependent tasks and order-independent groupings.
Fundamental Counting Principle
The FCP is the foundational tool for multi-stage processes where each stage has a finite number of choices. It dictates that if one task can be done in 'm' ways and another in 'n' ways, the total sequence is m x n.
- Multiplication principle for independent sequential events
- Addition principle for mutually exclusive cases
- Essential for forming numbers and password lock problems
Permutations (Arrangements)
Permutations deal with ordered sequences where the position of every element matters. The formula accounts for total items 'n' and selected items 'r' while handling repetitions through division.
- nPr = n! / (n-r)!
- Permutations of n items with identical objects: n! / (p!q!r!)
- Restricted permutation: items kept together or separated using the gap method
Combinations (Selections)
Combinations focus on selection without regard to order, forming the basis for geometry and committee-selection problems. These problems often require breaking the total set into specific sub-groups.
- nCr = n! / (r!(n-r)!)
- nCr = nC(n-r) property is key for simplifying large calculations
- Selection of at least one object: 2^n - 1
- Committee formation with constraints on genders or categories
Circular Arrangements
Circular permutations differ from linear ones due to rotational symmetry, effectively reducing the number of positions by one. These are frequently tested in the context of necklace arrangements or seating people around a table.
- Arrangement in a circle: (n-1)!
- Necklace/Garland arrangement: (n-1)! / 2 (due to clockwise/anticlockwise equivalence)
- Fixed-point condition when relative positions matter
Formula Sheet
nPr = n! / (n-r)!
nCr = n! / (r!(n-r)!)
Total arrangements = n! / (p!q!r!)
Circular arrangement = (n-1)!
Exam Tip
Always define your 'cases' first; if the problem sounds like a mix of 'AND' and 'OR', explicitly branch the logic into disjoint scenarios before calculating each piece.
Common Mistakes
- Confusing the Multiplication and Addition principles when defining mutually exclusive vs. sequential cases.
- Neglecting to divide by factorials of repeated items in word-arrangement problems.
- Failing to account for clockwise and anticlockwise orientations in circular arrangement problems involving non-symmetric objects.
More Revision Notes
Ready to test yourself?
Play topic-wise Permutations & Combinations questions in Aspirant Arcade — gamified MCQ practice.
Download Free