CBSETUTOR.aiCBSETUTOR.ai
India's #1 AI Tutortopic article · Mathematics

Permutations and Combinations for Class 11: The Complete CBSE Guide (2026-27)

Every Class 11 CBSE mathematics student encounters Permutations and Combinations as Chapter 7 in the NCERT textbook — a chapter that shifts gears from algebra and trigonometry into the elegant world of counting. Whether you are calculating how many 4-digit PINs exist without repetition, how many ways five friends can sit in a row, or how many 3-member committees can be formed from ten volunteers, permutations and combinations class 11 provides the systematic toolkit. The chapter builds on the Fundamental Principle of Counting, introduces factorial notation (n!), and differentiates sharply between permutations (where order matters) and combinations (where order does not). Mastering these concepts is non-negotiable: they underpin probability in Class 12, appear in competitive exams like JEE and board practical applications in computer science, cryptography and operations research.

Your child's private AI tutor — trained on NCERT.
3-day free trial · ₹1 to start · Cancel anytime.
Start 3-day free trial →

Key takeaways

  • ✓Permutations and Combinations Class 11 (NCERT Chapter 7) carries 8–10 marks in the CBSE annual exam, with questions testing fundamental principle, nPr, nCr and word problems.
  • ✓The Fundamental Principle of Counting states: if task A can be done in m ways and task B in n ways, both together can be done in m×n ways (multiplication rule) or either in m+n ways (addition rule).
  • ✓Permutation (nPr) counts ordered arrangements: nPr = n!/(n-r)! — use when the sequence matters, such as podium finishes or password digits.
  • ✓Combination (nCr) counts unordered selections: nCr = n!/[r!(n-r)!] — use when sequence is irrelevant, such as choosing committee members or pizza toppings.
  • ✓Circular permutations of n distinct objects are (n-1)! because one position is fixed to eliminate rotational duplicates; for identical items, divide by the factorial of repetitions.
  • ✓Common errors include applying nPr when the problem requires nCr, neglecting constraints (e.g. 'two specific people must sit together'), and miscalculating factorial terms for large n.
  • ✓CBSETUTOR.ai's 24×7 AI tutor has ingested every NCERT example from Permutations and Combinations Class 11, instantly solves uploaded worksheet photos, and costs ₹999/month for Classes 6–12 with a 3-day free trial.

Why Permutations and Combinations Class 11 Matters in CBSE Mathematics

In the CBSE Class 11 syllabus for 2026-27, Permutations and Combinations sits within Unit IV (combinatorics and mathematical reasoning) and typically accounts for 8–10 marks in the annual examination. Questions range from 2-mark direct formula applications to 4-mark word problems requiring multi-step reasoning. Beyond board exams, this chapter is foundational for Class 12 Probability (calculating favourable outcomes over total outcomes), and for JEE Mains, where combinatorics problems regularly appear in the mathematics section. Real-world applications include: scheduling tournaments (round-robin vs knockout), designing error-detecting codes in data transmission, optimising resource allocation in operations research, and even analysing genomic sequences in bioinformatics. Students who build a strong intuition here find advanced topics — binomial theorem expansions, graph theory, discrete mathematics in computer science — far more accessible. The chapter also sharpens logical thinking: deciding whether a problem is a permutation or combination question, identifying constraints (like 'no two vowels together'), and breaking complex scenarios into simpler sub-tasks using the fundamental principle.
  • 8–10 marks weightage in CBSE Class 11 annual exam (typically one 2-mark, one 4-mark, and two 1-mark questions in Unit IV).
  • Foundation for Class 12 Probability chapter, where nCr is used to compute sample spaces and event probabilities.
  • Direct relevance to JEE Mains Paper 1 (mathematics) and BITSAT; 2–3 questions per year on permutations, combinations or binomial expansion.
  • Real applications: seating arrangements at events, team selection in sports, cryptographic key generation, DNA sequence analysis.
  • Develops critical problem-solving skills: constraint handling, case-by-case enumeration, and recognising symmetry in counting.

NCERT Chapter Structure and Syllabus Outline for Permutations and Combinations Class 11

