India's #1 AI Tutorformula-sheet · Mathematics · Chapter 6

Class 11 Mathematics Chapter 6 Permutations and Combinations — Formulas & Key Points

CBSE Class 11 Mathematics Chapter 6 Permutations and Combinations is fundamental for probability, binomial expansions and competitive exam sections like JEE and NDA. This chapter introduces systematic counting through the Fundamental Principle, factorial notation, permutations (ordered arrangements) and combinations (unordered selections). Mastery of these formulas is non-negotiable for board exams and higher studies in statistics and discrete mathematics.

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

✓Fundamental Principle of Counting: if one operation can be done in m ways and a second in n ways, together they can be done in m×n ways.
✓Permutations (nPr) count ordered arrangements; combinations (nCr) count selections where order does not matter.
✓Core formula nPr = n!/(n−r)! for r objects from n; nCr = n!/(r!(n−r)!) for choosing r from n.
✓Circular permutations of n distinct objects = (n−1)!; if clockwise and anticlockwise are identical, divide by 2.
✓When items repeat: arrangements of n objects with p identical, q identical, etc. = n!/(p!q!...).
✓nCr = nC(n−r) is a vital symmetry property simplifying many calculations.
✓Distinguish between 'arrangement' (permutation) and 'selection' (combination) carefully in word problems.

Core Formulas for Permutations and Combinations

This table lists every essential formula in NCERT Class 11 Mathematics Chapter 6. Bookmark this section for quick revision during exams. Each formula is paired with its context and typical application scenarios so you know exactly when to deploy it. Permutations deal with arrangements where order matters (e.g. podium finishes, passwords), while combinations handle selections where order is irrelevant (e.g. committee formation, card draws). Understanding the difference is half the battle.

Key Terms and Definitions

Precise terminology is crucial in Permutations and Combinations. The NCERT textbook and CBSE mark schemes use these exact terms, so memorise them verbatim. Factorial is the product of all positive integers up to n; it grows extremely fast. Permutation means arrangement with attention to order; swapping two elements yields a different permutation. Combination means selection without regard to order; {A,B,C} is the same as {C,A,B}. The Fundamental Principle of Counting (also called the Multiplication Principle) states that if operation A can be done in m ways and operation B in n ways, both together can be done in m×n ways. This principle underpins every derivation in the chapter.

Factorial (n!): Product of all positive integers from 1 to n. By convention, 0! = 1.
Permutation: An arrangement of objects in a definite order. Order is significant.
Combination: A selection of objects where order is immaterial. {A,B} = {B,A}.
Fundamental Principle of Counting: If event E1 occurs in m ways and E2 in n ways, both together occur in m×n ways.
Circular Permutation: Arrangement of objects around a circle. One object is fixed to eliminate rotational duplicates.
Restricted Arrangement: Permutation subject to constraints (e.g. certain items always together or never adjacent).

Factorial Notation and Properties

Factorial notation n! is the backbone of all permutation and combination formulas. For any positive integer n, n! = n×(n−1)×(n−2)×...×2×1. By definition, 0! = 1, which ensures consistency in formulas when r=0 or r=n. A key simplification trick: always cancel common factorial terms before multiplying large numbers. For instance, 10!/8! = 10×9 = 90, not 3628800/40320. This saves time and reduces arithmetic errors in exams. Students often forget that factorial is defined only for non-negative integers; expressions like (−3)! or (1.5)! are undefined in standard CBSE syllabus. Factorials grow explosively: 5! = 120, but 10! = 3,628,800 and 20! exceeds 2 quintillion.

n! = n × (n−1)! — recursive definition, useful for proofs and simplifications.
0! = 1 by convention, ensuring formulas like nC0 = n!/(0!n!) = 1 work correctly.
Simplification: n!/(n−r)! = n×(n−1)×...×(n−r+1), a product of r consecutive descending integers.
For large n, use logarithms or calculators; manual computation beyond 12! is impractical in timed exams.

Permutation Formulas and Special Cases

Permutations count ordered arrangements. The general formula nPr = n!/(n−r)! gives the number of ways to arrange r objects chosen from n distinct objects. When r=n, you get n! (all objects arranged). When items must be arranged with restrictions — say two people must sit together — treat them as a single block. If n objects include p identical of one type and q identical of another, the formula becomes n!/(p!q!...). This accounts for over-counting because swapping identical items produces the same visible arrangement. For instance, the word MISSISSIPPI has 11 letters with I repeated 4 times, S repeated 4 times, P twice; arrangements = 11!/(4!4!2!) = 34,650. Circular permutations of n distinct objects fix one position to eliminate rotational symmetry, yielding (n−1)! arrangements. If reflections are also identical (like beads on a necklace), divide by 2 to get (n−1)!/2.

