Official Textbook Solutions: 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.
Chapter-wise Solutions for Mathematics: Chapter 05 Permutation Combination
Access the complete solution PDF for Class 11 Mathematics below. Regular practice with these targeted textbook answers builds familiarity with standard question patterns and helps secure higher marks in final school evaluations.
Integer Type
Question 1. If \({}^nP_r={}^nP_{r+1}\) and \({}^nC_r={}^nC_{r-1}\), then the value of \(n+r\) is.
Solution.
Answer: 5\({}^nP_r={}^nP_{r+1}\)
\(\Rightarrow\dfrac{n!}{(n-r)!}=\dfrac{n!}{(n-r-1)!}\Rightarrow n-r=1\qquad(1)\)
Again \({}^nC_r={}^nC_{r-1}=\dfrac{n!}{(n-r)!\,r!}=\dfrac{n!}{(n-r+1)!\,(r-1)!}\)
\(\Rightarrow\dfrac1r=\dfrac1{n-r+1}\Rightarrow n-2r=-1\qquad(2)\)
Solving (1) and (2), \(n=3,\ r=2\).
Teacher's Note: Equate the permutation and combination conditions to get two linear equations in n and r.
Exam Note: n = 3, r = 2.
Question 2. A person has \('n'\) friends. The minimum value of \('n'\) so that a person can invite a different pair of friends every day for four weeks in a row is.
Solution.
Answer: 8We have \({}^nC_2=28\)\(\Rightarrow n=8\) (as there are 7 days in week).
Teacher's Note: Four weeks need 28 distinct pairs, so nC2 = 28.
Exam Note: nC2 = 28 gives n = 8.
Question 3. There are \(n\) distinct white and \(n\) distinct black balls. If the number of ways of arranging them in a row so that neighboring balls are of different colors is 1152 then value of \('n'\) is.
Solution.
Answer: 4Number of arrangements are \(2\,n!\,n!\). Given that \(2\,n!\,n!=1152\)\(\Rightarrow(n!)^2=576\)\(\Rightarrow n!=24\)\(\Rightarrow n=4\).
Teacher's Note: Colours alternate: two starting colours, n! arrangements of each colour.
Exam Note: 2 (n!)^2 = 1152.
Question 4. Numbers from 1 to 1000 are divisible by 60 but not by 24 is.
Solution.
Answer: 8Let \(n(A)\) = number divisible by 60 \(=(60,120,\ldots,960)=16\).
\(n(B)\) = number divisible by 24 \(=(24,48,\ldots,984)=41\).
\(n(A\cap B)\) = number divisible by both \(=120+240+\cdots+960=8\).
Hence \(n(A-B)=n(A)-n(A\cap B)=16-8=8\).
Teacher's Note: Multiples of 60 below 1000, minus those that are multiples of lcm(60,24) = 120.
Exam Note: 16 - 8 = 8.
Question 5. Number of ways in which the letters of the word 'ABBCABBC' can be arranged such that the word ABBC does not appear is any word, is \(N\) then the value of \((N^{1/2}-10)\) is.
Solution.
Answer: 9We have \(A's=2;\ B's=4;\ C's=2\).
Total words formed \(=\dfrac{8!}{4!\,2!\,2!}=420\qquad(1)\)
Let ABBC = 'x'.
Number of ways in which x ABBC can be arranged \(=\dfrac{5!}{2!}=60\) but this includes x ABBC and ABBC x.
But the word ABBCABBC is counted twice in 60 hence it should be 59.
Hence required number of ways \(=420-59=361\), so \(N^{1/2}-10=19-10=9\).
Teacher's Note: Subtract words containing ABBC (counting ABBCABBC once) from all arrangements.
Exam Note: 420 - 59 = 361.
Question 6. A class has three teachers, Mr. P, Ms. Q and Mrs. R and six students A, B, C, D, E, F. Number of ways in which they can be seated in a line of 9 chairs, if between any two teachers there are exactly two students, is \(k!(18)\), then the value of \(k\) is.
Solution.
Answer: 6Let T and S denotes teacher and student respectively. Then we have following possible patterns according to question:
(i) T S S T S S T S S
(ii) S T S S T S S T S
(iii) S S T S S T S S T
Hence total number of arrangements are \(3\cdot(3!)\,6!=18\times6!\) \(\Rightarrow k=6\).
Teacher's Note: Teachers sit with exactly two students between them: three possible patterns.
Exam Note: 3 patterns times 3! times 6!.
Question 7. Consider the five points comprising of the vertices of a square and the intersection point of its diagonals. How many triangles can be formed using these points?
Solution.
Answer: 8To form a triangle, 3 points out of 5 can be chosen in \({}^5C_3=10\) ways. But of these, the three points lying on the 2 diagonals will be collinear. So \(10-2=8\) triangles can be formed.
Teacher's Note: Choose three of five points, remove the two collinear triples on diagonals.
Exam Note: 10 - 2 = 8.
Question 8. If number of selections of 6 different letters that can be made from the words 'SUMAN' and 'DIVYA' so that each selection contains 3 letters from each word, is \(N^2\) then the value of \(N\) is.
Solution.
Answer: 8Here A is common letter in words 'SUMAN' and 'DIVYA'. Now for selecting six different letters we must select A either from word 'SUMAN' or from word 'DIVYA'.
Hence for possible selections, we have A excluded from SUMAN + A included in SUMAN \(={}^4C_3\cdot{}^5C_3+{}^4C_2\cdot{}^4C_3=40+24=64\). Hence \(N^2=64\Rightarrow N=8\).
Teacher's Note: A is the shared letter; take it from only one word to keep six different letters.
Exam Note: 40 + 24 = 64.
Question 9. There are 20 books on Algebra and Calculus in one library. For the greatest number of selections each of which consists of 5 books on each topic possible number of Algebra books are \(N\) then the value of \(N/2\) is.
Solution.
Answer: 5Let \(r\) be the number of algebra books and \(20-r\) of calculus. Number of selections is \({}^rC_5\times{}^{20-r}C_5\), which has maximum value when \(r=10\). So \(N=10\) and \(N/2=5\).
Teacher's Note: The product rC5 times (20-r)C5 is largest at r = 10.
Exam Note: r = 10 gives N/2 = 5.
Question 10. Number of permutations of 1, 2, 3, 4, 5, 6, 7, 8 and 9 taken all at a time are such that the digit
1 appearing somewhere to the left of 2
3 appearing to the left of 4 and
5 somewhere to the left of 6, is \(k\times 7!\). Then the value of \(k\) is.
Solution.
Answer: 9Number of digits are 9. Select 2 places for the digit 1 and 2 in \({}^9C_2\) ways. From the remaining 7 places select any two places for 3 and 4 in \({}^7C_2\) ways, and from the remaining 5 places select any two for 5 and 6 in \({}^5C_2\) ways. Now, the remaining 3 digits can be filled in \(3!\) ways.
Therefore, total ways \(={}^9C_2\cdot{}^7C_2\cdot{}^5C_2\cdot3!=\dfrac{9!}{2!\,7!}\cdot\dfrac{7!}{2!\,5!}\cdot\dfrac{5!}{2!\,3!}\cdot3!=\dfrac{9!}{8}=\dfrac{9\cdot8\cdot7!}{8}=9\cdot7!\)
So \(k=9\).
Teacher's Note: Place the ordered pairs (1,2), (3,4), (5,6) by choosing positions, then fill the rest.
Exam Note: 9!/8 = 9 times 7!.
Question 11. The number of \(n\) digit numbers which consists of the digits 1 and 2 only if each digit is to be used at least once, is equal to 510 then \(n\) is equal to.
Solution.
Answer: 9We have \(2^n-2=510\)\(\Rightarrow2^n=512\)\(\Rightarrow n=9\).
Teacher's Note: Strings of 1s and 2s using both digits number 2^n - 2.
Exam Note: 2^n = 512.
Question 12. Number of ways in which 7 people can occupy six seats, 3 seats on each side in a first class railway compartment if two specified persons are to be always included and occupy adjacent seats on the same side, is \((5!)\cdot k\) then \(k\) has the value equal to.
Solution.
Answer: 8Including the two specified people, 4 others can be selected in \({}^5C_4\) ways. The two adjacent seats can be taken in 4 ways and the two specified people can be arranged in \(2!\) ways, remaining 4 people can be arranged in \(4!\) ways.
\(\Rightarrow{}^5C_4\cdot4\cdot2!\,4!=5!\cdot8=8\cdot5!\), so \(k=8\).
Teacher's Note: Select the four others, place the specified pair in adjacent seats, arrange everyone.
Exam Note: 5 times 4 times 2 times 4! = 8 times 5!.
Question 13. There are 2 women participating in a chess tournament. Every participant played 2 games with the other participants. The number of games that the men played between themselves exceeded by 66 as compared to the number of games that the men played with the women. If the number of participants is \(n\) then the value of \(n-6\) is.
Solution.
Answer: 7There are 2 women and let number of men be \(n\). According to question
\(2\times{}^nC_2=66+2\times{}^nC_1\times{}^2C_1\)
\(\Rightarrow 2\cdot\dfrac{n(n-1)}{2}=2[33+2n]\)
\(\Rightarrow\dfrac{n(n-1)}{1\cdot2}=33+n(2)\)
\(\Rightarrow n^2-5n-66=0\Rightarrow(n-11)(n+6)=0\)
\(\therefore\ n=11\) (\(\because\ n>0\))
Total participants \(=2+11=13\), so the required value is \(13-6=7\).
Teacher's Note: Men's games exceed men-women games by 66; solve for number of men.
Exam Note: 13 participants, so n - 6 = 7.
Question 14. The number of three digit numbers having only two consecutive digits identical is \(N\), then the value of \((N/2)^{1/2}\) is.
Solution.
Answer: 9Pattern \(x\,x\,\_\) when two consecutive digits are 11, 22, etc. \(=9\cdot9=81\).
Pattern \(\_\,0\,0\) when two consecutive digits are 00 \(=9\).
Pattern \(\_\,x\,x\) when two consecutive digits are 11, 22, 33, ... \(=9\cdot8=72\).
Total number of numbers are \(N=162\), so \((N/2)^{1/2}=9\).
Teacher's Note: Count patterns xxy and yxx with exactly one adjacent identical pair.
Exam Note: 81 + 9 + 72 = 162.
Question 15. Number of 4 digit numbers of the form \(N=abcd\) which satisfy following three conditions
(i) \(4000\le N<6000\)
(ii) \(N\) is a multiple of 5
(iii) \(3\le b<c\le6\)
is equal to \(N\) then the value of \(N/3\) is.
Solution.
Answer: 8We have \(N=a\,b\,c\,d\).
First place \(a\) can be filled in 2 ways i.e. 4, 5 \((4000\le N<6000)\).
For \(b\) and \(c\), total possibilities are '6' \((3\le b<c\le6)\) i.e. 34, 35, 36, 45, 46, 56.
Last place \(d\) can be filled in 2 ways i.e. 0, 5 (\(N\) is a multiple of 5).
Hence, total numbers \(=2\times6\times2=24=N\) then \(N/3=8\).
Teacher's Note: Choose a (2 ways), the pair b<c (6 ways) and d (2 ways).
Exam Note: 2 times 6 times 2 = 24.
Question 16. Number of ways in which 5 A's and 6 B's can be arranged in a row which reads the same backwards and forwards, is \(N\) then the value of \(N/2\) is.
Solution.
Answer: 5A AAAA | B BBBBB
Since word reads the same backwards and forwards, the middle digit must be A.
So that even number of A's and B's are available for arrangement about middle position M.
Take AABBB on one side of M (6th place) and then their image about M in a unique way.
\(\therefore\ \text{Number of ways}\ N=\dfrac{5!}{2!\,3!}=10\)
So \(N/2=5\).
Teacher's Note: The middle letter must be A; arrange A A B B B on one half and mirror it.
Exam Note: 5!/(2!3!) = 10.
Question 17. If \(N\) is the number of different paths of length-12 which leads from \(A\) to \(B\) in the grid which do not pass through \(M\), then the value of \([N/10]\), where \([\ .\ ]\) represents the greatest integer function, is.
Solution.
Answer: 52Here the path which leads from A to B is of length-12.
Now without considering the constraint of passing through the point M, number of ways in which we can reach B from A is equal to number of ways we can select 6 steps from left to right and 6 from bottom to top which is equal to \({}^{12}C_6\).
Now we can reach from A to M in 6 steps in \({}^6C_3\) ways and can reach from M to B in \({}^6C_3\) ways.
Hence we can reach from A to B through M in \({}^6C_3\times{}^6C_3\) ways.
Hence required number of ways \(={}^{12}C_6-[{}^6C_3\times{}^6C_3]=924-400=524\), so \([N/10]=[52.4]=52\).
Teacher's Note: Count all 12-step paths, subtract those passing through M.
Exam Note: 924 - 400 = 524.
Question 18. There are 720 permutations of the digits 1, 2, 3, 4, 5, 6. Suppose these permutations are arranged from smallest to largest numerical values, beginning from 1 2 3 4 5 6 and ending with 6 5 4 3 2 1. Then the digit in unit place of number at \(267^{th}\) position is.
Solution.
Answer: 6number of numbers beginning with 1 = 120
number of numbers beginning with 2 = 120
starting with 31 = 24
starting with 3214 = 2
finally = 1 (the number 321546)
Hence unit place digit of 267th number is 6.
Teacher's Note: Count permutations by prefixes until reaching position 267.
Exam Note: 267th permutation is 321546.
Question 19. If \(N\) is the number of ways in which a person can walk up a stairway which has 7 steps if he can take 1 or 2 steps up the stairs at a time, then the value of \(N/3\) is.
Solution.
Answer: 7\(x\) denotes the number of times he can take unit step and \(y\) denotes the number of times he can take 2 steps, then we must have \(x+2y=7\), \(x=1,3,5\) (and 7).
If \(x=1\), the steps will be 1 2 2 2 \(\Rightarrow\) number of ways \(=\dfrac{4!}{3!}=4\)
If \(x=3\), the steps will be 1 1 1 2 2 \(\Rightarrow\) number of ways \(=\dfrac{5!}{2!\,3!}=10\)
If \(x=5\), the steps will be 1 1 1 1 1 2 \(\Rightarrow\) number of ways \(={}^6C_1=6\)
If \(x=7\), the steps will be 1 1 1 1 1 1 1 \(\Rightarrow{}^7C_0=1\)
Hence total number of ways \(=N=21\)\(\Rightarrow N/3=7\).
Teacher's Note: Count arrangements of 1-steps and 2-steps summing to 7.
Exam Note: 4 + 10 + 6 + 1 = 21.
Question 20. There are 3 men and 7 women taking a dance class. If \(N\) is number of different ways in which each man be paired with a woman partner, and the four remaining women be paired into two pairs each of two, then the value of \(N/90\) is.
Solution.
Answer: 73 women can be selected in \({}^7C_3\) ways and can be paired with 3 men in \(3!\) ways.
Remaining 4 women can be grouped into two couples in \(\dfrac{4!}{2!\,2!\,2!}=3\).
Hence \(N={}^7C_3\times3!\times3=630\), so \(N/90=7\).
Teacher's Note: Choose partners for the men, then pair the remaining four women.
Exam Note: 35 times 6 times 3 = 630.
Question 21. Let \(P_n\) denotes the number of ways in which three people can be selected out of \('n'\) people sitting in a row, if no two of them are consecutive. If, \(P_{n+1}-P_n=15\) then the value of \('n'\) is.
Solution.
Answer: 8Here \(P_n={}^{n-2}C_3\) and \(P_{n+1}={}^{n-1}C_3\). Hence \({}^{n-1}C_3-{}^{n-2}C_3=15\)\(\Rightarrow{}^{n-2}C_3+{}^{n-2}C_2-{}^{n-2}C_3=15\)\(\Rightarrow{}^{n-2}C_2=15\Rightarrow n=8\).
Teacher's Note: Non-consecutive triples number (n-2)C3; apply Pascal's rule to the difference.
Exam Note: (n-2)C2 = 15 gives n = 8.
Question 22. A man has 3 friends. If \(N\) is number of ways he can invite one friend everyday for dinner on 6 successive nights so that no friend is invited more than 3 times then the value of \(N/170\) is.
Solution.
Answer: 3(i) He can invite 2 friends three times each. Let us select first those 2 friends in \({}^3C_2\) ways. Now these two friends each three time can be invited on 6 days in \(6!/(3!\,3!)\). Thus total number of ways 2 friends can be invited three times \(={}^3C_2\times\dfrac{6!}{3!\,3!}\).
(ii) Another possibility is that he invites all three friends 2 times each. Then number of ways \(=\dfrac{6!}{2!\,2!\,2!}\).
(iii) One more possibility is that he invites one friend three times, one two times and one three times (once). Then number of ways \(=\dfrac{6!\times6}{3!\,2!}\).
Hence total number of ways \(={}^3C_2\times\dfrac{6!}{3!\,3!}+\dfrac{6!\times6}{3!\,2!}+\dfrac{6!}{2!\,2!\,2!}=510\), so \(N/170=3\).
Teacher's Note: Split six nights as (3,3,0), (1,2,3) or (2,2,2) among the three friends.
Exam Note: 60 + 360 + 90 = 510.
Question 23. If \(N\) is the number of ways in which 3 distinct numbers can be selected from the set \(\{3^1,3^2,3^3,\ldots,3^{10}\}\) so that they form a G.P. then the value of \(N/5\) is.
Solution.
Answer: 4If three numbers are in G.P., then their exponent must be in A.P.
If \(a,b,c\) are selected number in G.P., then the exponents of \(a\) and \(c\) both are either odd or both even, or otherwise exponent \(b\) will not be integer.
Now two odd exponent (from 1, 2, 3, ..., 10) can be selected in \({}^5C_2\) ways and two even exponent can be selected in \({}^5C_2\) ways. Hence number of G.P.'s are \(2\,{}^5C_2=20\), so \(N/5=4\).
Teacher's Note: Exponents of a G.P. from powers of 3 are in A.P.; pick two of equal parity.
Exam Note: 2 times 5C2 = 20.
Question 24. Let \(f(n)=\sum_{r=0}^{n}\sum_{k=r}^{n}\dbinom{k}{r}\). Find the total number of divisors of \(f(9)\).
Solution.
Answer: 8\(\sum_{k=r}^{n}{}^kC_r={}^rC_r+{}^{r+1}C_r+{}^{r+2}C_r+\cdots+{}^nC_r\)
\(=1+{}^{r+1}C_1+{}^{r+2}C_2+{}^{r+3}C_3+\cdots+{}^nC_{n-r}\)
\(={}^{r+1}C_0+{}^{r+1}C_1+{}^{r+2}C_2+\cdots+{}^nC_{n-r}={}^{r+2}C_1+{}^{r+2}C_2+\cdots\)
and so on, finally \({}^{n+1}C_{n-r}\). Now, \({}^{n+1}C_{n-r}={}^{n+1}C_{r+1}\).
\(\therefore\ f(n)=\sum_{r=0}^{n}{}^{n+1}C_{r+1}={}^{n+1}C_1+{}^{n+1}C_2+{}^{n+1}C_3+\cdots+{}^{n+1}C_{n+1}\)
\(={}^{n+1}C_0+{}^{n+1}C_1+{}^{n+1}C_2+\cdots+{}^{n+1}C_{n+1}-1\)
\(f(n)=(2^{n+1})-1\)
\(f(9)=2^{10}-1=1023=3\cdot11\cdot31\)
hence number of divisors are \((1+1)(1+1)(1+1)=8\).
Teacher's Note: The double sum telescopes with Pascal's rule to 2^(n+1) - 1.
Exam Note: f(9) = 1023 = 3 times 11 times 31.
Free study material for Mathematics
Download Cengage G Tewani Solutions for Class 11 Math PDF
Complete Math Solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Integer Type
Access the complete chapter-wise PDF for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Integer 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.
Additional Study Materials for 2026
Wrap up your chapter revision by testing your knowledge against standard objective question formats. Explore our full library of up-to-date syllabus details and mock evaluations to secure top grades in your math examinations.
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.