Permutations and Combinations Class 11: Notes, Formulae and Solved Questions
Updated 14 October 2026 · Fact-checked
Permutations and Combinations is Chapter 6 of CBSE Class 11 Maths. It covers the fundamental principle of counting, factorial notation, permutations of distinct objects and of objects that are not all different, combinations, the derivation of the formulae for nPr and nCr, the link nPr = r! × nCr, and simple applications.
What Permutations and Combinations is about
How many 4-digit PINs have no repeated digit? How many ways can a committee of 5 be picked from 12 people? Listing every case is slow and error-prone. This chapter gives quick, reliable ways to count without listing.
Everything rests on the fundamental principle of counting: if one job can be done in m ways and then a second in n ways, the two together can be done in ways. Repeated products like are written with factorials, .
A permutation is an arrangement, where order matters: the number of ways of arranging r out of n different objects is . If some objects are identical, divide by the factorials of the repeat counts. A combination is a selection, where order does not matter: . The two are linked by , because each selection of r objects can be arranged in ways. Useful facts such as and follow, and they lead straight into the binomial theorem in the next chapter.
Weightage: This chapter is part of Unit II, Algebra, which the syllabus gives 25 of the 80 theory marks in the school annual exam (CBSE adds that there is no fixed chapter-wise weightage).Source: CBSE Mathematics (041) syllabus 2026-27, Class XI course structure, Unit II Algebra
Key concepts
- Fundamental principle of counting
- NCERT section 6.2
Multiplication principle: if an event can happen in m different ways, and after it a second event can happen in n different ways, then the two events in that order can happen in ways. It extends to any number of events:
How to use it: draw one box for each position (or stage), write in each box the number of choices for it, and multiply.
- With repetition allowed, every box usually gets the full number of choices.
- Without repetition, each box has one fewer choice than the one before.
- Fill any restricted box first (first digit cannot be 0; last digit must be even).
Worked example
How many 3-digit numbers can be formed from the digits 1, 2, …, 6 if (i) repetition is allowed (ii) repetition is not allowed? How many 3-digit even numbers can be formed from 1, 2, …, 7 with repetition? [3 marks]
Try it first, then show the solutionSolution
- (i)
- (ii)
- Even: units digit from {2, 4, 6} (3 ways), other two digits 7 ways each:
Answer: 216; 120; 147
- Factorial notation
- NCERT section 6.3.2
For a natural number n, (read 'n factorial'). By definition, .
- , so , and .
- Values: 1! = 1, 2! = 2, 3! = 6, 4! = 24, 5! = 120, 6! = 720, 7! = 5040.
- Factorials do not add or multiply like ordinary numbers: , but .
Tip for equations with factorials: divide or multiply through by the largest factorial so that everything becomes a product of a few numbers.
Worked example
If , find x. [2 marks]
Try it first, then show the solutionSolution
- Multiply both sides by 9!:
Answer: x = 81
- Permutations of distinct objects: nPr
- NCERT section 6.3.1 and 6.3.3
A permutation is an arrangement in a definite order of some or all of a set of objects.
Theorem: the number of permutations of n different objects taken r at a time (), without repetition, is
Proof idea: fill r places in order. The first place can be filled in n ways, the second in ways (one object is used), …, the r-th in ways. By the counting principle, multiply. Multiplying and dividing by gives the factorial form.
- (arranging all n); .
- With repetition allowed, each of the r places has n choices: arrangements.
Worked example
Find n if . [2 marks]
Try it first, then show the solutionSolution
- (n ≥ 4, so )
- , so n = 7 (n cannot be negative)
Answer: n = 7
- Arrangements with conditions
- NCERT section 6.3
Common conditions and how to handle them:
- Fixed positions (word starts with a vowel): fill the fixed place first, then arrange the rest.
- Objects together (all vowels together): tie them into one block; arrange the block with the other objects, then multiply by the arrangements inside the block.
- Objects never together: total arrangements minus 'together' arrangements; or the gap method (arrange the others first, then place the restricted objects in the gaps).
- Particular places (vowels in even places): choose which objects go in those places, arrange them there, and arrange the rest in the remaining places.
Worked example
In how many ways can the letters of ARTICLE be arranged so that (i) the vowels are together (ii) the vowels are in the even places? [3 marks]
Try it first, then show the solutionSolution
- ARTICLE has 7 different letters: vowels A, I, E and consonants R, T, C, L
- (i) Treat AIE as one block: 5 units arrange in 5! ways, the vowels inside in 3! ways:
- (ii) Even places 2, 4, 6 take the 3 vowels in 3! ways; the 4 consonants fill the odd places in 4! ways:
Answer: 720; 144
- Permutations when objects are not all different
- NCERT section 6.3.4
Theorem: the number of permutations of n objects, of which are alike of one kind, alike of a second kind, …, alike of a k-th kind (the rest all different), is
Why: if the alike objects were labelled differently there would be n! arrangements. Swapping identical objects among themselves gives the same arrangement, and there are such swaps for the first kind, for the second, and so on. So each distinct arrangement has been counted times.
Example: BANANA has 6 letters with three A's and two N's: arrangements.
Worked example
Find the number of arrangements of the letters of COMMITTEE. [2 marks]
Try it first, then show the solutionSolution
- COMMITTEE has 9 letters: M twice, T twice, E twice, and C, O, I once each
Answer: 45360
- Combinations: nCr
- NCERT section 6.4
A combination is a selection of objects where order does not matter: choosing {A, B} is the same as choosing {B, A}.
Link with permutations: each combination of r different objects can be arranged in ways, and doing this for every combination gives every permutation exactly once. So
Properties:
- ,
- (choosing r to take is the same as choosing to leave)
- If , then or
- Pascal's rule:
Worked example
If , find . Verify that . [2 marks]
Try it first, then show the solutionSolution
- , so , n = 12;
- and ✓
Answer: 66; verified.
- Selection problems and mixed problems
- NCERT section 6.4 (Examples and Miscellaneous)
Selections from groups: select from each group separately and multiply. Choosing 3 boys from 6 and 2 girls from 5: .
'At least' and 'at most': split into cases (exactly 3, exactly 4, …) and add the cases.
Geometry: lines through n points with no three collinear: ; triangles: ; diagonals of an n-gon: .
Select, then arrange: for 'words with 2 vowels and 3 consonants', first select the letters (), then arrange the 5 chosen letters (5!).
Is it P or C? Ask: if I swap two chosen items, do I get a different outcome? Yes → permutation. No → combination.
Worked example
A committee of 5 is to be formed from 6 boys and 4 girls. In how many ways can it be done if it has (i) exactly 2 girls (ii) at least 3 girls? [3 marks]
Try it first, then show the solutionSolution
- (i) 2 girls and 3 boys:
- (ii) 3 girls and 2 boys:
- 4 girls and 1 boy: ; total
Answer: 120; 66
Maths in real life: Permutations and Combinations
Each concept, met in an everyday situation. Read the situation, try the problem, then check the solution. The one-line hook is what to remember.
PINs with and without repetition
Suppose a bank lets customers choose a 4-digit PIN from the digits 0 to 9.
How many PINs are possible (a) with repetition allowed (b) if no digit may repeat?
Try it first, then show the solutionSolution
- (a) Each of 4 places has 10 choices:
- (b)
Answer: 10000 and 5040
Memory hook: Repetition allowed: same choices every box; not allowed: one fewer each box.
Handshakes versus gifts
Imagine 20 students at a farewell party. Every pair shakes hands once, and every student gives a card to every other student.
How many handshakes and how many cards are there?
Try it first, then show the solutionSolution
- A handshake is a pair, and order does not matter:
- A card has a sender and a receiver, so order matters:
Answer: 190 handshakes; 380 cards
Memory hook: Swap the two people: same handshake, different card. C for handshakes, P for cards.
Choosing toppings
Suppose a pizza shop offers 8 toppings and a 'pick any 3' deal.
How many different 3-topping pizzas can be made?
Try it first, then show the solutionSolution
- Order of toppings does not matter, so this is a combination
Answer: 56 pizzas
Memory hook: Selection, not arrangement: use C.
Topics in this chapter
Permutations and Combinations formula sheet
- Fundamental principle of counting
- Factorial
- Permutations
- Objects not all different
- Combinations
- Properties of nCr
- or .
How the school exam asks Permutations and Combinations
The question patterns to expect, and the method that works for each.
| Question type | How it is asked | Method |
|---|---|---|
| Counting principle | Numbers from given digits, codes, signals, outcomes of tosses (Exercise 6.1). | Boxes for positions; fill restricted boxes first; multiply. |
| Factorials and nPr equations | Evaluate factorial expressions; solve for n or r in equations with . | Cancel the largest factorial; reduce to a quadratic and reject impossible roots. |
| Words and arrangements | Words from given letters (all distinct or with repeats), with conditions: vowels together, starting with a letter, specific gaps (Exercise 6.3). | Block method for 'together', complement or gap method for 'not together', divide by repeat factorials. |
| Selections | Committees, teams, cards, balls, chords and diagonals, with 'exactly', 'at least', 'at most' (Exercise 6.4). | Split into cases, multiply within a case, add across cases. |
| Select then arrange | Words with a given number of vowels and consonants; numbers with conditions (Miscellaneous Exercise). | Combination for choosing, then factorial for arranging. |
Tricks to remember Permutations and Combinations
Short memory aids. Say each one aloud once, then use it on a question the same day.
P for Position, C for Choose
Permutations care about Positions (order); Combinations only Choose.
Use it when: Deciding which formula.
AND multiplies, OR adds
Do this AND that → multiply. Case 1 OR case 2 → add.
Use it when: Committees with 'at least'.
Glue and unglue
For 'together', glue the group into one block, count, then multiply by the ways to arrange inside the glue.
Use it when: Vowels-together questions.
Divide out the twins
Identical letters can't be told apart, so divide by the factorial of each repeat count.
Use it when: MISSISSIPPI-type words.
Take r = leave n − r
: always compute the smaller one.
Use it when: Quick evaluation.
Permutations and Combinations: exam-level solved questions
Ordered from exam level to HOTS. Cover the solution, write your own, then compare step by step.
Example 1: Factorial facts · 1 mark · MCQExam level
Which of the following is true?
(a)
(b)
(c)
(d)
Try it first, then show the solutionSolution
- . The others are false: 6 + 24 = 30 ≠ 5040, 0! = 1, 5! = 120.
Answer: (b)
Example 2: Selection or arrangement · 1 mark · Assertion-reasonExam level
Assertion (A): The number of ways of choosing a captain and a vice-captain from 11 players is .
Reason (R): Order does not matter in a combination.
(a) Both true, R explains A. (b) Both true, R does not explain A. (c) A true, R false. (d) A false, R true.
Try it first, then show the solutionSolution
- Captain and vice-captain are different roles, so order matters: , not . A is false; R is a true statement.
Answer: (d)
Example 3: Repeated letters · 3 marks · Short answerHarder exam level
In how many of the distinct arrangements of the letters of BALLOON do the two L's not come together? [3 marks]
Try it first, then show the solutionSolution
- Total: 7 letters with L×2, O×2 and B, A, N once each:
- L's together: treat LL as one unit; 6 units with O×2:
- Not together:
Answer: 900
Example 4: No two girls together · 3 marks · Short answerHarder exam level
In how many ways can 6 boys and 4 girls sit in a row so that no two girls sit next to each other? [3 marks]
Try it first, then show the solutionSolution
- Seat the boys first: 6! = 720 ways. This creates 7 gaps (two ends and five between boys)
- Place the 4 girls in 4 different gaps, in order:
- Total
Answer: 604800
Example 5: Cards with exactly two aces · 2 marks · Very short answerHarder exam level
How many 5-card hands from a standard deck of 52 cards contain exactly two aces? [2 marks]
Try it first, then show the solutionSolution
- Choose 2 of the 4 aces: ; choose 3 of the 48 non-aces:
- Total
Answer: 103776
Example 6: Committee with at most two women · 3 marks · Short answerHarder exam level
A committee of 5 is to be chosen from 7 men and 4 women. How many committees have at most 2 women? [3 marks]
Try it first, then show the solutionSolution
- 0 women:
- 1 woman: ; 2 women:
- Total
Answer: 371
Example 7: All or none · 3 marks · Short answerHOTS / competency
From 20 students, 8 are to be chosen for a trip. Three of them decide that either all three go or none goes. In how many ways can the group be chosen? [3 marks]
Try it first, then show the solutionSolution
- All three go: choose the other 5 from the remaining 17:
- None of them goes: choose all 8 from the other 17:
- The cases cannot overlap, so add:
Answer: 30498
Example 8: Proving Pascal's rule · 5 marks · Long answerHOTS / competency
Prove that , and give a counting explanation. [5 marks]
Try it first, then show the solutionSolution
- LHS
- Common denominator : LHS
- Counting: choose r from n + 1 people, one of whom is Asha. Selections without Asha:
- Selections with Asha: choose the other r − 1 from n: . Adding the two cases gives all selections
Answer: Proved.
Case-study practice (Section E style)
Read the situation, then answer every part. In a school exam set on the board pattern this is a 4-mark question split into 1 + 1 + 1 + 1 marks.
Designing passwords
Suppose a school portal asks for a password made of 2 different capital letters (from 26) followed by 3 different digits (from 0 to 9).
(i) · 1 mark
How many choices are there for the letter part?
Answer
Answer: 650
(ii) · 1 mark
How many choices for the digit part?
Answer
Answer: 720
(iii) · 1 mark
How many passwords in all?
Answer
Answer: 468000
by the counting principle
(iv) · 1 mark
If letters and digits may repeat, how many passwords are there?
Answer
Answer: 676000
A question paper choice
Suppose a test has Part A with 4 questions and Part B with 6 questions. A student must attempt 7 questions, at least 3 from each part.
(i) · 1 mark
List the possible splits (A, B).
Answer
Answer: (3, 4) and (4, 3)
Part A has only 4 questions and each part needs at least 3.
(ii) · 1 mark
Count the (3, 4) choices.
Answer
Answer: 60
(iii) · 1 mark
Count the (4, 3) choices.
Answer
Answer: 20
(iv) · 1 mark
Total number of ways?
Answer
Answer: 80
Add the separate cases.
Where the marks are
How a typical answer is split into step marks. Show every step: a right final answer alone rarely earns full marks.
Using the digits 1, 3, 4, 5, 7 and 8, each at most once, how many even 3-digit numbers can you form? [2 marks] (2 marks)
| Step | Marks |
|---|---|
| Units place must be 4 or 8: 2 ways | 1 |
| Tens place: 5 remaining digits; hundreds: 4. Total | 1 |
Determine n if . [3 marks] (3 marks)
| Step | Marks |
|---|---|
| 1 | |
| 1 | |
| (check: , ) | 1 |
From the letters of LOGARITHM (9 different letters), (a) how many 4-letter words with 2 vowels and 2 consonants can be formed? (b) How many arrangements of all 9 letters begin and end with a vowel? (c) In how many arrangements of all 9 letters are the vowels together? [5 marks] (5 marks)
| Step | Marks |
|---|---|
| Vowels O, A, I (3); consonants L, G, R, T, H, M (6) | 1 |
| (a) Select: ; arrange each set of 4 letters: 4! = 24; total | 1 |
| (b) First and last places: ways; the middle 7 letters: 7! = 5040 ways | 1 |
| Total | 1 |
| (c) Block of 3 vowels + 6 consonants = 7 units: 7! ways, times 3! inside: | 1 |
Where students lose marks in Permutations and Combinations
The slips examiners see most often, and what to write instead.
Mistake: Using P when order does not matter
Not asking whether swapping changes the outcome.
Wrong working
Committee of 3 from 10:
Right working
Do this: Committees, teams, selections → C; arrangements, words, numbers → P.
Usually costs: Whole question.
Mistake: Allowing 0 as the first digit
Treating all places the same.
Do this: Fill the first place first with non-zero digits.
Usually costs: 1-2 marks.
Mistake: Multiplying cases instead of adding them
Confusing 'and' with 'or'.
Do this: 'At least 3 girls' = (exactly 3) + (exactly 4): add.
Usually costs: 1-2 marks.
Mistake: Forgetting to arrange inside the block
Counting the block as one object and stopping.
Wrong working
Vowels of ARTICLE together: 5! = 120
Right working
5! × 3! = 720
Do this: Multiply by the arrangements inside the block.
Usually costs: 1 mark.
Mistake: Not dividing for repeated letters
Treating identical letters as different.
Do this: Count each letter's frequency before writing the formula.
Usually costs: 1 mark.
Mistake: Keeping an impossible root
Not checking n against the problem.
Do this: n must be a natural number at least r; reject negative or fractional values.
Usually costs: 1 mark.
NCERT exercise guide: Permutations and Combinations
What each exercise in the NCERT chapter tests, how to approach it, and a question of the same kind solved step by step. Questions here are written in our own words.
Exercise 6.1 (counting principle)
What it tests: Numbers from digits with and without repetition, codes, telephone numbers, coin tosses, flag signals.
How to approach it: Box method; restricted boxes first; multiply.
Same kind as Exercise 6.1
How many 4-letter codes can be formed from the first 8 letters of the English alphabet if no letter is repeated and every code begins with A?
Show the solutionSolution
- The first place is fixed as A; 7 letters remain
- Remaining three places:
Answer: 210
Exercises 6.2 and 6.3 (factorials and permutations)
What it tests: Evaluating factorials, nPr equations, numbers with distinct digits, words from given letters with and without repeats and with conditions.
How to approach it: Cancel factorials; use ; block and complement methods; divide by repeat factorials.
Same kind as Exercise 6.3
How many 5-digit numbers have all their digits different?
Show the solutionSolution
- First digit: 1-9 (9 ways); second: any of the 9 remaining digits including 0
- Then 8, 7 and 6 ways. Total
Answer: 27216
Exercise 6.4 and Miscellaneous Exercise (combinations)
What it tests: nCr equations, chords, teams, cards, balls, courses; mixed select-and-arrange problems, committees with 'at least', excursions with conditions.
How to approach it: Cases and products of combinations; select then arrange.
Same kind as Exercise 6.4
In how many ways can a cricket team of 11 be chosen from 16 players, of whom 6 can bowl, if the team must include exactly 4 bowlers?
Show the solutionSolution
- Choose 4 of the 6 bowlers:
- Choose the other 7 from the 10 non-bowlers: ; total
Answer: 1800
Practice questions on Permutations and Combinations
Write each answer on paper first. Open the hint only if you are stuck, and the answer only when you have finished.
Q1 · 1 mark · MCQExam level
The value of is:
(a) 90
(b) 45
(c) 80
(d) 1814400Hint
Use .
Answer
(b) 45
Q2 · 1 mark · MCQExam level
The number of arrangements of the letters of the word DELHI that begin with D is:
(a) 120
(b) 24
(c) 60
(d) 4Hint
Arrange the other four.
Answer
(b) 24
Q3 · 1 mark · Assertion-reasonExam level
Assertion (A): The number of straight lines through 15 points, no three collinear, is 105.
Reason (R): Each line is fixed by choosing 2 of the points, and order does not matter.
(a) Both true, R explains A. (b) Both true, R does not explain A. (c) A true, R false. (d) A false, R true.Hint
.
Answer
(a)
Q4 · 2 marks · Very short answerExam level
Using 6 flags of different colours, how many signals can be made if a signal uses (i) exactly 2 flags one below the other (ii) any number of flags, at least one?
Hint
Order matters.
Answer
(i) (ii)
Q5 · 2 marks · Very short answerHarder exam level
Find r if .
Hint
Write in factorials.
Answer
. Check: .
Q6 · 2 marks · Very short answerHarder exam level
In how many ways can 4 boys and 2 girls be selected from 7 boys and 5 girls?
Hint
Multiply.
Answer
.
Q7 · 2 marks · Very short answerHarder exam level
How many words can be formed from the letters of FRACTION, using each letter once, so that the vowels are together and the consonants are together?
Hint
Two blocks.
Answer
Vowels A, I, O (block, 3!); consonants F, R, C, T, N (block, 5!); the two blocks in 2! orders: .
Q8 · 3 marks · Short answerHarder exam level
In how many ways can the letters of EXAMINATION be arranged if the words start with E and end with N?
Hint
A and I appear twice among the middle letters.
Answer
Fix E first and one N last; the middle 9 letters X, A, A, M, I, I, N, T, O have A twice and I twice: .
Q9 · 3 marks · Short answerHarder exam level
A bag has 6 black and 7 red balls. In how many ways can 2 black and 3 red balls be selected? How many of these selections include a particular red ball?
Hint
Fix the particular ball.
Answer
. With a particular red ball: .
Q10 · 3 marks · Short answerHOTS / competency
How many triangles can be formed from 10 points of which exactly 4 lie on one straight line (no other three collinear)?
Hint
Subtract the 'triangles' made from collinear points.
Answer
.
Q11 · 2 marks · Very short answerHOTS / competency
If the letters A, C, T are arranged in all possible ways and the words listed as in a dictionary, what is the rank of CAT? Generalise: how would you find the rank of a word with distinct letters?
Hint
Count words before it.
Answer
Words starting with A: 2! = 2 (ACT, ATC). Then CAT comes first among words starting with C, so its rank is 3. In general, for each position count the arrangements of the remaining letters that start with a smaller letter, add them all, then add 1.
Test your recall
Answer in your head or on paper first, then open the card. Pulling an answer out of memory makes it stick far better than re-reading.
1.What is 0!?Show answer
1.
2.Write in factorials.Show answer
.
3.How are and related?Show answer
.
4.Arrangements of the letters of BANANA?Show answer
.
5.Value of ?Show answer
.
6.Diagonals in an octagon?Show answer
.
7.State Pascal's rule.Show answer
.
8.Number of 3-letter arrangements of 5 letters with repetition?Show answer
.
Best order to study it
- Learn the counting principle with the box method.
- Practise factorials and simplifying factorial expressions.
- Learn the formula for and its proof.
- Practise arrangements with conditions (fixed, together, not together).
- Learn arrangements with identical objects.
- Learn , its link with , and its properties.
- Practise selections with 'exactly', 'at least' and 'at most'.
- Finish with mixed 'select then arrange' problems.
Quick revision checklist
The night before the exam: can you do each of these without looking?
- Can you state and use the fundamental principle of counting?
- Can you simplify expressions like ?
- Can you derive ?
- Can you count numbers with restrictions on digits?
- Can you count words with letters together or not together?
- Can you count arrangements with repeated letters?
- Can you derive from ?
- Can you solve and ratio equations?
- Can you count committees with 'at least' conditions?
- Can you decide whether a question needs P or C?
Permutations and Combinations: frequently asked questions
How do I decide between permutation and combination?
Imagine swapping two of the chosen items. If the outcome changes (a different number, word or ranking), order matters: permutation. If it stays the same (same team, same pizza), order does not matter: combination.
Why is 0! equal to 1?
It makes the formulae work in edge cases: ^nP_n = \frac{n!}{0!} must equal n!, and ^nC_0 = \frac{n!}{0!\,n!} must equal 1 (there is exactly one way to choose nothing).
Is anything from this chapter removed for 2026-27?
No. The whole chapter (counting principle, factorials, permutations, combinations and their simple applications) is in the 2026-27 CBSE syllabus.
Why do we add cases and not multiply them?
Cases such as 'exactly 3 girls' and 'exactly 4 girls' cannot both happen at once; any committee is in exactly one case. Counts of separate, non-overlapping cases are added. We multiply only for stages that happen together, one after another.
How is the Class 11 Maths exam set?
It is a school annual exam of 80 marks (3 hours) plus 20 marks of internal assessment; Unit II, Algebra, which includes this chapter, carries 25 marks. CBSE gives no Class 11 sample paper, so schools usually mix MCQs, assertion-reason, short and long answers and case-based questions.
Based on: CBSE Mathematics (041) syllabus 2026-27 (Classes XI-XII); NCERT Mathematics, Textbook for Class XI, Chapter 6 (Reprint 2026-27)