Download Class 11 Mathematics Textbook Solutions: Chapter 05 Permutation Combination
Explore reliable textbook solutions for Chapter 05 Permutation Combination tailored for Class 11 learners using methodologies. Utilizing these Mathematics answers ensures thorough preparation and strengthens foundational knowledge before final school evaluations.
Access Textbook Answers and Solutions
View or download the dedicated Chapter 05 Permutation Combination solution resource below. Engaging with these textbook answers under focused study conditions ensures continuous academic progress and mastery of the 2026 curriculum for Mathematics.
Archives Subjective Type
Question 1. (i) In how many ways can a pack of 52 cards be divided equally among four players?
(ii) In how many ways can you divide these cards in four sets, three of them having 17 cards each and the fourth one just one card? (IIT-JEE, 1979)
Solution.
(i) Distribution of 52 cards can be equally divided amongst four players. [Fig. 5.53: 52 cards split into four groups of 13.]
Hence, number of ways is \(\dfrac{52!}{(13!)^4\,4!}\times4!=\dfrac{52!}{(13!)^4}\).
(ii) [Fig. 5.54: 52 cards split into groups of 17, 17, 17 and 1.]
Number of divisions is \(\dfrac{52!}{(17!)^3\,1!\,3!}\).
Note: There is division by \(3!\) since 3 groups can be arranged in \(3!\) ways and here 3 groups are of equal number of cards.Teacher's Note: Divide into labelled groups for players; unlabelled groups need division by the repeated group count.
Exam Note: Equal groups need the extra 3! division.
Question 2. Six Xs have to be placed in the squares of figure below in such a way that each row contains at least one X. In how many different ways can this be done? (IIT-JEE, 1978)
Solution.
As all the X's are identical, the question is of selection of 6 squares from 8 squares, so that no row remains empty. Here \(R_1\) has 2 squares, \(R_2\) has 4 squares and \(R_3\) has 2 squares. The selection scheme is as follows: [Fig. 5.55]
| \(R_1\) | \(R_2\) | \(R_3\) |
|---|---|---|
| 1 | 4 | 1 |
| 1 | 3 | 2 |
| 2 | 3 | 1 |
| 2 | 2 | 2 |
Therefore, number of selection is \({}^2C_1\times{}^4C_4\times{}^2C_1+{}^2C_1\times{}^4C_3\times{}^2C_2+{}^2C_2\times{}^4C_3\times{}^2C_1+{}^2C_2\times{}^4C_2\times{}^2C_2=4+8+8+6=26\).
Teacher's Note: Choose 6 of the 8 squares so each row is used, counting by row loads.
Exam Note: 4 + 8 + 8 + 6 = 26.
Question 3. Five balls of different colours are to be placed in the boxes of different size. Each box can hold all five. In how many different ways can we place the balls so that no box remains empty? (IIT-JEE, 1981)
Solution.
As no box should remain empty, boxes can have balls in the following numbers: Possibilities 1, 2, 3 or 1, 2, 2 [Fig. 5.56: tree (i) splitting 5 balls into 1, 1, 3 and tree (ii) splitting 5 balls into 1, 2, 2.]
Division ways for tree (i) is \(\dfrac{5!}{(1!)^2\,3!\,2!}\)
Division ways for tree (ii) is \(\dfrac{5!}{(2!)^2\,1!\,2!}\)
Now, total number of ways of distribution of these groups into three boxes is
\(\left[\dfrac{5!}{(1!)^2\,3!\,2!}+\dfrac{5!}{(2!)^2\,1!\,2!}\right]\times3!=150\)
Teacher's Note: Split five balls as 1,1,3 or 1,2,2 into groups, then assign groups to the three different boxes.
Exam Note: (10 + 15) times 3! = 150.
Question 4. \(m\) men and \(n\) women are to be seated in a row so that no two women sit together. If \(m>n\), then show that the number of ways in which they can be seated is \(m!\,(m+1)!/(m-n+1)!\). (IIT-JEE, 1983)
Solution.
\(m\) men can be seated in \(m!\) ways creating \((m+1)\) places for ladies to sit. \(n\) ladies out of \((m+1)\) places (as \(n<m\)) can be seated in \({}^{m+1}P_n\) ways.
Therefore, total number of ways is
\(m!\times{}^{m+1}P_n=m!\times\dfrac{(m+1)!}{(m+1-n)!}=\dfrac{(m+1)!\,m!}{(m-n+1)!}\)
Teacher's Note: Seat the men first, then place the women in distinct gaps.
Exam Note: Gap method: m! times (m+1)Pn.
Question 5. Seven relatives of a man comprises four ladies and three gentlemen; his wife has also seven relatives—three of them are ladies and four gentlemen. In how many ways can they invite 3 ladies and 3 gentlemen at a dinner party so that there are three man's relatives and three wife's relatives? (IIT-JEE, 1985)
Solution.
The scheme is as follows:
| Husband's relatives | Wife's relatives | Number of selections | ||
|---|---|---|---|---|
| Male (3) | Female (4) | Male (4) | Female (3) | |
| 3 | 0 | 0 | 3 | \({}^3C_3\times{}^3C_3=1\) |
| 2 | 1 | 1 | 2 | \({}^3C_2\times{}^4C_1\times{}^4C_1\times{}^3C_2=144\) |
| 1 | 2 | 2 | 1 | \({}^3C_1\times{}^4C_2\times{}^4C_2\times{}^3C_1=324\) |
| 0 | 3 | 3 | 0 | \({}^4C_3\times{}^4C_3=16\) |
| Total | 485 | |||
Teacher's Note: Case on how many gentlemen come from the man's relatives; ladies make up the rest.
Exam Note: 1 + 144 + 324 + 16 = 485.
Question 6. A box contains two white balls, three black balls and four red balls. In how many ways can three balls be drawn from the box if at least one black ball is to be included in the draw? (IIT-JEE, 1986)
Solution.
Out of 2 white, 3 black and 4 red balls, three balls have to be drawn.
If at least one black ball is selected, then we have following cases:
| Black balls (3) | White + red balls (6) | Number of ways of selection |
|---|---|---|
| 1 | 2 | \({}^3C_1\times{}^6C_2=45\) |
| 2 | 1 | \({}^3C_2\times{}^6C_1=18\) |
| 3 | 0 | \({}^3C_3\times{}^6C_0=1\) |
| Total | 64 |
Teacher's Note: Case on the number of black balls drawn: 1, 2 or 3.
Exam Note: 45 + 18 + 1 = 64.
Question 7. A student is allowed to select almost \(n\) books from a collection of \(2n+1\) books. If the total number of ways in which he can select at least one book is 63, find the value of \(n\). (IIT-JEE, 1987)
Solution.
Number of ways in which a student can select at least one and at most \(n\) books out of \(2n+1\) books is
\({}^{2n+1}C_1+{}^{2n+1}C_2+{}^{2n+1}C_3+\cdots+{}^{2n+1}C_n\)
\(=\dfrac12\left[2\times{}^{2n+1}C_1+2\times{}^{2n+1}C_2+2\times{}^{2n+1}C_3+\cdots+2\times{}^{2n+1}C_n\right]\)
\(=\dfrac12\left[({}^{2n+1}C_1+{}^{2n+1}C_{2n})+({}^{2n+1}C_2+{}^{2n+1}C_{2n-1})+({}^{2n+1}C_3+{}^{2n+1}C_{2n-2})+\cdots+({}^{2n+1}C_n+{}^{2n+1}C_{n+1})\right]\)
[Using \({}^nC_r={}^nC_{n-r}\)]
\(=\dfrac12\left[{}^{2n+1}C_1+{}^{2n+1}C_2+\cdots+{}^{2n+1}C_n+{}^{2n+1}C_{n+1}+{}^{2n+1}C_{n+2}+\cdots+{}^{2n+1}C_{2n}\right]\)
\(=\dfrac12\left[{}^{2n+1}C_0+{}^{2n+1}C_1+{}^{2n+1}C_2+\cdots+{}^{2n+1}C_{2n+1}-1-1\right]\)
\(=\dfrac12\left[2^{2n+1}-2\right]=2^{2n}-1\)
Now given,
\(2^{2n}-1=63\)
\(\Rightarrow2^{2n}=64=2^6\)
\(\Rightarrow2n=6\)
\(\Rightarrow n=3\)
Teacher's Note: Use symmetry of binomial coefficients to get 2^(2n) - 1 selections.
Exam Note: 2^(2n) - 1 = 63 gives n = 3.
Question 8. A number of 18 guests have to be seated, half on each side of a long table. Four particular guests desire to sit on one particular side and three others on the other side. Determine the number of ways in which the sitting arrangements can be made. (IIT-JEE, 1991)
Solution.
Out of 18 guests, 9 are to be seated on side A and rest 9 on side B.
Now out of 18 guests, 4 particular guests desire to sit on one particular side say side A and other 3 on other side B. Out of rest \(18-4-3=11\) guests we can select 5 more for side A and rest 6 can be seated on side B. Selection of 5 out of 11 can be done in \({}^{11}C_5\) ways. Nine guests on each side of table can be seated in \(9!\times9!\) ways.
Thus, there are total \({}^{11}C_5\times9!\times9!\) arrangements.
Teacher's Note: Fix the four and three guests to their sides, choose the other five for side A, then arrange.
Exam Note: 11C5 times 9! times 9!.
Question 9. A committee of 12 is to be formed from nine women and eight men. In how many ways can this be done if at least five women have to be included in a committee? In how many of these committees
a. the women hold majority?
b. the men hold majority? (IIT-JEE, 1994)
Solution.
A committee of 12 is to be formed from 9 women and 8 men with minimum 5 women. Then we have following selection ways.
| Women (9) | Men (8) | Number of ways of selecting |
|---|---|---|
| 5 | 7 | \({}^9C_5\times{}^8C_7=1008=s_1\) |
| 6 | 6 | \({}^9C_6\times{}^8C_6=2352=s_2\) |
| 7 | 5 | \({}^9C_7\times{}^8C_5=2016=s_3\) |
| 8 | 4 | \({}^9C_8\times{}^8C_4=630=s_4\) |
| 9 | 3 | \({}^9C_9\times{}^8C_3=56=s_5\) |
| Total | 6062 |
a. Number of committee when women are in majority is \(s_3+s_4+s_5=2702\).
b. Number of committee when men are in majority is \(s_1=1008\).
Teacher's Note: Case on the number of women (5 to 9) in a committee of 12.
Exam Note: Total 6062; women majority 2702; men majority 1008.
Question 10. Prove by permutation or otherwise that \((n^2)!/(n!)^n\) is an integer \((n\in I^+)\). (IIT-JEE, 2004)
Solution.
Let there be \(n\) sets of different objects each set containing \(n\) identical objects, e.g., \(((1,1,1,\ldots,1\ (n\text{ times})),\ (2,2,2,\ldots,2\ (n\text{ times})),\ \ldots,\ (n,n,n,\ldots,n\ (n\text{ times})))\). Then the number of ways in which these \(n\times n=n^2\) objects can be arranged in a row is
\(\dfrac{(n^2)!}{n!\,n!\cdots n!}=\dfrac{(n^2)!}{(n!)^n}\)
But, these number of ways should be a natural number. Hence, \((n^2)!/(n!)^n\) is an integer \((n\in I^+)\).
Teacher's Note: Count arrangements of n kinds of objects with n copies each; a count is an integer.
Exam Note: Multinomial coefficient is an integer.
Free study material for Mathematics
Class 11 Mathematics: Cengage G Tewani Solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Archives Subjective Type
Complete Math Solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Archives Subjective Type
Review detailed solutions for Class 11 Mathematics. The Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Archives Subjective Type PDF provides comprehensive answers mapped to standard Cengage G Tewani Solutions textbooks, ensuring targeted revision for weekly tests and terminal exams.
Concept-Driven Math Answers
Beyond providing the final numerical answer, these guides break down the underlying mathematical principles. Cross-referencing completed work with these structured explanations helps eliminate calculation errors and reinforces conceptual clarity.
Next Steps in Your Mathematics Revision
In addition to these Cengage G Tewani Solutions chapters, students can explore a wider library of free online mock tests, printable sample papers, and short revision notes aligned with the 2026 academic session.
FAQs
They are chapter-wise solved questions from the book for Class 11 Mathematics. Each answer is explained step by step so you can check your work and revise.
Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.
Try each question on your own first, then read the solution. Use it to check your steps, correct mistakes and learn how a full answer is written.
Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.
Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.
They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.