nPn = n! — permuting all n objects.
nP0 = 1 — selecting and arranging zero objects has exactly one way (do nothing).
Restricted permutations: Use slot method or block method. If A and B must be adjacent, glue them into one block, arrange blocks, then arrange within the block.
Objects in a row vs circle: row has n! arrangements, circle has (n−1)!.

Combination Formulas and Identities

Combinations count selections where order is irrelevant. The formula nCr = n!/(r!(n−r)!) calculates the number of ways to choose r objects from n. A powerful identity is nCr = nC(n−r); always compute the smaller of r and n−r to save effort. For example, 50C48 = 50C2 = (50×49)/2 = 1225, much faster than expanding 50!/48!2!. Another identity: nCr + nC(r−1) = (n+1)Cr (Pascal's triangle property), useful in proofs. The sum of all combinations from an n-set is nC0 + nC1 +... + nCn = 2^n, representing all possible subsets. When solving problems, ask: does order matter? If yes, use permutation; if no, use combination. A common exam trap is to apply nPr when the question says 'select a committee' or 'draw cards'; these are combination scenarios because reshuffling the chosen members does not create a new committee.

nC0 = nCn = 1 — there is exactly one way to choose nothing or everything.
nC1 = n — choosing one item from n is simply picking any of the n items.
nCr = nC(n−r) — symmetry; simplifies calculations significantly.
Sum identity: nC0 + nC1 +... + nCn = 2^n.
Pascal's identity: nCr = (n−1)Cr + (n−1)C(r−1), the basis of Pascal's triangle.

Fundamental Principle of Counting

The Fundamental Principle of Counting is the conceptual bedrock of the entire chapter. It has two forms: the Multiplication Principle and the Addition Principle. Multiplication Principle: if task T1 can be done in m ways and independently task T2 in n ways, then both tasks in sequence can be done in m×n ways. For example, if a restaurant offers 4 starters and 5 main courses, the number of starter-main combinations is 4×5 = 20. Addition Principle: if task T1 can be done in m ways or task T2 in n ways (mutually exclusive), the number of ways to do either is m+n. These principles extend to three or more tasks. In NCERT exercises, multi-digit number formation (with or without repetition, with constraints like 'even numbers only') and seating arrangements are classic applications. Always identify whether events are sequential (multiply) or alternatives (add).

Multiplication Principle: sequential independent tasks multiply their way-counts.
Addition Principle: mutually exclusive alternatives add their way-counts.
Example: forming a 3-digit number from {1,2,3,4,5} without repetition — 5 choices for hundreds, 4 for tens, 3 for units = 5×4×3 = 60.
With repetition allowed, each digit can be any of 5, so 5×5×5 = 125.
Use the principle to break complex problems into stages: fill position 1, then position 2, and so on.

Circular Permutations and Necklace Arrangements

Circular permutations differ from linear arrangements because rotations of the same configuration are considered identical. For n distinct objects arranged in a circle, fix one object's position to break rotational symmetry; the remaining (n−1) objects can be arranged in (n−1)! ways. For example, seating 5 people around a circular table is (5−1)! = 24 ways. If the circular arrangement has no directional distinction — such as beads on a necklace or keys on a keyring where clockwise and anticlockwise are the same — divide by 2 to get (n−1)!/2. This adjustment accounts for reflectional symmetry. NCERT Class 11 Mathematics Chapter 6 explicitly covers this as a special case. In exam problems, watch for keywords: 'round table', 'circular', 'ring' suggest (n−1)!; 'necklace', 'garland' or 'both sides identical' trigger the ÷2 rule. Always confirm whether clockwise ≠ anticlockwise before choosing the formula.

Circular permutation of n distinct objects: (n−1)!.
If reflections identical (necklace): (n−1)!/2.
Reason for (n−1)!: fix one object to eliminate n rotational copies of each linear arrangement.
Example: arranging 4 different coloured beads in a bracelet (reflections same) = (4−1)!/2 = 3!/2 = 3.
For people around a table where direction matters (e.g. facing inward), use (n−1)! only.

Common Mistakes, Notations and Memory Tricks

Students often confuse permutation with combination or forget the 0!=1 convention. A frequent error is computing nCr by expanding full factorials instead of canceling terms. Another pitfall: misinterpreting 'at least k' constraints — remember to sum over all qualifying cases or use complementary counting (total minus unwanted). In notation, nPr and nCr are standard; some texts write P(n,r) or C(n,r); CBSE prefers nPr, nCr. The caret symbol '^' is not used; binomial coefficients are written nCr, not n^Cr. Mnemonic for permutation vs combination: Permutation = Position matters; Combination = Collection only. For factorial simplification, always write out the ratio and cancel before multiplying. Memory trick for nCr = nC(n−r): symmetry means choosing r items is the same as leaving out (n−r) items. Practice verbalising the problem: 'Am I arranging (order matters) or just picking (order doesn't matter)?' This one-second check prevents most formula selection errors.

