Solutions for Class 11 Mathematics: 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.
Practice Class 11 Mathematics Solutions: Chapter 05 Permutation Combination
Navigate directly to the solved Mathematics textbook exercises using the digital viewer below. Each solution includes detailed step-by-step explanations, allowing students to instantly cross-check their work and identify areas requiring further revision.
Archives Objective Type
Question Fill in the blanks 1.
Fill in the blanks. In a certain test, \(a_i\) students gave wrong answers to at least \(i\) questions, where \(i=1,2,\ldots,k\). No student gave more than \(k\) wrong answers. The total number of wrong answers given is ______. (IIT-JEE, 1982)Solution.
Answer: \(a_1+a_2+a_3+\cdots+a_k\)Number of students who gave wrong answers to exactly one question is \(a_1-a_2\).
Number of students who gave wrong answers to exactly two questions is \(a_2-a_3\).
Number of students who gave wrong answers to exactly three questions is \(a_3-a_4\).
Number of students who gave wrong answers to exactly \(k\) question is \(a_{k-1}-a_k\) (and \(a_k\) gave exactly \(k\) wrong answers).
Therefore, total number of wrong answers is
\(1(a_1-a_2)+2(a_2-a_3)+3(a_3-a_4)+\cdots+k(a_{k-1}-a_k)=a_1+a_2+a_3+\cdots+a_k\)
Teacher's Note: Count students with exactly j wrong answers as a_j - a_(j+1) and sum j times these.
Exam Note: Telescoping sum gives a1 + a2 + ... + ak.
Question Fill in the blanks 2.
Fill in the blanks. The sides \(AB,BC\) and \(CA\) of a triangle \(ABC\) have 3, 4 and 5 interior points, respectively on them. The number of triangles that can be constructed using these interior points as vertices is ______. (IIT-JEE, 1984)Solution.
Answer: 205We have total \(3+4+5=12\) points. So, number of triangles that can be formed using 12 such points is given by
Total number of ways of selecting three point - Number of ways three collinear points are selected
\(={}^{12}C_3-{}^3C_3-{}^4C_3-{}^5C_3=\dfrac{12\times11\times10}{6}-1-4-\dfrac{5\times4}{2\times1}=220-15=205\)
Teacher's Note: Choose three of 12 points, subtract collinear triples on each side.
Exam Note: 220 - 1 - 4 - 10 = 205.
Question Fill in the blanks 3.
Fill in the blanks. The total number of ways in which six '+' and four '−' signs can be arranged in a line such that no two '−' signs occur together is ______. (IIT-JEE, 1988)Solution.
Answer: 35'+' signs can be put in a row in one way creating seven gaps shown as arrows: [Fig. 5.57: six plus signs with an arrow in each of the seven gaps.]
Now 4 '-' signs must be kept in these gaps. So, no two '-' signs should be together.
Out of these 7 gaps 4 can be chosen in \({}^7C_4\) ways. Hence, required number of arrangements is
\({}^7C_4={}^7C_3=\dfrac{7\times6\times5}{3\times2\times1}=35\)
Teacher's Note: Put the six plus signs down, choose four of the seven gaps for minus signs.
Exam Note: 7C4 = 35.
Question Fill in the blanks 4.
Fill in the blanks. There are four balls of different colours and four boxes of colours same as those of the balls. The number of ways in which the balls, one each in a box, could be placed such that a ball does not go to a box of its own colour is ______. (IIT-JEE, 1992)Solution.
Answer: 9We know that number of derangements of \(n\) objects is
\(n!\left[1-\dfrac1{1!}+\dfrac1{2!}-\dfrac1{3!}+\dfrac1{4!}-\cdots+\dfrac{(-1)^n}{n!}\right]\)
Therefore, number of ways of putting all the 4 balls into boxes of different colour is
\(4!\left[1-\dfrac1{1!}+\dfrac1{2!}-\dfrac1{3!}+\dfrac1{4!}\right]=4!\left(\dfrac12-\dfrac16+\dfrac1{24}\right)=24\left(\dfrac{12-4+1}{24}\right)=9\)
Teacher's Note: A ball never going to its own box is a derangement of 4 objects.
Exam Note: D4 = 9.
Question True or false 1.
True or false. The product of any \(r\) consecutive natural numbers is always divisible by \(r!\). (IIT-JEE, 1985)Solution.
Answer: TrueSee the proof in theory section in properties of \({}^nC_r\). (The product of \(r\) consecutive natural numbers is \(r!\) times a binomial coefficient.)
Teacher's Note: Product of r consecutive numbers equals r! times a binomial coefficient.
Exam Note: Divisibility follows from an integer nCr.
Question MCQ 1.
Multiple choice questions with one correct answer. If \({}^nC_{r-1}=36,\ {}^nC_r=84\) and \({}^nC_{r+1}=126\), then \(r\) is(a) 1
(b) 2
(c) 3
(d) none of these
Solution.
Answer: (c)\({}^nC_{r-1}=36,\ {}^nC_r=84,\ {}^nC_{r+1}=126\)
We know that
\(\dfrac{{}^nC_{r-1}}{{}^nC_r}=\dfrac{r}{n-r+1}\)
\(\Rightarrow\dfrac{36}{84}=\dfrac{r}{n-r+1}\)
\(\Rightarrow\dfrac{r}{n-r+1}=\dfrac37\)
\(\Rightarrow 3n-10r+3=0\qquad(1)\)
Also,
\(\dfrac{{}^nC_r}{{}^nC_{r+1}}=\dfrac{r+1}{n-r}=\dfrac{84}{126}=\dfrac23\)
\(\Rightarrow 2n-5r-3=0\qquad(2)\)
Solving (1) and (2), we get \(n=9\) and \(r=3\).
Teacher's Note: Use the ratio of consecutive binomial coefficients twice to get two linear equations.
Exam Note: n = 9 and r = 3.
Question MCQ 2.
Multiple choice questions with one correct answer. Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. The number of words, which have at least one letter repeated is(a) 59720
(b) 79260
(c) 69760
(d) none of these
Solution.
Answer: (c)Number of words when repetition is allowed is \(10\times10\times10\times10\times10=10^5\). [Fig. 5.58: five boxes with 10 choices each.]
Number of words when repetition is not allowed is \(10\times9\times8\times7\times6=30240\). [Fig. 5.59: five boxes with 10, 9, 8, 7, 6 choices.]
Hence, required number of words in which at least one letter is repeated is \(100000-30240=69760\).
Teacher's Note: All words minus those with all letters different.
Exam Note: 10^5 - 30240 = 69760.
Question MCQ 3.
Multiple choice questions with one correct answer. The value of the expression \({}^{47}C_4+\sum_{j=1}^{5}{}^{52-j}C_3\) is equal to(a) \({}^{47}C_5\)
(b) \({}^{52}C_5\)
(c) \({}^{52}C_4\)
(d) none of these
Solution.
Answer: (c)\({}^{47}C_4+\sum_{j=1}^{5}{}^{52-j}C_3\)
\(={}^{47}C_4+{}^{51}C_3+{}^{50}C_3+{}^{49}C_3+{}^{48}C_3+{}^{47}C_3\)
\(={}^{51}C_3+{}^{50}C_3+{}^{49}C_3+{}^{48}C_3+{}^{47}C_3+{}^{47}C_4\) [Using \({}^nC_r+{}^nC_{r+1}={}^{n+1}C_{r+1}\)]
\(={}^{51}C_3+{}^{50}C_3+{}^{49}C_3+({}^{48}C_3+{}^{48}C_4)\)
\(={}^{51}C_3+{}^{50}C_3+({}^{49}C_3+{}^{49}C_4)\)
\(={}^{51}C_3+({}^{50}C_3+{}^{50}C_4)\)
\(={}^{51}C_3+{}^{51}C_4\)
\(={}^{52}C_4\)
Teacher's Note: Combine terms repeatedly with Pascal's rule.
Exam Note: The sum collapses to 52C4.
Question MCQ 4.
Multiple choice questions with one correct answer. Eight chairs are numbered 1 to 8. Two women and three men wish to occupy one chair each. First, the women choose the chairs from amongst the chairs marked 1 to 4, and then the men select the chairs from amongst the remaining. The number of possible arrangements is(a) \({}^6C_3\times{}^4C_2\)
(b) \({}^4P_2\times{}^4P_3\)
(c) \({}^4C_2+{}^4P_3\)
(d) none of these
Solution.
Answer: (d)[Chairs 1 to 8 in a row.]
Two women can choose two chairs out of 1, 2, 3, 4 in \({}^4C_2\) ways, and can arrange among themselves in 2! ways. Three men can choose 3 chairs out of 6 remaining chairs in \({}^6C_3\) ways and can arrange themselves in 3! ways.
Therefore, total number of possible arrangements is \({}^4C_2\times2!\times{}^6C_3\times3!={}^4P_2\times{}^6P_3\), which is none of the options.
Teacher's Note: Women pick two of chairs 1 to 4, men then pick three of the six left.
Exam Note: 4P2 times 6P3, not listed.
Question MCQ 5.
Multiple choice questions with one correct answer. In a group of boys, two boys are brothers and six more boys are present in the group. In how many ways can they sit if the brothers are not to sit along with each other?(a) \(2\times 6!\)
(b) \({}^7P_2\times 6!\)
(c) \({}^7C_2\times 6!\)
(d) none of these
Solution.
Answer: (b)[Seating: X B1 X B2 X B3 X B4 X B5 X B6 X, where X marks the places for the brothers.]
Let first six boys sit, which can be done in \(6!\) ways. Once they have been seated, the two brothers can be made to occupy seats in between or in extreme (i.e. on crosses) in \({}^7P_2\) ways.
Hence, required number of ways is \({}^7P_2\times6!\).
Teacher's Note: Seat the six other boys, then put the brothers in two of the seven gaps.
Exam Note: 7P2 times 6!.
Question MCQ 6.
Multiple choice questions with one correct answer. A five-digit number divisible by 3 is to be formed using the digits 0, 1, 2, 3, 4 and 5, without repetition. The total number of ways this can be done is(a) 216
(b) 240
(c) 600
(d) 3125
Solution.
Answer: (a)We know that a number is divisible by 3 if the sum of its digits is divisible by 3. Now out of 0, 1, 2, 3, 4, 5 if we take 1, 2, 3, 4, 5 or 0, 1, 2, 4, 5, then the 5-digit numbers will be divisible by 3.
Case I: Total number of five-digit numbers formed using the digits 1, 2, 3, 4, 5 is \(5!=120\).Case II: Taking 0, 1, 2, 4, 5, total number is \(4\times4!=96\). [Fig. 5.60: five boxes with 4, 4, 3, 2, 1 choices.]From case I and case II, total number divisible by 3 is \(120+96=216\).
Teacher's Note: Digit sum must be divisible by 3: omit 0 or omit 3 from the six digits.
Exam Note: 120 + 96 = 216.
Question MCQ 7.
Multiple choice questions with one correct answer. An \(n\)-digit number is a positive number with exactly \(n\) digits. Nine hundred distinct \(n\)-digit numbers are to be formed using only the three digits 2, 5 and 7. The smallest value of \(n\) for which this is possible is(a) 6
(b) 7
(c) 8
(d) 9
Solution.
Answer: (b)Distinct \(n\)-digit numbers which can be formed using digits 2, 5 and 7 (or 8) are \(3^n\). We have to find \(n\) so that
\(3^n\ge900\)
\(\Rightarrow3^{n-2}\ge100\)
\(\Rightarrow n-2\ge5\)
\(\Rightarrow n\ge7\)
So the least value of \(n\) is 7.
Teacher's Note: There are 3^n numbers; find the smallest n with 3^n at least 900.
Exam Note: 3^6 = 729 is too small, 3^7 works.
Question MCQ 8.
Multiple choice questions with one correct answer. How many different nine-digit numbers can be formed from the number 223355888 by rearranging its digits so that the odd digits occupy even positions?(a) 16
(b) 36
(c) 60
(d) 180
Solution.
Answer: (c)X - X - X - X - X
The four digits 3, 3, 5, 5 can be arranged at (-) places in \(\dfrac{4!}{2!\,2!}=6\) ways. The five digits 2, 2, 8, 8, 8 can be arranged at (X) place in \(\dfrac{5!}{2!\,3!}=10\) ways.
Total number of arrangements is \(6\times10=60\).
Teacher's Note: Odd digits fill the four even positions; even digits fill the five odd positions.
Exam Note: 6 times 10 = 60.
Question MCQ 9.
Multiple choice questions with one correct answer. Let \(T_n\) denote the number of triangles, which can be formed using the vertices of a regular polygon of \(n\) sides. If \(T_{n+1}-T_n=21\), then \(n\) equals(a) 5
(b) 7
(c) 6
(d) 4
Solution.
Answer: (b)A regular polygon of \(n\) sides has \(n\) vertices, no two of which are collinear. Out of these \(n\) points, \({}^nC_3\) triangles can be formed.
\(\therefore\ T_n={}^nC_3;\ T_{n+1}={}^{n+1}C_3\)
Given,
\(T_{n+1}-T_n=21\)
\(\Rightarrow{}^{n+1}C_3-{}^nC_3=21\)
\(\Rightarrow\dfrac{(n+1)n(n-1)}{3\times2\times1}-\dfrac{n(n-1)(n-2)}{3\times2\times1}=21\)
\(\Rightarrow n(n-1)(n+1-n+2)=126\)
\(\Rightarrow n(n-1)=42\)
\(\Rightarrow n(n-1)=7\times6\)
\(\Rightarrow n=7\)
Teacher's Note: Triangles number nC3; the difference is nC2.
Exam Note: nC2 = 21 gives n = 7.
Question MCQ 10.
Multiple choice questions with one correct answer. The number of arrangements of the letters of the word 'BANANA' in which the two Ns do not appear adjacently is(a) 40
(b) 60
(c) 80
(d) 100
Solution.
Answer: (a)Total number of ways of arranging the letters of the word BANANA is \(\dfrac{6!}{2!\,3!}=60\).
Number of words in which 2 N's come together is \(5!/3!=20\).
Hence, the required number is \(60-20=40\).
Teacher's Note: Subtract arrangements with the two N's together from all arrangements.
Exam Note: 60 - 20 = 40.
Question MCQ 11.
Multiple choice questions with one correct answer. A rectangle with sides \(2m-1\) and \(2n-1\) is divided into squares of unit length by drawing parallel lines as shown in the diagram, then the number of rectangles possible with odd side lengths is(a) \((m+n-1)^2\)
(b) \(4^{m+n-1}\)
(c) \(m^2n^2\)
(d) \(m(m+1)n(n+1)\)
Solution.
Answer: (c)[Fig. 5.61: the rectangle with vertical lines 1, 2, ..., 2m and horizontal lines 1, 2, ..., 2n.]
If we see the blocks in terms of lines, then there are \(2m\) vertical lines and \(2n\) horizontal lines.
To form the required rectangle we must select two horizontal lines, one even numbered (out of 2, 4, ..., 2n) and one odd numbered (out of 1, 3, ..., 2n - 1) and similarly two vertical lines.
The number of rectangles is \({}^mC_1\times{}^mC_1\times{}^nC_1\times{}^nC_1=m^2n^2\).
Teacher's Note: Odd side length needs one odd-numbered and one even-numbered line in each direction.
Exam Note: m choices times m times n times n.
Question MCQ 12.
Multiple choice questions with one correct answer. If \(r,s,t\) are prime numbers and \(p,q\) are the positive integers such that the LCM of \(p,q\) is \(r^2t^4s^2\), then the number of ordered pair \((p,q)\) is(a) 252
(b) 254
(c) 225
(d) 224
Solution.
Answer: (c)If L.C.M. of \(p\) and \(q\) is \(r^2t^4s^2\), then distribution of factors \(r\) is as follows:
| \(p\) | \(q\) |
|---|---|
| \(r^0\) | \(r^2\) |
| \(r^1\) | \(r^2\) |
| \(r^2\) | \(r^2\) |
| \(r^2\) | \(r^0\) |
| \(r^2\) | \(r^1\) |
Thus, factor \(r\) can be distributed in \(2\times3-1\) ways. Similarly, factors \(t\) and \(s\) can be distributed in \(2\times5-1\) and \(2\times3-1\) ways, respectively.
Hence, number of ordered pairs are \((2\times3-1)\times(2\times5-1)\times(2\times3-1)=225\).
Teacher's Note: For each prime with exponent e in the LCM, ordered exponent pairs number 2e + 1.
Exam Note: 5 times 9 times 5 = 225.
Question MCQ 13.
Multiple choice questions with one correct answer. The letters of the word 'COCHIN' are permuted and all the permutations are arranged in an alphabetical order as in English dictionary. The number of words that appear before the word 'COCHIN' is(a) 360
(b) 192
(c) 96
(d) 48
Solution.
Answer: (c)The letters of word COCHIN in alphabetic order are C, C, H, I, N, O. Fixing first letter C and keeping C at second place, rest 4 can be arranged in \(4!\) ways.
Similarly, the total number of words starting with CH, CI, CN is \(4!\) in each case.
Then fixing first two letters as CO, next four places when filled in alphabetic order gives the word COCHIN.
Therefore, number of words coming before COCHIN is \(4\times4!=4\times24=96\).
Teacher's Note: Count words alphabetically before COCHIN by two-letter prefixes CC, CH, CI, CN.
Exam Note: Four prefixes, 4! words each.
Question MCQ 14.
Multiple choice questions with one correct answer. Let \(S=\{1,2,3,4\}\). The total number of unordered pairs of disjoint subsets of \(S\) is equal to(a) 25
(b) 34
(c) 42
(d) 41
Solution.
Answer: (d)Total number of unordered pairs of disjoint subsets \(=\dfrac{3^4+1}{2}=41\).
Teacher's Note: Each element is in A, in B or in neither: 3^4 ordered pairs, halve with the equal pair.
Exam Note: (3^4 + 1)/2 = 41.
Free study material for Mathematics
Cengage G Tewani Solutions for Class 11 Mathematics: Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Archives Objective Type
Chapter-wise Cengage G Tewani Solutions: Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Archives Objective Type
Access the complete chapter-wise PDF for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Archives Objective Type. These structured Cengage G Tewani Solutions solutions for Class 11 Mathematics help students build foundational accuracy and prepare effectively for upcoming school evaluations.
Mastering Core Concepts with Cengage G Tewani Solutions
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.
Explore More Study Resources for Class 11 Math
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.