- Multiply counts for sequential choices and add disjoint alternatives.
- n!=n(n−1)…1 for n≥1, with 0!=1.
- Permutations count ordered selections without replacement: nPr=n!/(n−r)!.
- Combinations count unordered selections: nCr=n!/[r!(n−r)!].
- For 0≤r≤n, nPr=r!×nCr.
- Use nCr=nC(n−r) to simplify combinations.
- If repetition is allowed independently in r positions with n options, there are n^r sequences.
- When forming numbers, the leading digit cannot be zero.
- For required adjacency, group specified objects into a block and count internal orders.
- For 'at least one' conditions, complement counting can be efficient.
- Repeated identical objects require division by factorials of multiplicities.
- Circular arrangements and some extensions require checking the current assessment scope.
Use these notes alongside your current textbook. Check important formulas, worked answers and syllabus coverage with your teacher or official learning material.
Permutations and Combinations , Class 11 Mathematics
Detailed original study guide on fundamental counting principles, factorials, ordered arrangements, unordered selections, restrictions, 30 worked examples and answered practice. Distinguish core textbook content from optional enrichment.
Learning objectives
Apply addition and multiplication counting principles; evaluate factorials; distinguish arrangements from selections; compute nPr and nCr; count cases with fixed positions, adjacency, repetition and restrictions; and verify solutions with smaller examples.
Why counting methods matter
Listing all outcomes becomes impractical when many choices are available. Counting principles organise the possibilities without listing them individually. The key first step is to decide whether the task concerns an ordered arrangement, an unordered selection, or a sequence of separate decisions.
Fundamental principle of counting
If a first stage has m choices and, for each first-stage choice, a second stage has n choices, the total is m×n. More generally, multiply the number of choices available at each stage, accounting for earlier decisions. For example, 3 shirts and 4 trousers give 12 outfits.
Addition principle
When alternatives cannot occur together, add their counts. If there are 4 routes by bus or 3 distinct routes by train, choosing exactly one route gives 4+3=7 options. If cases overlap, subtract the overlap to avoid double counting.
Factorial notation
For a nonnegative integer n, n!=n(n−1)(n−2)…1, and 0!=1. For instance, 5!=120. Factorials simplify by cancellation: 8!/6!=8×7=56. The expression n! is not defined for negative integers in elementary counting.
Permutations of distinct objects
An arrangement of r distinct objects chosen from n distinct objects is a permutation when order matters. nPr=n!/(n−r)! for integers 0≤r≤n. The first place has n choices, the second n−1, and so on.
Permutations of all objects
Arranging n distinct objects in n positions gives n!=nPn possibilities. For example, five distinct books can be arranged in 5!=120 ways.
Permutations with repetition allowed
If there are n possible symbols for each of r positions and repetition is allowed, the number of length-r sequences is n^r. This is different from nPr, which assumes distinct selected objects and no repetition.
Permutations of identical objects
When a collection contains n objects with groups of identical objects of sizes p,q,…, the number of distinct arrangements is n!/(p!q!…). Example: the letters in LEVEL have 5!/(2!2!)=30 distinct arrangements. This is a useful extension; check prescribed assessment scope.
Combinations of distinct objects
A combination selects r objects from n distinct objects without regard to order: nCr=n!/[r!(n−r)!]. Choosing A and B is the same group as choosing B and A. Conditions are integers 0≤r≤n.
Connection between permutations and combinations
Every r-element subset of distinct objects can be arranged in r! orders. Therefore nPr=nCr×r!. This explains why ordered arrangements exceed unordered selections by a factor of r!.
Symmetry and standard identities
nCr=nC(n−r); nC0=nCn=1; nC1=n; and nCr+nC(r−1)=(n+1)Cr for valid indices. The last is Pascal's identity. Use symmetry to simplify calculations such as 10C8=10C2=45.
Choosing the right method
Ask: Does swapping two selected items create a different outcome? If yes, use a permutation or stage-by-stage counting. If not, use a combination. Assigning president and secretary is ordered; forming a two-member committee is not.
Restrictions and casework
For restrictions, count only allowed outcomes. Common approaches include fixing a required object, grouping adjacent objects into a block, separating cases and using total minus forbidden cases. Explain why cases do not overlap before adding them.
Objects together
To arrange n distinct objects with two specified objects adjacent, treat the pair as one block: (n−1)! ways to arrange the block and others, multiplied by 2! internal orders. For 5 distinct books, this gives 4!×2=48.
Objects not together
Count all arrangements and subtract arrangements in which the specified objects are together. For 5 distinct books, two specified books not adjacent: 5!−2×4!=120−48=72.
Circular arrangements
For n distinct people seated around a round table when rotations are considered identical but reflections are distinct, the count is (n−1)!. For 5 people, 4!=24. If mirror-image arrangements are also considered identical, a different convention applies. This is enrichment unless included in the prescribed course.
Digits and leading zero
When forming numbers, the first digit cannot be zero. Count the first position separately. For example, three-digit numbers from digits {0,1,2,3} without repetition: 3 choices for hundreds, then 3, then 2, giving 18.
Choosing from groups
When selecting a team with requirements such as two girls and one boy, multiply the combination counts from the separate groups. For 4 girls and 5 boys, choose 2 girls and 1 boy in 4C2×5C1=6×5=30 ways.
Worked example 1: two-stage choices
A menu offers 4 starters and 3 mains. Choosing one of each gives 4×3=12 meals.
Worked example 2: factorial cancellation
Evaluate 9!/7!. Cancel 7! to obtain 9×8=72.
Worked example 3: ordered positions
Choose a captain and vice-captain from 7 students. Since roles differ, 7P2=7×6=42.
Worked example 4: unordered selection
Choose 2 students from 7 for a committee. 7C2=7×6/2=21.
Worked example 5: all-object arrangements
Arrange 6 distinct books on a shelf. 6!=720.
Worked example 6: partial permutations
Arrange 3 of 8 different flags in a row. 8P3=8×7×6=336.
Worked example 7: combinations
Choose 3 of 8 students. 8C3=(8×7×6)/(3×2×1)=56.
Worked example 8: symmetry
Evaluate 12C10. By symmetry 12C10=12C2=12×11/2=66.
Worked example 9: repetition allowed
A 4-digit PIN uses digits 0, 9 and may start with zero. With repetition allowed, 10⁴=10,000 PINs.
Worked example 10: repetition not allowed
A 4-digit PIN may start with zero but digits cannot repeat. Count 10×9×8×7=5040.
Worked example 11: distinct three-digit numbers
Using digits 1,2,3,4,5 without repetition, there are 5P3=5×4×3=60 three-digit numbers.
Worked example 12: leading zero
Using digits 0,1,2,3 without repetition, three-digit numbers: 3×3×2=18.
Worked example 13: repeated letters
Distinct arrangements of BANANA: 6!/(3!2!)=60, since A appears three times and N twice.
Worked example 14: two books together
Five different books, with two specified books adjacent: 4!×2!=48.
Worked example 15: two books apart
Five different books, with two specified books not adjacent: 5!−48=72.
Worked example 16: fixed first position
Five distinct people in a row, with one specified person first: 4!=24.
Worked example 17: choose a mixed committee
From 5 girls and 4 boys, choose exactly 2 girls and 2 boys: 5C2×4C2=10×6=60.
Worked example 18: at least one
From 3 girls and 4 boys, select a 3-member group with at least one girl: 7C3−4C3=35−4=31.
Worked example 19: at most one
From 3 girls and 4 boys, select 3 with at most one girl: 4C3+3C1×4C2=4+18=22.
Worked example 20: circular seating
Seat 6 distinct people around a circular table, identifying rotations: (6−1)!=120 arrangements.
Worked example 21: compare methods
Choose and rank 3 winners from 10: 10P3=720. Choose 3 finalists without ranking: 10C3=120. Their ratio is 3!=6.
Worked example 22: evaluate nCr identity
Compute 6C2+6C3=15+20=35, matching 7C3=35.
Worked example 23: zero selections
How many ways to select no items from 8? 8C0=1: the empty selection.
Worked example 24: choose all
How many ways to choose all 8 objects? 8C8=1.
Worked example 25: alternating groups
Arrange 3 distinct boys and 3 distinct girls in a line, alternating gender: 2 possible gender patterns, 3! orders for boys, 3! for girls, total 2×6×6=72.
Worked example 26: at least one digit repeated
Count 3-digit numbers from 1, 5 allowing repetition with at least one repeated digit. Total 5³=125; all distinct 5P3=60; required 125−60=65.
Worked example 27: choosing consecutive positions
Select 4 people from 9, then assign 4 distinct roles. Count 9C4×4!=126×24=3024=9P4.
Worked example 28: fixed object included
Choose a 4-member team from 9 students including one specified student. Choose remaining 3 from other 8: 8C3=56.
Worked example 29: fixed object excluded
Choose a 4-member team from 9 excluding one specified student. Choose all 4 from other 8: 8C4=70.
Worked example 30: nonoverlapping cases
From 6 students choose a team of either 2 or 3 members: 6C2+6C3=15+20=35, since the two sizes are disjoint.
MCQs with answers
- 5P2 equals (a) 10 (b) 20 (c) 25 (d) 120. Answer: b.
- 5C2 equals (a) 20 (b) 15 (c) 10 (d) 5. Answer: c.
- 0! equals (a) 0 (b) 1 (c) undefined (d) −1. Answer: b.
- Order matters for (a) committee (b) unordered group (c) captain and deputy (d) subset. Answer: c.
- 7C5 equals (a) 21 (b) 35 (c) 42 (d) 7. Answer: a.
- Number of ways to arrange 4 distinct books is (a) 4 (b) 12 (c) 16 (d) 24. Answer: d.
- For 6 objects, selecting all 6 gives (a) 6 (b) 1 (c) 0 (d) 36. Answer: b.
- 3-symbol codes from 4 symbols with repetition allowed: (a) 12 (b) 24 (c) 64 (d) 4. Answer: c.
- 4P4 equals (a) 1 (b) 4 (c) 16 (d) 24. Answer: d.
- nPr equals (a) nCr/r! (b) nCr×r! (c) nCr+r! (d) nCr−r!. Answer: b.
Short-answer practice with solutions
- Find 6P2. 6×5=30.
- Find 6C2. 6×5/2=15.
- Find 8C6. 8C2=28.
- Evaluate 7!/5!. 7×6=42.
- Arrange 4 different pencils. 4!=24.
- Choose 3 from 5. 5C3=10.
- Assign 2 distinct offices to 5 people. 5P2=20.
- Choose 2 books from 8. 8C2=28.
- Arrange letters of MAMA. 4!/(2!2!)=6.
- Form two-letter strings from A,B,C with repetition. 3²=9.
- How many subsets of size 0 from 9? 9C0=1.
- How many ways to seat 4 people in a line? 4!=24.
Extended solution: restricted arrangement
Six distinct students stand in a line; two specified students must stand together. Treat them as one block, giving five units. Arrange units in 5! ways and swap the two inside the block in 2! ways. Total 5!×2!=240. This assumes all students are distinct and only adjacency is required.
Extended solution: committee composition
From 6 boys and 5 girls choose a committee of 4 with exactly 2 girls. Select girls in 5C2=10 ways and boys in 6C2=15 ways. By the multiplication principle, total 10×15=150 committees. No further factor of 4! is needed because committee order does not matter.
Extended solution: at least one condition
From 5 girls and 4 boys select a 3-member team containing at least one girl. Total teams: 9C3=84. Teams with no girls: 4C3=4. Subtract: 84−4=80. The complement method avoids separate cases for one, two or three girls.
Common mistakes
Do not use nPr for an unordered committee. Do not use nCr for distinct ranked roles. For repeated symbols, check whether repetition is allowed and whether objects are identical. In number formation, exclude leading zero. When counting 'at least one', subtract the complement only from a correctly defined total. For circular arrangements, specify whether rotations and reflections count as the same.
Revision checklist
Understand multiplication and addition counting principles; evaluate factorials; distinguish ordered from unordered tasks; know nPr and nCr with conditions; simplify via symmetry; handle fixed and adjacent positions; count repeated letters carefully; avoid leading zero; solve selection constraints with cases or complements; check small cases by listing outcomes.
Source and scope
Original supplementary guide for NCERT Class 11 Mathematics 2026, 27. Core principles, factorials, permutations and combinations are central; circular permutations and some repeated-object arrangements are enrichment and may not be part of the prescribed summative scope. No claim of exact numbered NCERT exercise solutions or fixed CBSE marking allocations. Consult https://ncert.nic.in/textbook.php and https://cbseacademic.nic.in/curriculum_2027.html.
Frequently asked questions
What is the difference between permutations and combinations?
Permutations count ordered arrangements; combinations count selections where order does not matter.
What is the permutation formula?
nPr=n!/(n−r)! for integers 0≤r≤n when selecting distinct objects without repetition.
What is the combination formula?
nCr=n!/[r!(n−r)!] for integers 0≤r≤n.
Why is 0! equal to 1?
It is defined as 1, consistent with factorial identities and the single way to arrange or select nothing.
When do I use the multiplication principle?
When an outcome is built through successive choices, multiply the available choices at each stage.
How are repeated identical objects handled?
Divide n! by the factorials of each group of identical objects, such as n!/(p!q!…).
How do I count selections with at least one member from a group?
Count all eligible selections and subtract those with no members from that group, or sum disjoint cases.
Are these official NCERT numbered exercise solutions?
No. These are original supplementary worked examples and practice; check the prescribed NCERT textbook for exact exercises.