0! = 1 — never write 0!=0; this is a definition, not a calculation.
nPr ≠ nCr — check if order matters before choosing formula.
Simplify factorials first: 10!/8! = 10×9, not two separate huge numbers.
At least k means sum cases k, k+1,..., n or use complement 'total − (fewer than k)'.
Notation: write nCr, not C(n,r) or n^Cr in CBSE answer sheets; examiners follow NCERT style.
Mnemonic: 'Permutation = Position; Combination = Collection'.

Worked Mini-Examples Applying the Formulas

Here are three carefully chosen mini-examples that mirror typical CBSE Class 11 board exam and NCERT exercise questions. Each demonstrates formula selection, substitution and simplification step-by-step. Example 1 (Permutation): How many 3-digit numbers can be formed using digits 2,3,5,7,9 without repetition? Solution: 5 choices for hundreds, 4 for tens, 3 for units = 5×4×3 = 60. Example 2 (Combination): A bag contains 5 red and 4 blue balls. In how many ways can 3 red and 2 blue balls be selected? Solution: Choose 3 from 5 red: 5C3 = 10. Choose 2 from 4 blue: 4C2 = 6. Total = 10×6 = 60. Example 3 (Circular with constraint): 7 people sit around a round table. Two of them insist on sitting together. In how many ways? Solution: Treat the pair as one block → 6 units around a circle = (6−1)! = 120. Inside the block, 2 can swap = 2!. Total = 120×2 = 240. These examples reinforce the Fundamental Principle, formula substitution and constraint handling.

Always identify the type: arrangement (permutation) or selection (combination).
For constraints ('must sit together', 'at least one'), use block method or complementary counting.
Write out intermediate steps; markers award method marks even if the final answer is wrong.
Double-check units and indices: nCr requires r ≤ n; if not, the answer is 0.

One-Glance Last-Minute Revision Box

This compact box consolidates the absolute must-know formulas and facts for the night before your exam. Write these on a flashcard and revise during breaks. Fundamental Principle: m ways for task 1, n ways for task 2 → m×n ways together. Factorial: n! = n×(n−1)×...×1; 0!=1. Permutation: nPr = n!/(n−r)!; arranging r from n. Combination: nCr = n!/(r!(n−r)!); selecting r from n. Symmetry: nCr = nC(n−r). Sum: nC0+nC1+...+nCn=2^n. Circular: (n−1)! for distinct objects; (n−1)!/2 if reflections identical. Repetition: n!/(p!q!...). Relation: nPr = r! × nCr. Check every problem: does order matter? If yes → P; if no → C. Practice one problem of each type daily. Bookmark NCERT Exercise 6.2 (combinations) and 6.3 (mixed); these appear almost every year in board exams. CBSETUTOR.ai offers 24×7 doubt solving for Permutations and Combinations: upload your exercise photo and get step-by-step solutions instantly at ₹999/month for all subjects, Classes 6-12, with a 3-day free trial so you can test it before the exam rush.

nPr = n!/(n−r)! | nCr = n!/(r!(n−r)!) | nCr = nC(n−r)
Circular distinct: (n−1)! | Necklace: (n−1)!/2
Fundamental Principle: multiply sequential tasks, add mutually exclusive options.
Permutation with repetition: n!/(p!q!r!...)
0! = 1; nP0 = 1; nC0 = 1; nC1 = n
Always simplify factorials before multiplying.
Combination problems: committee, selection, lottery. Permutation problems: passwords, rankings, seating in a row.

How CBSETUTOR.ai Helps Master Permutations and Combinations

CBSE Class 11 Mathematics Chapter 6 is notorious for tricky word problems that mix permutations, combinations and constraints. Students often know the formulas but struggle to decide which one fits the question. CBSETUTOR.ai provides a 24×7 AI tutor that lets you snap a photo of any NCERT exercise, supplementary problem or previous year question and receive an instant step-by-step solution with formula identification, substitution and simplification. The platform covers all CBSE classes from 6 to 12 at a flat ₹999 per month — one price, every subject, no hidden fees. You also get a 3-day free trial to explore the entire question bank and AI solver before committing. For Permutations and Combinations, the AI tutor highlights common errors (like using nPr instead of nCr), suggests memory tricks and links each solution back to NCERT chapter text so you build conceptual clarity, not just rote formula recall. Thousands of Delhi NCR and Tier-2 city students use CBSETUTOR.ai to bridge the gap left by overcrowded classrooms and expensive coaching centres.