The NCERT Class 11 Mathematics textbook (latest edition for 2026-27) organises Permutations and Combinations into well-defined sections. Section 7.1 introduces the Fundamental Principle of Counting with simple illustrations (choosing an outfit from 3 shirts and 4 trousers yields 3×4=12 combinations). Section 7.2 defines permutations, derives the formula nPr = n!/(n-r)!, and includes solved examples on arranging books on a shelf or forming 3-letter words from a set of letters. Section 7.3 covers permutations with repetition and circular permutations, explaining why n distinct objects around a circle have (n-1)! arrangements. Section 7.4 introduces combinations, derives nCr = n!/[r!(n-r)!], and proves nCr = nC(n-r). Section 7.5 presents miscellaneous exercises blending permutations and combinations in word problems — committee formation, distributing prizes, selecting teams with constraints. Each section contains solved examples (typically 3–4 per section) and an exercise set. The chapter concludes with a Miscellaneous Exercise of 10–12 challenging problems that often appear as board exam long-answer questions. The CBSE marking scheme awards 1 mark for formula recall, 2 marks for straightforward application, and 4 marks for multi-concept problems requiring logical breakdown and arithmetic accuracy.
  • Section 7.1 – Fundamental Principle of Counting (multiplication rule, addition rule, introductory examples).
  • Section 7.2 – Permutations: definition, factorial notation, derivation of nPr, solved examples on linear arrangements.
  • Section 7.3 – Permutations of identical objects, circular permutations (derivation of (n-1)!), permutations with restrictions.
  • Section 7.4 – Combinations: definition, derivation of nCr, properties (nCr = nC(n-r), Pascal's identity), selection problems.
  • Section 7.5 – Miscellaneous exercises integrating permutations and combinations with real-world constraints.

The Fundamental Principle of Counting: Multiplication and Addition Rules

The Fundamental Principle of Counting is the bedrock of permutations and combinations class 11. It has two parts. The multiplication rule states: if one event can occur in m ways and a second independent event can occur in n ways, then both events together can occur in m×n ways. For example, if you have 3 shirts and 4 pairs of trousers, you can create 3×4=12 outfits. This extends to more events: choosing a 3-course meal (5 starters, 7 mains, 4 desserts) gives 5×7×4=140 combinations. The addition rule states: if event A can happen in m ways and event B (mutually exclusive to A) can happen in n ways, then either A or B can happen in m+n ways. For instance, travelling from Delhi to Mumbai by 8 flights or 5 trains offers 8+5=13 options. NCERT Section 7.1 provides numerical examples: forming two-digit numbers from the set {1,2,3,4,5} without repetition uses the multiplication rule (5 choices for tens digit × 4 for units = 20 numbers). Understanding when to multiply versus add is critical: multiply when tasks are sequential (and/both), add when tasks are alternatives (or). Misapplying these rules is a common error — students sometimes add when they should multiply, leading to incorrect counts.
  • Multiplication rule: sequential/independent events → multiply the number of ways (m × n × p ×...).
  • Addition rule: mutually exclusive alternatives → add the number of ways (m + n).
  • Example (NCERT): Two-digit numbers from {1,2,3,4,5} without repetition = 5×4 = 20.
  • Example: Choosing 1 sweet from 6 chocolates or 4 toffees = 6+4 = 10 ways (addition).
  • Common mistake: using addition when events are sequential (e.g. outfit selection) instead of multiplication.

Factorial Notation and Its Properties in Permutations and Combinations Class 11

Factorial notation, denoted n!, is essential shorthand in permutations and combinations class 11. By definition, n! = n × (n-1) × (n-2) ×... × 2 × 1 for any positive integer n, and 0! is defined as 1 by convention (to ensure formulas like nCn = n!/(n!×0!) = 1 work correctly). For example, 5! = 5×4×3×2×1 = 120, and 10! = 3,628,800. Factorials grow extremely rapidly, which is why large permutation and combination counts become astronomical. Key properties: (i) n! = n × (n-1)!, allowing recursive computation. (ii) n!/r! = n × (n-1) ×... × (r+1), the product of r consecutive descending integers starting from n (this is the numerator in nPr). (iii) Simplification trick: when computing ratios like 10!/7!, cancel common terms: 10!/7! = 10×9×8. Students often make arithmetic errors with factorials, especially forgetting that 0!=1 or misapplying factorial in division (e.g. writing (n-r)! incorrectly). NCERT introduces factorial in Section 7.2 immediately before deriving the permutation formula, with a worked example showing 7P3 = 7!/(7-3)! = 7!/4! = 7×6×5 = 210.
  • Definition: n! = n×(n-1)×(n-2)×...×1; 0! = 1 by convention.
  • Examples: 3! = 6, 4! = 24, 5! = 120, 6! = 720, 7! = 5,040, 10! = 3,628,800.
  • Recursive property: n! = n×(n-1)! — useful for induction proofs and programming.
  • Simplification: n!/r! = n×(n-1)×...×(r+1); cancel common factorial terms in fractions.
  • NCERT example: 7P3 = 7!/(7-3)! = 7!/4! = 7×6×5 = 210 (arranging 3 objects from 7).

Permutations (nPr): Counting Ordered Arrangements

A permutation is an arrangement of objects in a definite order. The number of permutations of r objects chosen from n distinct objects is denoted nPr and given by the formula nPr = n!/(n-r)!. The derivation (NCERT Section 7.2): for the first position we have n choices, for the second (n-1) choices, and so on, until the r-th position has (n-r+1) choices; multiplying gives n×(n-1)×...×(n-r+1) = n!/(n-r)!. For example, arranging 3 books from a shelf of 5 is 5P3 = 5!/(5-3)! = 5!/2! = 60. When r=n (arranging all n objects), nPn = n!/0! = n!; the number of ways to arrange 5 distinct books is 5! = 120. Permutations are used when order matters: race podium finishes (gold/silver/bronze are distinct positions), forming passwords or PINs (1234 ≠ 4321), seating guests in numbered chairs, or the batting order in cricket. A critical skill is recognising permutation problems: look for keywords like 'arrange', 'order', 'sequence', 'rank', 'schedule'. The NCERT textbook includes solved examples such as 'How many 4-letter words (with or without meaning) can be formed from the letters of the word EQUATION, using each letter at most once?' — answer 8P4 = 8×7×6×5 = 1,680.
  • Formula: nPr = n!/(n-r)! (number of ways to arrange r objects from n distinct objects).
  • Special case: nPn = n! (arranging all n objects).
  • Use permutations when order matters: seating arrangements, race rankings, password generation.
  • NCERT example: Form 3-letter words from 'EQUATION' → 8P3 = 8×7×6 = 336.
  • Common error: confusing nPr with nCr; remember P for 'position/order', C for 'choice/selection'.

Permutations with Repetition and Identical Objects

When some objects are identical, the standard nPr formula overcounts because swapping identical objects does not create a new arrangement. The formula for permutations of n objects where p are of one kind, q of another, and so on is n!/(p!×q!×...). For example, the word 'MISSISSIPPI' has 11 letters: M(1), I(4), S(4), P(2). The number of distinct arrangements is 11!/(1!×4!×4!×2!) = 34,650. NCERT Section 7.3 derives this: start with n! permutations of n distinct objects, then divide by p! for the first group of identical items (since permuting them among themselves yields the same word), q! for the second group, and so on. Another common scenario is distributing identical items into distinct boxes. For instance, distributing 7 identical chocolates into 3 distinct boxes with no restrictions is a 'stars and bars' problem (not explicitly in NCERT Class 11, but the principle applies). Students often forget to divide by factorials of repetitions, leading to inflated counts. A worked NCERT example: arrangements of the letters in 'INDIA' (5 letters, I appears twice) = 5!/2! = 60.
  • Formula for n objects with p identical of one type, q of another: n!/(p!×q!×...).
  • Example: Arrangements of 'BOOK' (4 letters, O appears twice) = 4!/2! = 12.
  • NCERT example: Arrangements of 'MISSISSIPPI' = 11!/(1!×4!×4!×2!) = 34,650.
  • Logic: divide by factorials of identical groups to eliminate redundant swaps within those groups.
  • Common mistake: forgetting to divide by repetition factorials, or dividing incorrectly when objects are distinct.

Circular Permutations: Arranging Objects Around a Table

Circular permutations arise when objects are arranged in a circle, where rotations are considered identical. The formula for arranging n distinct objects in a circle is (n-1)!. The derivation (NCERT Section 7.3): fix one object's position to break the rotational symmetry (since there is no 'first' position in a circle), then arrange the remaining (n-1) objects in (n-1)! ways. For example, seating 5 people around a circular table: fix one person's seat, then arrange the other 4 in 4! = 24 ways, so total = 24. If reflections are also considered identical (as in a necklace where flipping it over looks the same), divide further by 2, giving (n-1)!/2. NCERT does not deeply explore reflection symmetry but mentions it. Circular permutations appear in problems like arranging keys on a keyring, people at a round table, beads on a bracelet, or dancers in a circle. A critical error is using n! instead of (n-1)! for circular arrangements. A typical board exam question: 'In how many ways can 6 people sit around a round table?' Answer = (6-1)! = 5! = 120. If two specific people must sit together, treat them as a single unit: arrange (n-1) units in (n-2)! ways, then permute the 2 people within the unit in 2! ways, giving 2!×(n-2)!.
  • Formula: (n-1)! for arranging n distinct objects in a circle.
  • Logic: fix one object to eliminate rotational duplicates, arrange the rest.
  • Example: 5 people around a round table = (5-1)! = 4! = 24 ways.
  • If reflections identical (e.g. bracelet): (n-1)!/2.
  • Constraint problems: two people together → treat as one unit, use (n-1)!×2! logic.

Combinations (nCr): Counting Unordered Selections

A combination is a selection of objects where order does not matter. The number of ways to choose r objects from n distinct objects is denoted nCr (or C(n,r)) and given by nCr = n!/[r!×(n-r)!]. The derivation (NCERT Section 7.4): start with nPr = n!/(n-r)! ordered arrangements, then divide by r! because the r selected objects can be permuted among themselves in r! ways, and all such permutations represent the same selection. For example, selecting 3 students from 10 for a committee: 10C3 = 10!/(3!×7!) = (10×9×8)/(3×2×1) = 120. Combinations are used when order is irrelevant: forming committees, choosing toppings for pizza, selecting cards from a deck, picking team members. Key properties: (i) nCr = nC(n-r) (choosing r objects is equivalent to leaving out (n-r) objects). (ii) nC0 = nCn = 1 (one way to choose nothing or everything). (iii) nC1 = n (choosing one object from n). (iv) Pascal's identity: nCr = (n-1)Cr + (n-1)C(r-1). NCERT includes solved examples like 'From a group of 7 men and 4 women, choose a committee of 3 men and 2 women' — answer = 7C3 × 4C2 = 35×6 = 210. A common error is confusing nCr with nPr: remember C for 'choice/collection', P for 'position/order'.
  • Formula: nCr = n!/[r!×(n-r)!] (number of ways to select r objects from n, order irrelevant).
  • Use combinations when sequence does not matter: team selection, choosing lottery numbers, picking pizza toppings.
  • Properties: nCr = nC(n-r); nC0 = 1; nC1 = n; Pascal's identity nCr = (n-1)Cr + (n-1)C(r-1).
  • NCERT example: Choose 3 books from 5 → 5C3 = 5!/(3!×2!) = 10.
  • Common mistake: using nPr instead of nCr when order is irrelevant, or vice versa.

Distinguishing Between Permutations and Combinations: When to Use Which

The most frequent error in permutations and combinations class 11 is misidentifying whether a problem requires nPr or nCr. The key test: does the order or sequence matter? If yes, use permutation (nPr); if no, use combination (nCr). Consider the question: 'Select 3 students from 10.' If the task is to choose a committee (where Alice, Bob, Charlie is the same group as Charlie, Alice, Bob), use 10C3 = 120. If the task is to assign President, Secretary, Treasurer (where Alice-President, Bob-Secretary is different from Bob-President, Alice-Secretary), use 10P3 = 720. NCERT provides contrasting examples: (a) 'How many 3-digit numbers can be formed from {1,2,3,4,5} without repetition?' → order matters (123 ≠ 321), use 5P3 = 60. (b) 'In how many ways can you choose 3 fruits from a basket of 5 different fruits?' → order irrelevant, use 5C3 = 10. Clue words: 'arrange', 'sequence', 'order', 'rank', 'schedule' suggest permutation; 'select', 'choose', 'committee', 'group', 'team' suggest combination. Practice by verbalising the problem: if swapping two items changes the outcome, it is a permutation. If not, it is a combination. Another litmus test: permutations typically yield larger counts than combinations for the same n and r (since nPr = nCr × r!).
  • Permutation (nPr): order matters — arranging, ranking, sequencing, assigning distinct roles.
  • Combination (nCr): order irrelevant — selecting, grouping, choosing, forming teams/committees.
  • Example contrast: elect 3 class representatives (nCr) vs assign President/VP/Secretary (nPr).
  • Quick test: if swapping two selected items changes the scenario, use nPr; otherwise nCr.
  • NCERT advice: read the problem carefully, identify whether 'arrangement' or 'selection', then apply the correct formula.

Important Formulas and Identities in Permutations and Combinations Class 11

Mastering permutations and combinations class 11 requires fluency with a core set of formulas and identities, all derived and illustrated in NCERT Chapter 7. Below is the definitive list. (1) Factorial: n! = n×(n-1)×...×1; 0! = 1. (2) Permutation: nPr = n!/(n-r)! (arranging r from n). (3) Combination: nCr = n!/[r!×(n-r)!] (selecting r from n). (4) Relation between P and C: nPr = nCr × r! (since permutations = combinations × arrangements within each selection). (5) Symmetry: nCr = nC(n-r). (6) Boundary values: nC0 = nCn = 1, nC1 = n. (7) Pascal's identity: nCr = (n-1)Cr + (n-1)C(r-1). (8) Sum of all combinations: nC0 + nC1 +... + nCn = 2^n (not explicitly in NCERT Class 11 but follows from binomial theorem in Class 11 Chapter 8). (9) Circular permutations: (n-1)! for n distinct objects. (10) Permutations with repetition: n!/(p!×q!×...) for n objects with p identical of one kind, q of another. Students should memorise these formulas but, more importantly, understand their derivations to adapt to variations in exam questions. For instance, if a question asks for nCr + nC(r-1), recognise it as (n+1)Cr by Pascal's identity.
  • nPr = n!/(n-r)! — permutations of r objects from n.
  • nCr = n!/[r!×(n-r)!] — combinations of r objects from n.
  • nPr = nCr × r! — linking permutations and combinations.
  • nCr = nC(n-r) — symmetry property, useful for simplification (e.g. compute 50C48 as 50C2).
  • nC0 = 1, nCn = 1, nC1 = n — boundary cases, often appear in proofs and problem constraints.
  • Pascal's identity: nCr = (n-1)Cr + (n-1)C(r-1) — recursive relation, foundation of Pascal's triangle.
  • Circular permutations: (n-1)! for distinct objects; (n-1)!/2 if reflections identical.
  • Repetitions: n!/(p!q!...) for n objects with p, q,... identical items.

Step-by-Step Solved NCERT Examples from Permutations and Combinations Class 11

NCERT Chapter 7 contains numerous solved examples that form the blueprint for board exam questions. Example 1 (Fundamental Principle): How many 3-digit numbers can be formed from the digits 1,2,3,4,5 if repetition is not allowed and the number must be even? Solution: The units digit must be even (2 or 4) — 2 choices. Once units is fixed, tens digit can be any of the remaining 4 digits (4 choices), and hundreds digit any of the remaining 3 digits (3 choices). By multiplication rule: 2×4×3 = 24 numbers. Example 2 (Permutation): In how many ways can 5 students be arranged in a row? Solution: 5P5 = 5! = 120 ways. Example 3 (Permutation with constraint): How many words (with or without meaning) can be formed using all letters of 'EQUATION' such that vowels always come together? Solution: Treat the 5 vowels (E,U,A,I,O) as a single unit. Now we have 4 units (VOWELS, Q, T, N) to arrange in 4! ways. The vowels themselves can be arranged in 5! ways within the unit. Total = 4!×5! = 24×120 = 2,880. Example 4 (Combination): From 7 men and 4 women, form a committee of 3 men and 2 women. Solution: Choose 3 men from 7: 7C3 = 35; choose 2 women from 4: 4C2 = 6. By multiplication rule (both selections needed): 35×6 = 210 committees. These examples illustrate the NCERT's problem-solving approach: identify the type (permutation or combination), list constraints, apply the appropriate formula, and compute carefully.

Common Mistakes and How to Avoid Them in Permutations and Combinations Class 11

Students lose marks in permutations and combinations class 11 due to recurring errors. (1) Confusing nPr and nCr: always ask 'does order matter?' before choosing the formula. (2) Arithmetic errors in factorial computation: use cancellation to simplify (e.g. 10!/7! = 10×9×8, not computing 10! and 7! separately). (3) Forgetting 0! = 1: this causes mistakes in boundary cases like nCn = n!/(n!×0!) = 1. (4) Miscounting when constraints are present: carefully parse 'and', 'or', 'at least', 'exactly'. For instance, 'at least 2 women' means (2 women + remaining men) OR (3 women + remaining men) OR..., requiring addition of cases. (5) Double-counting in permutation problems with symmetry: e.g. circular arrangements or bracelet/necklace problems. (6) Ignoring the word 'distinct': if objects are identical, use n!/(p!q!...), not n!. (7) Misapplying the fundamental principle: multiplying when you should add, or vice versa. (8) Not reading the question carefully: 'form a word' usually means permutation, 'select a team' usually means combination, but context is king. (9) Units and calculation errors: 6! = 720, not 700; 8C3 = 56, not 58. Practise 50+ NCERT and additional problems to internalise patterns. Show all steps in exams: formula, substitution, simplification, final answer. Partial marks are awarded for correct method even if the arithmetic is wrong.
  • Error: using nPr when problem needs nCr, or vice versa. Fix: identify if order matters before selecting formula.
  • Error: computing large factorials separately instead of cancelling. Fix: simplify n!/r! = n×(n-1)×...×(r+1) directly.
  • Error: forgetting 0! = 1. Fix: memorise this convention; it ensures nCn = 1 and other identities hold.
  • Error: misinterpreting 'at least', 'at most', 'exactly'. Fix: break into cases; use complementary counting when possible.
  • Error: treating distinct and identical objects the same way. Fix: divide by factorials of repetitions when objects are identical.
  • Error: arithmetic mistakes under time pressure. Fix: double-check calculations; use estimation to spot errors (e.g. 10C3 should be <1000).
  • Error: not showing working in board exams. Fix: write formula → substitution → step-by-step simplification → final answer for partial credit.

Tips to Score Full Marks in Permutations and Combinations Class 11 Board Exam

Securing full marks in the permutations and combinations section of the CBSE Class 11 board exam requires a blend of conceptual clarity, formula fluency, and exam strategy. First, solve every NCERT exercise problem — both in-chapter exercises and the Miscellaneous Exercise — at least twice, once without hints and once reviewing the solution. Second, maintain a formula sheet with derivations, not just formulas: understanding why nCr = n!/[r!×(n-r)!] helps you adapt when a question has a twist. Third, practise identifying problem type in under 10 seconds: is it permutation or combination? Are there constraints (repetition, restrictions, grouping)? Fourth, use dimensional analysis as a sanity check: permutations have units of 'arrangements', combinations 'selections'; if your answer for 'select 3 from 10' is 720 (which is 10P3), alarm bells should ring because it should be 10C3 = 120. Fifth, manage time: allocate 4–5 minutes per 2-mark question, 8–10 minutes per 4-mark question. Sixth, show all steps even if trivial: write the formula, substitute values, simplify step-by-step, box the final answer. CBSE markers award 1 mark for correct method even if final answer is wrong. Seventh, double-check boundary cases: if n=r, does your answer equal n!? If r=0, does it equal 1? Eighth, practise previous year CBSE board papers (2019–2024) and sample papers — question patterns repeat. Finally, clarify doubts before the exam: use NCERT exemplar solutions or a reliable tutor (CBSETUTOR.ai's AI can instantly explain any NCERT example or uploaded problem for ₹999/month).
  • Solve all NCERT exercises twice: once independently, once with solutions for self-check.
  • Memorise formulas with derivations, not by rote; understand the 'why' to handle variants.
  • Practise 50+ problems covering fundamental principle, nPr, nCr, circular permutations, constraints.
  • Develop a mental checklist: 'Order matters? → nPr. Order irrelevant? → nCr. Repetitions? → divide by factorials.'
  • Show complete working in exams: formula, substitution, step-by-step simplification, final answer (CBSE awards partial marks).
  • Time management: 2-mark question in ~5 minutes, 4-mark in ~10 minutes; practise under timed conditions.
  • Use previous year board papers (2019–2024) and CBSE sample papers for question pattern familiarity.
  • Verify answers using properties: e.g. nCr = nC(n-r), nC0=1, nPr ≥ nCr (since nPr = nCr × r!).

How CBSETUTOR.ai Helps Master Permutations and Combinations Class 11

Many Class 11 students struggle with permutations and combinations because textbook explanations can feel abstract, and teachers may not have time to address every student's specific confusion — whether it is why we divide by r! in nCr, how to handle complex constraints, or which formula to apply in a word problem. CBSETUTOR.ai solves this with a 24×7 AI tutor that has ingested every page of the NCERT Class 11 Mathematics textbook, including all solved examples, exercises, and miscellaneous problems from Chapter 7. A student can upload a photo of any permutation/combination worksheet question — even handwritten — and receive a step-by-step solution within seconds, explained in simple language with the exact NCERT terminology. The AI identifies whether the problem is nPr or nCr, highlights constraints, shows formula application, and checks the arithmetic. Unlike generic video lectures that you cannot pause to ask questions, CBSETUTOR.ai is interactive: type 'Why do we use (n-1)! for circular permutations?' and get a clear explanation with a diagram analogy. It covers Classes 6–12 (all NCERT subjects), costs a flat ₹999/month with no hidden charges, and offers a 3-day free trial with no credit card required. Parents across Delhi, Mumbai, Bengaluru and smaller towns trust it because it mirrors the CBSE curriculum exactly, adapts to each child's pace, and is available anytime — perfect for last-minute doubt clearing at 11 pm before an exam. For permutations and combinations class 11, the AI can generate practice problems of varying difficulty, provide hints without giving away the answer, and even quiz the student on formula recall and application.
  • 24×7 AI tutor with complete NCERT Class 11 Maths Chapter 7 (Permutations and Combinations) coverage.
  • Upload any worksheet or textbook photo; get instant step-by-step solutions with NCERT-aligned explanations.
  • Interactive Q&A: ask 'Why nCr, not nPr here?' or 'How to solve circular permutation with constraints?' and get immediate answers.
  • Flat ₹999/month for all CBSE classes 6–12, all subjects; 3-day free trial, no credit card needed.
  • Generates custom practice problems, provides hints, tracks progress, and reinforces weak areas.
  • Trusted by parents and students across India for accurate, curriculum-faithful tutoring anytime, anywhere.

Frequently asked questions

What is the weightage of Permutations and Combinations in the CBSE Class 11 final exam?+
Permutations and Combinations (Chapter 7) typically carries 8–10 marks in the CBSE Class 11 annual mathematics exam, spread across Unit IV (combinatorics). Expect one or two short-answer questions (2 marks each) testing direct formula application, one long-answer question (4 marks) involving constraints or mixed permutation-combination logic, and possibly a 1-mark objective question on factorial or nCr properties. The chapter is also foundational for Class 12 Probability, so mastering it now pays dividends next year.
How do I decide whether to use permutation (nPr) or combination (nCr) in a word problem?+
Ask one question: does the order or sequence matter? If yes (e.g. arranging books on a shelf, forming a password, assigning ranks), use permutation nPr = n!/(n-r)!. If no (e.g. selecting a committee, choosing pizza toppings, drawing cards), use combination nCr = n!/[r!×(n-r)!]. Clue words: 'arrange', 'order', 'sequence' → nPr; 'select', 'choose', 'group' → nCr. When in doubt, test with small numbers: choosing 2 people from {A,B,C} for a team gives {AB,AC,BC} (3 combinations); assigning President and VP gives AB, BA, AC, CA, BC, CB (6 permutations).
Why is 0! defined as 1, and why does it matter in permutations and combinations class 11?+
By convention, 0! = 1 to ensure formulas remain consistent. For example, nCn = n!/[n!×(n-r)!] with r=n becomes n!/(n!×0!); if 0! were not 1, this would be undefined instead of the correct answer 1 (there is exactly one way to choose all n objects). Similarly, nP0 = n!/(n-0)! = n!/n! = 1 (one way to arrange zero objects: do nothing). This definition is essential for boundary cases in proofs, Pascal's identity, and binomial expansions in Class 11 Chapter 8.
What is the formula for circular permutations, and when do I use it?+
The formula for arranging n distinct objects in a circle is (n-1)!. Use it when objects are placed around a circular structure (round table, necklace, clock positions) where rotations are considered identical — i.e. there is no fixed 'start' position. The derivation: fix one object to break symmetry (eliminating rotational duplicates), then arrange the remaining (n-1) in (n-1)! ways. Example: seating 6 people at a round table = (6-1)! = 5! = 120. If reflections are also identical (e.g. a bracelet you can flip), divide by 2: (n-1)!/2.
How do I handle permutations of objects when some are identical, like the letters in 'MISSISSIPPI'?+
Use the formula n!/(p!×q!×r!×...) where n is the total number of objects, and p, q, r,... are the counts of each type of identical object. For 'MISSISSIPPI' (11 letters): M(1), I(4), S(4), P(2), so arrangements = 11!/(1!×4!×4!×2!) = 34,650. The logic: start with 11! permutations assuming all letters distinct, then divide by 4! (permutations of the four I's among themselves, which do not create new words), 4! for the S's, and 2! for the P's. NCERT Section 7.3 covers this with the example 'INDIA' (5 letters, I appears twice) = 5!/2! = 60.
What is the relationship between nPr and nCr, and how can I use it to check my answer?+
The relation is nPr = nCr × r!. This makes intuitive sense: nCr counts the number of ways to choose r objects (ignoring order), and for each such selection, there are r! ways to arrange those r objects. So permutations = combinations × arrangements. You can use this as a check: if you compute 10C3 = 120 and 10P3 = 720, verify that 720 = 120×3! = 120×6 ✓. If a question asks for nPr and you accidentally compute nCr, your answer will be smaller by a factor of r!, a red flag.
My child's school uses R.S. Aggarwal or R.D. Sharma alongside NCERT for Class 11 Maths. Will the formulas and concepts differ?+
No, the core formulas (nPr = n!/(n-r)!, nCr = n!/[r!×(n-r)!], circular permutations = (n-1)!) are universal and identical across NCERT, R.S. Aggarwal, R.D. Sharma, and all CBSE reference books. The difference lies in the number and difficulty of practice problems: R.S. Aggarwal and R.D. Sharma include more drill exercises and competition-level problems (useful for JEE preparation), while NCERT focuses on conceptual understanding and board exam patterns. Your child should master NCERT first (all solved examples and exercises) for board exam confidence, then use supplementary books for extra practice. The CBSE board exam strictly follows NCERT terminology and question style.
How many practice problems should my child solve to be confident in Permutations and Combinations Class 11?+
Aim for 50–70 problems covering the full spectrum: fundamental principle (10 problems), permutations nPr (15 problems), circular and repetitions (10 problems), combinations nCr (15 problems), and mixed/constraint problems (10–15 problems). Start with all NCERT in-text solved examples and exercises (approximately 40 problems total), then add NCERT Exemplar (harder variants), previous year CBSE board questions (2019–2024), and CBSE sample papers. Quality over quantity: ensure your child understands why each solution works, not just memorises steps. If a problem is solved incorrectly, revisit the concept, rework it, and try a similar problem to confirm mastery.
What are the most common errors students make in permutations and combinations, and how can we avoid them?+
Top errors: (1) Confusing nPr and nCr — avoid by always asking 'does order matter?'. (2) Arithmetic mistakes in factorial simplification — avoid by cancelling terms (e.g. 12!/9! = 12×11×10) instead of computing 12! and 9! separately. (3) Forgetting 0!=1 — memorise this and understand its role in boundary cases. (4) Misreading constraints like 'at least 2' or 'vowels together' — avoid by underlining key phrases and breaking the problem into cases. (5) Not showing working — avoid by writing formula, substitution, steps, answer in exams (partial marks awarded). Practise under timed conditions, double-check boundary cases, and use the relation nPr = nCr×r! as a sanity check.
Is the Binomial Theorem related to Permutations and Combinations, and will it appear in the same exam section?+
Yes, the Binomial Theorem (NCERT Class 11 Chapter 8) is closely related: the coefficients in the expansion of (a+b)^n are given by nC0, nC1, nC2,..., nCn. Both chapters fall under Unit IV (combinatorics) in CBSE and together may carry 12–15 marks. While they are tested separately, understanding nCr deeply (Chapter 7) makes Binomial Theorem (Chapter 8) much easier. Some board exam questions blend the two, e.g. 'Find the coefficient of x^5 in (1+x)^10' (answer: 10C5). Study them in sequence, and review Pascal's identity (nCr = (n-1)Cr + (n-1)C(r-1)), which underpins Pascal's triangle and binomial expansions.
Can CBSETUTOR.ai help if my child is stuck on a specific permutation/combination problem from a worksheet?+
Absolutely. Upload a clear photo of the problem (even handwritten) to CBSETUTOR.ai, and the AI tutor will identify the question type (permutation or combination, constraints present), show the appropriate formula, walk through the solution step-by-step with NCERT-style explanations, and verify the arithmetic. The AI is trained on every NCERT Class 11 Maths chapter, including all Permutations and Combinations examples. You can also ask follow-up questions like 'Why did we divide by 2! here?' or 'What if the problem said vowels must be separated?' It costs ₹999/month for Classes 6–12, all subjects, with a 3-day free trial (no card required), so you can test it risk-free before committing.
Will understanding permutations and combinations class 11 help in competitive exams like JEE Mains or BITSAT?+
Definitely. Permutations and combinations appear in 2–3 questions per year in JEE Mains Paper 1 (mathematics), often at moderate to high difficulty with constraints or combined with probability. BITSAT and state engineering entrance exams also test this topic. The NCERT Class 11 foundation is essential, but JEE questions require faster problem-solving and familiarity with advanced tricks (e.g. stars-and-bars for distributions, inclusion-exclusion principle, derangements). Once you have mastered NCERT Chapter 7, practise JEE previous year questions and coaching module problems. The conceptual clarity you build now — understanding why nCr = nC(n-r), deriving (n-1)! for circles, handling constraints logically — will give you a significant edge in competitive exams.

Related resources

Sets for Class 11: The Complete CBSE Guide (2026-27)Relations and Functions for Class 11: The Complete CBSE Guide (2026-27)Trigonometric Functions for Class 11: The Complete CBSE Guide (2026-27)Complex Numbers and Quadratic Equations for Class 11: The Complete CBSE Guide (2026-27)AI Tutor for Class 11: The Smart Alternative to TuitionAI Tutor for Class 11 Accountancy: Learn Faster with Instant HelpClass 9 Coordinate Geometry Chapter 3: Cartesian System & Plotting PointsNumber Systems for Class 9: The Complete CBSE Guide (2026-27)

Keep learning — related guides

Class 11Mathematics
Probability for Class 11: The Complete CBSE Guide (2026-27)
Class 11Mathematics
Statistics for Class 11: The Complete CBSE Guide (2026-27)
Class 11Mathematics
Straight Lines for Class 11: The Complete CBSE Guide (2026-27)
Class 11Mathematics
Limits and Derivatives for Class 11: The Complete CBSE Guide (2026-27)
Class 11Mathematics
Introduction to Three Dimensional Geometry for Class 11: The Complete CBSE Guide (2026-27)
Class 11Mathematics
Conic Sections for Class 11: The Complete CBSE Guide (2026-27)

Ready to give your Class 11 child the tutor that never sleeps?

CBSETUTOR.ai covers every chapter in the Class 11 NCERT syllabus — Maths, Science, Social Science, English, Hindi and more. 24×7. Patient. Unlimited. 3-day free trial.

Start your child's 3-day free trial →