Upload a problem photo and get detailed solutions in seconds, anytime.
AI tutor flags if you have chosen the wrong formula (P vs C) and explains why.
Access full NCERT exemplar and board PYQ solutions for Chapter 6.
₹999/month for Classes 6–12, all subjects; 3-day free trial with no payment upfront.
Ideal for self-paced learners and students in cities with limited coaching infrastructure.

Frequently asked questions

What is the difference between permutation and combination in Class 11 Maths Chapter 6?+

Permutation counts ordered arrangements where sequence matters (e.g. race podium positions). Combination counts selections where order is irrelevant (e.g. choosing committee members). Use nPr when order matters; use nCr when it does not.

Why is 0! defined as 1 in permutations and combinations?+

0! = 1 by convention ensures consistency in formulas like nCr = n!/(r!(n−r)!). When r=0, we get nC0 = n!/(0!n!) = 1, meaning there is exactly one way to choose nothing — a logical and necessary result.

How do I solve problems with constraints like 'two people must sit together'?+

Treat the constrained pair as a single block. Arrange the blocks plus remaining individuals, then multiply by arrangements within the block. For 'must not sit together', subtract the 'together' cases from total unrestricted arrangements.

What is the formula for circular permutations and when do I use (n−1)!/2?+

For n distinct objects in a circle, use (n−1)! because fixing one position eliminates rotational duplicates. Use (n−1)!/2 when clockwise and anticlockwise are identical, such as beads on a necklace or keys on a ring, to account for reflectional symmetry.

How many marks does Permutations and Combinations carry in CBSE Class 11 board exams?+

Typically 8–10 marks across 2–3 questions: one 2-mark direct formula application, one 4-mark word problem (committee/arrangement), and possibly a 4-mark proof or derivation. NCERT Exercise 6.3 miscellaneous problems are prime sources for board questions.

What is the meaning of nCr = nC(n−r) and how does it help in calculation?+

This symmetry identity states that choosing r items from n is equivalent to leaving out (n−r) items. It simplifies calculation: instead of computing 50C48, compute 50C2 = 1225, which is much faster and less error-prone.

How do I handle permutations when some objects are identical?+

Use the formula n!/(p!q!r!...) where n is the total number of objects and p, q, r... are counts of each identical type. This corrects for over-counting since swapping identical items does not create a new arrangement.

Can I use a calculator for factorials in the CBSE Class 11 board exam?+

Simple scientific calculators are usually allowed, and most have an n! key. However, always show the formula and substitution steps in your answer sheet; direct calculator output without working may not earn full method marks.

What is the Fundamental Principle of Counting and how is it applied?+

If task A can be done in m ways and independently task B in n ways, both together can be done in m×n ways (multiplication). If A or B are mutually exclusive alternatives, total ways = m+n (addition). This principle underpins all counting problems in the chapter.

How does CBSETUTOR.ai help with tricky Permutations and Combinations word problems?+

CBSETUTOR.ai's AI tutor parses your uploaded problem photo, identifies whether it requires permutation or combination, applies the correct formula and shows every simplification step. You also get hints on constraint handling and alternative methods. All this for ₹999/month covering Classes 6–12, every subject, with a 3-day free trial.

Related resources

Important Questions: CBSE Class 11 Mathematics Chapter 6 Permutations and Combinations CBSE Class 11 Mathematics Chapter 6 Permutations and Combinations Worksheet with Answers Important Questions: CBSE Class 11 Mathematics Chapter 5 Linear Inequalities CBSE Class 11 Mathematics Chapter 5 Linear Inequalities Worksheet with Answers AI Tutor for Class 11: The Smart Alternative to Tuition AI Tutor for Class 11 Accountancy: Learn Faster with Instant Help Class 9 Coordinate Geometry Chapter 3: Cartesian System & Plotting Points Class 9 Mathematics Chapter 2 Polynomials — Formulas & Key Points

Keep learning — related guides

Class 11Mathematics

Class 11 Mathematics Chapter 8 Sequences and Series — Formulas & Key Points

Class 11Mathematics

Important Questions: CBSE Class 11 Mathematics Chapter 14 Probability

Class 11Mathematics

CBSE Class 11 Mathematics Chapter 14 Probability Worksheet with Answers

Class 11Mathematics

Class 11 Mathematics Chapter 14 Probability — Formulas & Key Points

Class 11Mathematics

Important Questions: CBSE Class 11 Mathematics Chapter 13 Statistics

Class 11Mathematics

CBSE Class 11 Mathematics Chapter 13 Statistics Worksheet with Answers

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 →