Download Class 11 Mathematics Textbook Solutions: Chapter 05 Permutation Combination
Access comprehensive textbook solutions for Chapter 05 Permutation Combination using the reference material for Class 11 Mathematics. Designed to align with the 2026 academic curriculum, these detailed answers help students reinforce core academic concepts and master complex problem-solving methods.
Access Textbook Answers and Solutions
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.
Solved Examples
Question 5.1. Find the number of 4 letter words, with or without meaning, which can be formed out of the letters of the word MAKE, where the repetition of the letters is not allowed.
Solution.
There are as many words as there are ways of filling in 4 vacant places xxxx by the 4 letters, keeping in mind that the repetition is not allowed. The first place can be filled in 4 different ways by anyone of the 4 letters M, A, K, E.
Following which, the second place can be filled in by anyone of the remaining 3 letters in 3 different ways, following which the third place can be filled in 2 different ways; following which, the fourth place can be filled in 1 way.
Thus, the number of ways in which the 4 places can be filled, by the multiplication principle, is \(4\times 3\times 2\times 1=24\).
Hence, the required number of words is 24.
Teacher's Note: Fill places one by one by multiplication principle; each place has one fewer choice.
Exam Note: No repetition: multiply decreasing choices.
Question 5.2. How many 2 digit even numbers can be formed from the digits 1, 2, 3, 4, 5 if the digits can be repeated?
Solution.
There will be as many ways as there are ways of filling 2 vacant places xx in succession by the five given digits. Here, we start filling in unit's place, because the options for this place are 2 and 4 only and this can be done in 2 ways; following which the ten's place can be filled by any of the 5 digits in 5 different ways as the digits can be repeated.
Therefore, by the multiplication principle, the required number of two digits even numbers is \(2\times 5\), i.e., 10.
Teacher's Note: Fill the restricted place (units) first, then the free place.
Exam Note: Fill restricted place first.
Question 5.3. Find the number of different signals that can be generated by arranging at least 2 flags in order (one below the other) on a vertical staff, if five different flags are available.
Solution.
A signal can consist of either 2 flags, 3 flags, 4 flags or 5 flags. Now, let us count the possible number of signals consisting of 2 flags, 3 flags, 4 flags and 5 flags separately and then add the respective numbers.
There will be as many 2 flag signals as there are ways of filling in 2 vacant places in succession by the 5 flags available. By Multiplication rule, the number of ways is \(5\times 4=20\).
Similarly, there will be as many 3 flag signals as there are ways of filling in 3 vacant places in succession by the 5 flags.
The number of ways is \(5\times 4\times 3=60\). Continuing the same way, we find that the number of 4 flag signals \(=5\times 4\times 3\times 2=120\) and the number of 5 flag signals \(=5\times 4\times 3\times 2\times 1=120\)
Therefore, the required no of signals \(=20+60+120+120=320\).
Teacher's Note: Add (addition rule) the counts for 2, 3, 4 and 5 flags, each by multiplication rule.
Exam Note: Split into cases, add the counts.
Question 5.4. Poor Dolly's T.V. has only 4 channels; all of them quite boring, hence it is not surprising that she desires to switch (change) channel after every one minute. Then find the number of ways in which she can change the channels so that she is back to her original channel for the first time after 4 minutes.
Solution.
Let there be 4 channels \(C_1,C_2,C_3\) and \(C_4\)
at \(t=0\) minute she is watching channel 1
\(\therefore\) after 1st minute she has 3 choices to switch the channel \((C_2,C_3,C_4)\)
after 2nd minute she has 2 choices to switch the channel
after 3rd minute she has 2 choices to switch the channel
but after the 4th minute she has only 1 choice to switch the channel i.e. \(C_1\)
\(\therefore\) Total number of ways \(=3\times 2\times 2=12\)
Teacher's Note: Multiply the number of channel choices available after each minute.
Exam Note: Multiply choices step by step.
Question 5.5. There are 'n' locks and 'n' matching keys. If all the locks and keys are to be perfectly matched, find the maximum number of trials required to open a lock.
Solution.
The maximum number of trials needed for the first key is \(n\). For second key, it will be \(n-1\).
Now, for the \(r^{th}\) key, the maximum number of trials needed is \(n-r+1\). Thus, the required answer is
\(n+(n-1)+\cdots+1=\dfrac{n(n+1)}{2}\)
Teacher's Note: Worst case trials decrease by one per key; sum the arithmetic series.
Exam Note: Sum worst-case trials for each key.
Question 5.6. Find the 2-digit number (having different digits), which is divisible by 5.
Solution.
Any number of required type ends in either 5 or 0. Hence, the two-digit number (with different digits) that ends in 5 is 8 and that of 0 is 9. Therefore, by addition principle, the required number is \(8+9=17\).
Teacher's Note: Divisible by 5 means last digit 5 or 0; count each case and add.
Exam Note: Case on last digit, then add.
Question 5.7. Find the total number of ways in which \(n\) distinct objects can be put into two different boxes.
Solution.
Let the two boxes be \(B_1\) and \(B_2\). For each of the \(n\) objects, there are two choices, it is put in either box \(B_1\) or box \(B_2\). Therefore, by fundamental principle of counting, the total number of ways is \(2\times 2\times\cdots\times 2\ (n\text{ times})=2^n\).
Teacher's Note: Each object independently has 2 choices, so multiply 2, n times.
Exam Note: Each object chooses a box independently.
Question 5.8. Three dice are rolled. Find the number of possible outcomes in which at least one dice shows 5.
Solution.
When a dice is rolled, there are six possible outcomes. So, the total number of outcomes when three dice are rolled is \(6\times 6\times 6=6^3\).
Now, the number of possible outcomes in which at least one dice shows 5 is as follows.
Total number of possible outcomes \(-\) Number of possible outcomes in which 5 does not appear on any dice \(=6^3-5^3=91\)
Teacher's Note: Use complement: total outcomes minus outcomes with no 5.
Exam Note: At least one: subtract the none case.
Question 5.9. Find the number of distinct rational numbers \(x\) such that \(0<x<1\) and \(x=p/q\), where \(p,q\in\{1,2,3,4,5,6\}\).
Solution.
As \(0<x<1\), we have \(p<q\).
| \(p\) | \(q\) |
|---|---|
| 1 | 2, 3, 4, 5, 6 |
| 2 | 3, 4, 5, 6 |
| 3 | 4, 5, 6 |
| 4 | 5, 6 |
| 5 | 6 |
Thus, the number of rational numbers is \(5+4+3+2+1=15\).
When \(p\) and \(q\) have a common factor, we get some rational numbers, which are not different from those already counted. Here, there are four such numbers: \(2/4,\ 2/6,\ 3/6,\ 4/6\).
Therefore, the required number of rational numbers is \(15-4=11\).
Teacher's Note: List pairs with p<q, then remove fractions equal to ones already counted.
Exam Note: Remove duplicate fractions in lowest terms.
Question 5.10. Find the total number of integer \(n\) such that \(2\le n\le 2000\) and H.C.F. of \(n\) and 36 is 1.
Solution.
\(36=2^2\times 3^2\)
If H.C.F. of integer \(n\) and 36 is 1, then \(n\) should not be divisible by 2 or 3.
Let us first find the numbers that are divisible by 2 or 3.
The number of integers in the range \([2,2000]\) that are divisible by 2 is 1000 \((2,4,6,\ldots,1998,2000)\).
The number of integers in the range \([2,2000]\) that are divisible by 3 is 666 \((3,6,9,\ldots,1995,1998)\).
The number of integers in the range \([2,2000]\) that are divisible by 6 is 333 \((6,12,18,\ldots,1992,1998)\).
Total number of integers divisible by 2 or 3 is \(1000+666-333=1333\).
Thus, the total number of integers that are divisible by neither 2 nor 3 is \(1999-1333=666\).
Teacher's Note: Count numbers divisible by 2 or 3 by inclusion-exclusion, subtract from 1999.
Exam Note: Coprime to 36 means not divisible by 2 or 3.
Question 5.11. Find the number of polynomials of the form \(x^3+ax^2+bx+c\) that are divisible by \(x^2+1\), where \(a,b,c\in\{1,2,3,\ldots,9,10\}\).
Solution.
On dividing \(x^3+ax^2+bx+c\) by \(x^2+1\), the quotient is \(x+a\) and the remainder is \((b-1)x+c-a\).
Now, remainder \((b-1)x+c-a\) must be zero for any \(x\). Then,
\(b-1=0\) and \(c-a=0\)
\(\Rightarrow b=1\) and \(c=a\)
Now, \(c\) or \(a\) can be selected in 10 ways. Hence, number of polynomials are 10.
Teacher's Note: Divide to get remainder; both coefficients of the remainder must vanish.
Exam Note: Divisible means remainder is identically zero.
Question 5.12. Find the number of diagonals in the polygon of \(n\) sides.
Solution.
For diagonal, we have to select any two vertices. The first vertex can be selected in \(n\) ways. Let \(A_1\) be chosen as first vertex. Now, diagonal cannot be formed if any of \(A_2\) and \(A_n\) is chosen. Hence, for \(A_1\) another vertex can be selected in \(n-3\) ways from remaining \(n-1\) vertices.
Again, by principle of counting, the number of ways two vertices can be selected is \(n(n-3)\).
Now, when \(A_1\) is chosen as the first vertex, sometimes \(A_4\) is chosen as the second vertex. Similarly, when \(A_4\) is chosen as the first vertex, sometimes \(A_1\) is chosen as the second vertex.
Hence, each pair is selected twice. Therefore, the total number of diagonals is \(n(n-3)/2\).
Teacher's Note: Each vertex joins n-3 non-adjacent vertices; every diagonal is counted twice.
Exam Note: Divide by 2 for unordered pairs.
Question 5.13. Find the total number of \('n'\)-digit numbers \((n>1)\), having the property that no two consecutive digits are same.
Solution.
The digit \('x_1'\) can be selected in 9 ways as '0' cannot be selected.
The digit \('x_2'\) can be selected in 9 ways as '0' can be selected but digit in position \(x_1\) cannot be selected.
Similarly, each of the remaining digits can also be selected in 9 ways.
Thus, the total number of such numbers is \(9^n\).
Teacher's Note: Each digit differs from the previous one: 9 choices every position.
Exam Note: Each place has 9 choices.
Question 5.14. Find \(n\), if \((n+1)!=12\times(n-1)!\).
Solution.
\((n+1)!=12\times (n-1)!\)
\(\Rightarrow (n+1)\times n\times(n-1)!=12\times (n-1)!\)
\(\Rightarrow n(n+1)=12\)
\(\Rightarrow n^2+n-12=0\)
\(\Rightarrow (n+4)(n-3)=0\)
\(\Rightarrow n=3\)
Teacher's Note: Expand (n+1)! in terms of (n-1)!, cancel, and solve the quadratic.
Exam Note: Reduce factorials to a common factorial.
Question 5.15. Prove that \((n!)^2<n^n\,n!<(2n)!\) for all positive integers \(n\).
Solution.
We have,
\((n!)^2=(n!)(n!)=(1\times 2\times 3\times 4\times\cdots\times(n-1)n)(n!)\)
Now, \(1\le n,\ 2\le n,\ 3\le n,\ \ldots,\ n\le n\)
\(\Rightarrow 1\times 2\times 3\cdots(n-1)n\le n\times n\times n\times\cdots n\)
\(\Rightarrow n!\le n^n\)
\(\Rightarrow (n!)(n!)\le (n!)\,n^n\)
\(\Rightarrow (n!)^2\le n^n(n!)\qquad (1)\)
Also,
\((2n)!=1\times 2\cdots n\times(n+1)\cdots(2n-1)\times(2n)\)
Now,
\(n+1>n,\ n+2>n,\ n+3>n,\ \ldots,\ n+n>n\)
\(\Rightarrow (n+1)(n+2)(n+3)\cdots(2n-1)(2n)>n^n\)
\(\Rightarrow n!\,(n+1)(n+2)\cdots(2n-1)(2n)>n!\,n^n\)
\(\Rightarrow (2n)!>n!\,n^n\Rightarrow n!\,n^n<(2n)!\qquad (2)\)
From (1) and (2), we get \((n!)^2\le n^n(n!)<(2n)!\)
Teacher's Note: Compare factor by factor: each factor of n! is at most n, each of (n+1)..2n exceeds n.
Exam Note: Compare termwise with n^n.
Question 5.16. Find the sum of the series \(\sum_{r=1}^{n} r\times r!\).
Solution.
Here, the general term of the series is
\(T_r=r\times r!=(r+1-r)\,r!=(r+1)\,r!-r!=(r+1)!-r!\)
Hence,
\(T_1=2!-1!\)
\(T_2=3!-2!\)
\(T_3=4!-3!\)
\(\vdots\)
\(T_n=(n+1)!-n!\)
Adding all the above terms, we have the sum of \(n\) terms, i.e.,
\(S_n=(n+1)!-1\)
Teacher's Note: Write r times r! as (r+1)! minus r!; the sum telescopes.
Exam Note: Telescoping: r·r! = (r+1)! - r!.
Question 5.17. Find the exponent of 3 in 100!
Solution.
\(100!=1\times 2\times 3\times\cdots\times 98\times 99\times 100\)
\(=(1\times 2\times 4\times 5\times\cdots\times 98\times 100)(3\times 6\times 9\times\cdots\times 96\times 99)\)
\(=K\times 3^{33}(1\times 2\times 3\times\cdots\times 32\times 33)\)
\(=K\times 3^{33}(1\times 2\times 4\times\cdots\times 31\times 32)(3\times 9\times 12\times\cdots\times 30\times 33)\)
\(=[K(1\times 2\times 4\times\cdots\times 31\times 32)]\times 3^{33}\times(3\times 9\times 12\times\cdots\times 30\times 33)\)
\(=K_1\times 3^{33}\times 3^{11}(1\times 2\times 3\times\cdots\times 10\times 11)\)
\(=K_1\times(1\times 2\times 4\times\cdots\times 10\times 11)\,3^{33}\times 3^{11}(3\times 6\times 9\times 12)\)
\(=K_2\times 3^{33}\times 3^{11}\times 3^{4}\times(1\times 2\times 3\times 4)\)
\(=K_3\times 3^{33}\times 3^{11}\times 3^{4}\times 3\)
\(=K_3\times 3^{49}\)
Hence, exponent of 3 is 49.
Alternative solution: Exponent of 3 in 100! is
\(\left[\dfrac{100}{3}\right]+\left[\dfrac{100}{3^2}\right]+\left[\dfrac{100}{3^3}\right]+\left[\dfrac{100}{3^4}\right]=33+11+4+1=49\)
Teacher's Note: Add the greatest integers of 100/3, 100/9, 100/27, 100/81.
Exam Note: Use Legendre: sum of floor(n/p^k).
Question 5.18. Find the number of zeroes at the end of 130!
Solution.
Number of zeroes at the end of 130! is equal to the exponent of 10 in 130!. Now, exponent of 10 is equal to exponent of 5 as exponent of 2 is higher than exponent of 5. Now, exponent of 5 is
\(\left[\dfrac{130}{5}\right]+\left[\dfrac{130}{5^2}\right]+\left[\dfrac{130}{5^3}\right]=26+5+1=32\)
Also, exponent of 10 is 32 and hence, there are 32 zeros at the end of 130!. It should be noted that exponent of 2 is
\(\left[\dfrac{130}{2}\right]+\left[\dfrac{130}{2^2}\right]+\left[\dfrac{130}{2^3}\right]+\left[\dfrac{130}{2^4}\right]+\left[\dfrac{130}{2^5}\right]+\left[\dfrac{130}{2^6}\right]+\left[\dfrac{130}{2^7}\right]\)
\(=65+32+16+8+4+2+1=128\)
Hence, exponent of 10 is equal to exponent of 5.
Teacher's Note: Trailing zeros equal the exponent of 5, since 2 occurs more often.
Exam Note: Trailing zeros = exponent of 5.
Question 5.19. If \({}^{10}P_{r}=5040\), find the value of \(r\).
Solution.
\({}^{10}P_{r}=5040\)
\(=10\times 504\)
\(=10\times 9\times 8\times 7\)
\(={}^{10}P_{4}\)
\(\Rightarrow r=4\)
Teacher's Note: Factor 5040 into four consecutive descending integers starting from 10.
Exam Note: Match 5040 with 10×9×8×7.
Question 5.20. If \({}^{9}P_{5}+5\,{}^{9}P_{4}={}^{10}P_{r}\), find the value of \(r\).
Solution.
\({}^{10}P_{r}={}^{9}P_{5}+5{}^{9}P_{4}\)
\(=\dfrac{9!}{(9-5)!}+5\times\dfrac{9!}{(9-4)!}\)
\(=\dfrac{9!}{4!}+5\times\dfrac{9!}{5!}\)
\(=\dfrac{9!}{4!}+\dfrac{9!}{4!}\)
\(=2\times\dfrac{9!}{4!}\)
\(=\dfrac{5\times 2\times 9!}{5\times 4!}\)
\(=\dfrac{10\times 9!}{5!}\)
\(=\dfrac{10!}{5!}\)
\(={}^{10}P_{5}\)
\(\Rightarrow r=5\)
Teacher's Note: Write both permutations as factorial ratios and combine to 10!/5!.
Exam Note: Convert nPr to factorial form.
Question 5.21. If \({}^{2n+1}P_{n-1}:{}^{2n-1}P_{n}=3:5\), then find the value of \(n\).
Solution.
\({}^{2n+1}P_{n-1}:{}^{2n-1}P_{n}=3:5\)
\(\Rightarrow\dfrac{{}^{2n+1}P_{n-1}}{{}^{2n-1}P_{n}}=\dfrac35\)
\(\Rightarrow\dfrac{(2n+1)!}{(n+2)!}\times\dfrac{(n-1)!}{(2n-1)!}=\dfrac35\)
\(\Rightarrow\dfrac{(2n+1)(2n)}{(n+2)(n+1)n}=\dfrac35\)
\(\Rightarrow 10(2n+1)=3(n+2)(n+1)\)
\(\Rightarrow 3n^2-11n-4=0\)
\(\Rightarrow (n-4)(3n+1)=0\)
\(\Rightarrow n=4\)
Teacher's Note: Expand both permutations factorially, cancel, solve resulting quadratic; reject negative root.
Exam Note: Reject n=-1/3; n must be natural.
Question 5.22. Prove that if \(r\le s\le n\), then \({}^nP_s\) is divisible by \({}^nP_r\).
Solution.
Let \(s=r+k\) where \(0\le k\le s-r\). Then,
\({}^nP_s=\dfrac{n!}{(n-s)!}=n(n-1)(n-2)\cdots(n-(s-1))\)
\(=n(n-1)(n-2)\cdots(n-(r+k-1))\)
\(=n(n-1)(n-2)\cdots(n-(r-1))\,(n-r)(n-(r+1))\cdots(n-(r+k-1))\)
\(=\{n(n-1)(n-2)\cdots(n-(r-1))\}\{(n-r)(n-(r+1))\cdots(n-(r+k-1))\}\)
\(={}^nP_r\{(n-r)(n-(r+1))\cdots(n-(r+k-1))\}\)
\(={}^nP_r\times\text{Integer}\)
Hence, \({}^nP_s\) is divisible by \({}^nP_r\).
Teacher's Note: Write nPs as product of s factors; the first r factors form nPr.
Exam Note: First r factors of nPs give nPr.
Question 5.23. Seven athletes are participating in a race. In how many ways can the first three athletes win the prizes?
Solution.
It is equivalent to filling 3 places (as prizes) with 7 persons. The number of permutations of 7 objects taken three at a time is
\({}^{7}P_{3}=7\times 6\times 5=210\)
Teacher's Note: Ordered selection of 3 from 7: use 7P3.
Exam Note: Prizes are ordered: use permutations.
Question 5.24. In how many ways can 6 persons stand in a queue?
Solution.
The number of ways in which 6 persons can stand in a queue is same as filling six places with six persons. The number of permutations of six objects taken all at a time is
\({}^{6}P_{6}=6!=720\)
Teacher's Note: Arranging all 6 distinct persons gives 6!.
Exam Note: All distinct, all used: n!.
Question 5.25. How many different signals can be given using any number of flags from 5 flags of different colours?
Solution.
The signals can be made by using one or more flags at a time.
The total number of signals when \(r\) flags are used at a time from 5 flags is equal to the number of arrangements of 5, taking \(r\) at a time, i.e., \({}^5P_r\).
Since \(r\) can take the values 1, 2, 3, 4, 5, hence, by the fundamental principle of addition, the total number of signals is
\({}^5P_1+{}^5P_2+{}^5P_3+{}^5P_4+{}^5P_5=5+(5\times4)+(5\times4\times3)+(5\times4\times3\times2)+(5\times4\times3\times2\times1)\)
\(=5+20+60+120+120=325\)
Teacher's Note: Add arrangements using 1, 2, 3, 4 and 5 flags.
Exam Note: Add cases r = 1 to 5.
Question 5.26. Find the sum of all the numbers that can be formed with the digits 2, 3, 4, 5 taken all at a time.
Solution.
Total number of numbers formed with the digits 2, 3, 4, 5 taken all at a time is equal to the number of arrangements of 4 digits, taken all at a time, i.e., \({}^{4}P_{4}=4!=24\).
To find the sum of these 24 numbers, we have to find the sum of the digits at unit's, ten's, hundred's and thousand's places in all these numbers.
Consider the digits in the unit's places in all these numbers.
If 2 is the digit in unit's place, remaining three places can be filled in 3! ways or we can say 2 occurs in unit's place 3! \((=6)\) times. Similarly, each digit occurs six times.
So, the total sum of the digits in the unit's place in all these numbers is \((2+3+4+5)\times 3!=84\).
Similarly, sum of digits is 84 in ten's, hundred's and thousand's places.
Hence, the sum of all the numbers is \(84(10^0+10^1+10^2+10^3)=93324\).
Teacher's Note: Each digit appears 3! times in each place; sum place-wise.
Exam Note: Each digit occurs equally often per place.
Question 5.27. How many 4-letter words, with or without meaning, can be formed out of the letters in the word 'LOGARITHMS', if repetition of letters is not allowed?
Solution.
There are 10 letters in the word 'LOGARITHMS'. So, the number of 4-letter words is equal to number of arrangements of 10 letters, taken 4 at a time, i.e., \({}^{10}P_{4}=5040\).
Teacher's Note: All 10 letters distinct; arrange 4 of them: 10P4.
Exam Note: Distinct letters, no repetition: nPr.
Question 5.28. Eleven animals of a circus have to be placed in eleven cages (one in each cage). If 4 of the cages are too small for 6 of the animals, then find the number of the ways of caging all the animals.
Solution.
Let the 6 animals be placed in 7 of larger cages. This can be done in \({}^{7}P_{6}\) ways. In each of these ways, one larger cage is left vacant. The remaining five animals can be placed in the remaining five cages in 5! ways. Hence, by the fundamental theorem, the required number of ways is \({}^{7}P_{6}\times 5!=604800\).
Teacher's Note: Place the six restricted animals in large cages first, then the rest.
Exam Note: Place restricted objects first.
Question 5.29. If \(A=\{x\mid x\text{ is a prime number and }x<30\}\), find the number of different rational numbers whose numerator and denominator belong to \(A\).
Solution.
Here, \(A=\{2,3,5,7,11,13,17,19,23,29\}\). A rational number is made by taking any two numbers in any order. Therefore, the required number of rational numbers is \({}^{10}P_{2}+1\) (including 1), i.e. \(90+1=91\).
Teacher's Note: Ordered pairs of distinct primes give distinct fractions; add 1 for equal numerator and denominator.
Exam Note: Add the value 1 separately.
Question 5.30. How many different numbers of 4 digits can be formed from the digits 0, 1, 2, ..., 9 if repetition is
(i) allowed,
(ii) not allowed.
Solution.
(i) Repetition is allowed.
First place is filled by any number from 1 to 9 as 0 cannot occur at first place and each of the remaining 3 places can be filled by any one of the digits from 0, 1, ..., 9, i.e., in 10 different ways.
Hence, the total number of 4-digit numbers that can be formed is \(9\times 10\times 10\times 10=9\times 10^3\).
(ii) Repetition is not allowed.
The total number is \(9\times 9\times 8\times 7=4536\). Hence, the total number of 4-digit numbers that can be formed is \(9\times{}^9P_3\).
Teacher's Note: Fill first place with nonzero digit, then remaining places with allowed digits.
Exam Note: Leading digit cannot be zero.
Question 5.31. How many six-digit odd numbers, greater than 6,00,000, can be formed from the digits 5, 6, 7, 8, 9 and 0 if
(i) repetition of digits is allowed,
(ii) repetition of digits is not allowed.
Solution.
We have 6 digits, viz., 5, 6, 7, 8, 9 and 0 and we have to form numbers (integers) greater than 6,00,000, which are odd.
So the first place (lakh's position) should be \(\ge 6\) and the last position (i.e. unit) must be odd, i.e., 5, 7 or 9.
(i) When repetitions are allowed.
First place can be filled by 6, 7, 8 or 9 in 4 ways, last place can be filled by 5, 7 or 9 in 3 ways and each of the remaining 4 places (i.e. 2nd, 3rd, 4th, 5th) can be filled by any of the 6 digits in 6 ways. Hence, the total number will be \(4\times 6\times 6\times 6\times 6\times 3=15552\).
(ii) When repetitions are not allowed.
Since we have restrictions on first and last places and no digit can be repeated, we have the following system: 1st place having numbers \(\ge 6\) and last place having odd numbers.
| Digits in first place | Digits in last place |
|---|---|
| 6 | 5, 7, 9 |
| 7 | 5, 9 |
| 8 | 5, 7, 9 |
| 9 | 5, 7 |
| Total number of ways of filling first and last place | 10 ways |
Thus, the first and the last place can be filled in 10 ways, and the remaining four places can be filled by the remaining 4 digits in \(4!=24\) ways. Hence, the total number of numbers that can be formed is \(10\times 24=240\).
Teacher's Note: Fill restricted first and last places first, then the free middle places.
Exam Note: Fill restricted places first.
Question 5.32. A shelf contains 20 books of which 4 are single volume and the other form sets of 8, 5 and 3 volumes, respectively. Find the number of ways in which the books may be arranged on the shelf so that
(i) volumes of each set will not be separated,
(ii) volumes of each set remain in their due order.
Solution.
(i) Considering each set as single unit, permutations of 7 units is 7!.
Permutations of books of the set of 8 volumes among themselves is 8!.
Respective permutations of books of the set of 5 volumes is 5! and that of books of 3 volumes is 3!.
By the product rule, total number of permutations is \(7!\,8!\,5!\,3!\).
(ii) Since the books in a set of books containing any number of volumes can be arranged in due order in 2 ways, the total number of permutations is \(7!\times 2\times 2\times 2=8\times 7!\).
Teacher's Note: Treat each set as one unit; arrange units, then arrange within sets or fix order.
Exam Note: Glue sets as single units.
Question 5.33. How many words can be formed with the letters of the word 'MATHEMATICS' by rearranging them.
Solution.
Since there are 2 M's, 2 A's and 2 T's, the required number of ways is \(11!/(2!\,2!\,2!)\).
Teacher's Note: Arrangements with repeated letters: divide by factorials of repeat counts.
Exam Note: Divide by factorials of repeats.
Question 5.34. Find the total number of nine-digit numbers that can be formed using the digits 2, 2, 3, 3, 5, 5, 8, 8, 8 so that the odd digit occupy the even places.
Solution.
Odd digits 3, 3, 5, 5 occupy four even places in \(4!/(2!\,2!)=6\) ways. Rest five digits 2, 2, 8, 8, 8 occupy rest five places in \(5!/(2!\,3!)=10\) ways. Hence, total number of ways is \(6\times 10=60\).
Teacher's Note: Arrange odd digits in even places, even digits in the rest; multiply.
Exam Note: Treat odd and even places separately.
Question 5.35. Find the number of permutation of all the letters of the word "MATHEMATICS" which starts with consonants only.
Solution.
The letters are (M, M), (A, A), (T, T), H, E, I, C, S. The consonants are M, T, H, C, S.
Words starting with M or T are \(\dfrac{10!}{2!\,2!}\) each (two such letters).
Words starting with H, C or S are \(\dfrac{10!}{2!\,2!\,2!}\) each (three such letters).
Hence number of words are
\(2\cdot\dfrac{10!}{2!\,2!}+3\cdot\dfrac{10!}{2!\,2!\,2!}=\dfrac{10!}{2!\,2!}\left(2+\dfrac32\right)=\dfrac{7\cdot 10!}{8}=3175200\)
Teacher's Note: Fix a consonant first, then arrange remaining ten letters with repeats.
Exam Note: Case on the first consonant.
Question 5.36. There are six periods in each working day of a school. Find the number of ways in which 5 subjects can be arranged if each subject is allotted at least one period and no period remains vacant.
Solution.
Let the five subjects are \(a,b,c,d,e\).
Since number of subjects are less than the number of periods, any one of the five subjects will occur twice.
If subject \('a'\) occur twice \((a,a,b,c,d,e)\), then six subjects can be arranged in \(\dfrac{6!}{2!}\) ways.
Similar number of ways when subject \(b,c,d\) and \(e\) occur twice.
Hence total number of ways are \(5\times\dfrac{6!}{2!}=1800\).
Teacher's Note: Choose which subject repeats, then arrange six periods with that repeat.
Exam Note: Exactly one subject occurs twice.
Question 5.37. How many 4-digit numbers can be formed by using the digits 1, 2, 3, 4, 5, 6, 7 if at least one digit is repeated.
Solution.
The numbers that can be formed when repetition of digits is allowed are \(7^4\).
The numbers that can be formed when all the digits are distinct or when repetition is not allowed are \({}^{7}P_{4}\).
Therefore, the numbers that can be formed when at least one digit is repeated are \(7^4-{}^7P_4\) \((=2401-840=1561)\).
Teacher's Note: At least one repeat: all numbers minus numbers with distinct digits.
Exam Note: Use complement counting.
Question 5.38. Find the total number of permutations of \(n\) different things taken not more than \(r\) at a time, when each thing may be repeated any number of times.
Solution.
Here, we have to arrange \(p\) things out of \(n\), \(1\le p\le r\), and repetition is allowed. When \(p=1\), the number of permutations is \(n\). When \(p=2\), the number of permutations is \(n\times n=n^2\).
(Since repetition is allowed, first thing can be taken in \(n\) ways and the second thing can also be taken in \(n\) ways.)
When \(p=3\), the number of permutations is \(n\times n\times n=n^3\). When \(p=r\), the number of permutations is \(n\times n\times n\cdots r\text{ times}=n^r\).
Hence, total number of permutations is
\(n+n^2+n^3+\cdots+n^r=\dfrac{n(n^r-1)}{(n-1)}\) [sum of G.P.]
Teacher's Note: Add n^p for p = 1 to r and sum the geometric progression.
Exam Note: Sum of GP with ratio n.
Question 5.39. Number of ways in which 5 girls and 5 boys can be arranged in a row if no two boys are together.
Solution.
In the question, there is no condition for arranging the girls. Now, 5 girls can be arranged in 5! ways.
\(\times G\times G\times G\times G\times G\times\)
When girls are arranged, six gaps are generated as shown above with '\(\times\)'.
Now, boys must occupy the places with '\(\times\)' marked so that no two boys are together.
Therefore, five boys can be arranged in these six gaps in \({}^{6}P_{5}\) ways.
Hence, total number of arrangement is \(5!\times{}^6P_5\).
Teacher's Note: Arrange girls first, then place boys in the six gaps (gap method).
Exam Note: Gap method for never-together.
Question 5.40. Number of ways in which 5 girls and 5 boys can be arranged in a row if boys and girls are alternate.
Solution.
First five girls can be arranged in 5! ways, i.e.,
\(\times G\times G\times G\times G\times G\)
or,
\(G\times G\times G\times G\times G\times\)
Now, if girls and boys are alternate, then boys can occupy places with '\(\times\)' mark in the diagram.
Hence, total number of arrangements is \(5!\times 5!+5!\times 5!=2\times 5!\times 5!\).
Teacher's Note: Two alternating patterns, each with 5! arrangements of girls and 5! of boys.
Exam Note: Two starting patterns for alternation.
Question 5.41. If the best and the worst papers never appear together, find in how many ways six examination papers can be arranged.
Solution.
If the best and worst papers appear always together, the number of ways is \(5!\times 2\). Therefore, required number of ways is as follows.
Total number of ways without any restrictions \(-\) number of ways when best and worst paper are together \(=6!-5!\times 2=480\).
Teacher's Note: Subtract arrangements with the two papers glued together from all arrangements.
Exam Note: Never together: total minus together.
Question 5.42. Find the number of arrangements of the letters of the word 'SALOON', if the two O's do not come together.
Solution.
The total number of arrangements is \(6!/2!=360\). The number of ways in which O's come together is \(5!=120\). Hence, the required number of ways is \(360-120=240\).
Teacher's Note: All arrangements minus those with both O's glued together.
Exam Note: Complement: subtract O's-together cases.
Question 5.43. Find the number of seven letter words that can be formed by using the letters of the word SUCCESS so that the two C are together but no two S are together.
Solution.
Considering CC as single object, U, CC, E can be arranged in 3! ways
\(\times U\times CC\times E\times\)
Now the three S are to be placed in the four available places \((\times)\)
Hence required no. of ways \(=3!\cdot{}^4C_3=24\).
Teacher's Note: Glue CC, arrange U, CC, E, then put three S's in the four gaps.
Exam Note: Glue together, gap for never-together.
Question 5.44. There are six teachers. Out of them two are primary teachers, two are middle teachers and two secondary teaches. They are to stand in a row, so as the primary teaches, middle teaches and secondary teaches are always in a set. Find the number of ways in which they can do so.
Solution.
There are 2 primary teachers. They can stand in a row in \(2!=2\) ways
There are 2 middle teachers. They can stand in a row in \(2!=2\) ways.
There are 2 secondary teachers. They can stand in a row in \(2!=2\) ways.
These three sets can be arranged in themselves in \(=3!=6\) ways
Hence the required number of ways \(=2\times 2\times 2\times 6=48\)
Teacher's Note: Arrange within each group, then arrange the three groups as blocks.
Exam Note: Blocks: arrange within, then among.
Question 5.45. There are 2 identical white balls, 3 identical red balls and 4 green balls of different shades. Find the number of ways in which they can be arranged in a row so that at least one ball is separated from the balls of the same colour.
Solution.
Total number of arrangements without any restrictions \(=\dfrac{9!}{2!\,3!}\)
Now number of ways when balls of the same color are together \(=3!\,4!\)
Now required number of ways = Total number of arrangements \(-\) number of ways when balls of the same colour are together
\(=\dfrac{9!}{2!\,3!}-3!\,4!=6(7!-4!)\)
Teacher's Note: Total arrangements minus those with every colour grouped together.
Exam Note: At least one separated: use complement.
Question 5.46. Find the number of ways in which 6 boys and 6 girls can be seated in a row so that
(i) all the girls sit together and all the boys sit together,
(ii) all the girls are never together.
Solution.
(i) Considering boys and girls as two units, the number of permutations is \(2!\times 6!\times 6!=2\times(6!)^2\).
(ii) The total arrangements where all girls are not together is as follows: Total arrangement without any restrictions \(-\) arrangement when all girls are together \(=(12)!-7!\,6!\).
Teacher's Note: Glue groups as blocks; for never-together subtract the glued case from total.
Exam Note: Glued block count, then complement.
Question 5.47. The numbers ways in which the letters of the word 'ARRANGE' be arranged so that
(i) the two R's are never together,
(ii) the two A's are together but not two R's,
(iii) neither two A's nor two R's are together.
Solution.
The letters of word ARRANGE can be rewritten as A R N G E / A R. So we have 2 A's and 2 R's, i.e., total 7 letters.
(i) The number of words in which 2 R's are together [consider (R R) as one unit] is \(6!/2!\), e.g., (R R), A, A, N, G, E.
Note that permutations of R R give nothing extra. Therefore, number of words in which the two R's are never together is
\(\dfrac{7!}{2!\,2!}-\dfrac{6!}{2!}=900\)
(ii) The number of words in which both A's are together is \(6!/2!=360\), e.g., (A A), R, R, N, G, E.
The number of words in which both A's and both R's are together is \(5!=120\), e.g., (A A), (R R), N, G, E.
Therefore, the number of words in which both A's are together but the two R's are not together is \(360-120=240\).
(iii) There are in all 900 words in each of which the two R's are never together. Consider any such word. Either the two A's are together or the two A's are not together. But the number of all such arrangements in which the two A's are together is 240. Hence, the number of all such arrangements in which the two A's are not together is \(900-240=660\).
Teacher's Note: Use gluing and complements for the repeated letters A and R.
Exam Note: Together-or-not complement for repeated letters.
Question 5.48. Prove that \({}^{n}C_{r}+2{}^{n}C_{r-1}+{}^{n}C_{r-2}={}^{n+2}C_{r}\).
Solution.
\({}^{n}C_{r}+2{}^{n}C_{r-1}+{}^{n}C_{r-2}\)
\(={}^{n}C_{r}+{}^{n}C_{r-1}+{}^{n}C_{r-1}+{}^{n}C_{r-2}\)
\(={}^{n+1}C_{r}+{}^{n+1}C_{r-1}={}^{n+2}C_{r}\)
Teacher's Note: Split 2 nC(r-1) and apply Pascal's rule twice.
Exam Note: Pascal: nCr + nC(r-1) = (n+1)Cr.
Question 5.49. Prove that \({}^{r}C_{r}+{}^{r+1}C_{r}+\cdots+{}^{n}C_{r}={}^{n+1}C_{r+1}\).
Solution.
\({}^{r}C_{r}+{}^{r+1}C_{r}+{}^{r+2}C_{r}+\cdots+{}^{n-1}C_{r}+{}^{n}C_{r}\)
\(={}^{r+1}C_{r+1}+{}^{r+1}C_{r}+{}^{r+2}C_{r}+\cdots+{}^{n-1}C_{r}+{}^{n}C_{r}\)
\(={}^{r+2}C_{r+1}+{}^{r+2}C_{r}+\cdots+{}^{n-1}C_{r}+{}^{n}C_{r}\)
\(={}^{r+3}C_{r+1}+\cdots+{}^{n-1}C_{r}+{}^{n}C_{r}\)
On adding similar way, we get
L.H.S. \(={}^{n-1}C_{r+1}+{}^{n-1}C_{r}+{}^{n}C_{r}\)
\(={}^{n}C_{r+1}+{}^{n}C_{r}\)
\(={}^{n+1}C_{r+1}\) = R.H.S.
Teacher's Note: Replace rCr by (r+1)C(r+1) and repeatedly apply Pascal's rule.
Exam Note: Hockey-stick identity by Pascal's rule.
Question 5.50. If \({}^{15}C_{3r}={}^{15}C_{r+3}\), then find \(r\).
Solution.
\({}^{15}C_{3r}={}^{15}C_{r+3}\)
\(\Rightarrow 3r=r+3\ \text{or}\ 3r+r+3=15\)
\(\Rightarrow r=3/2\ \text{or}\ r=3\)
\(\Rightarrow r=3\) (as \(r\) is positive integer)
Teacher's Note: If nCx = nCy then x = y or x + y = n.
Exam Note: nCx = nCy gives x=y or x+y=n.
Question 5.51. If \({}^{n}C_{r}=84,\ {}^{n}C_{r-1}=36\) and \({}^{n}C_{r+1}=126\), then find the value of \(n\).
Solution.
\(\dfrac{n-r+1}{r}=\dfrac{84}{36}=\dfrac73\) and \(\dfrac{n-r}{r+1}=\dfrac{126}{84}=\dfrac32\)
\(\therefore\ \dfrac73 r-1=n-r=\dfrac32(r+1)\)
or
\(14r-6=9r+9\) or \(r=3\)
\(\therefore\ n=9\)
Teacher's Note: Use ratio nCr / nC(r-1) = (n-r+1)/r twice to get r, then n.
Exam Note: Use consecutive-binomial ratio formula.
Question 5.52. If \({}^{n}C_{8}={}^{n}C_{6}\), then find \({}^{n}C_{2}\).
Solution.
If \({}^{n}C_{x}={}^{n}C_{y}\) and \(x\ne y\), then \(x+y=n\). Hence,
\({}^{n}C_{8}={}^{n}C_{6}\)
\(\Rightarrow n=(8+6)=14\)
Now,
\({}^{n}C_{2}={}^{14}C_{2}=\dfrac{14\times 13}{2}=91\)
Teacher's Note: Equal nCr with different r means r values sum to n.
Exam Note: x+y=n gives n=14.
Question 5.53. If the ratio \({}^{2n}C_3:{}^nC_3\) is equal to 11:1, find \(n\).
Solution.
We have,
\({}^{2n}C_3:{}^nC_3=11:1\)
\(\Rightarrow\dfrac{{}^{2n}C_3}{{}^nC_3}=\dfrac{11}{1}\)
\(\Rightarrow\dfrac{\frac{(2n)!}{(2n-3)!(3!)}}{\frac{n!}{(n-3)!(3!)}}=\dfrac{11}{1}\)
\(\Rightarrow\dfrac{(2n)!}{(2n-3)!}\times\dfrac{(n-3)!}{n!}=\dfrac{11}{1}\)
\(\Rightarrow\dfrac{(2n)(2n-1)(2n-2)}{n(n-1)(n-2)}=\dfrac{11}{1}\)
\(\Rightarrow\dfrac{4(2n-1)}{n-2}=\dfrac{11}{1}\)
\(\Rightarrow 8n-4=11n-22\)
\(\Rightarrow 3n=18\Rightarrow n=6\)
Teacher's Note: Expand both combinations, cancel common factorials, and solve the linear equation.
Exam Note: Cancel n(n-1) factors carefully.
Question 5.54. If \({}^{15}C_{3r}:{}^{15}C_{r+1}=11:3\), find the value of \('r'\).
Solution.
\({}^{15}C_{3r}:{}^{15}C_{r+1}=11:3\)
Clearly, \('r'\) can be 0, 1, 2, 3, 4, 5 but possibilities of \(r=0\) or 5 are clearly ruled out (as \({}^{15}C_{0}={}^{15}C_{15}=1\)).
For \(r=1\),
\({}^{15}C_{3r}={}^{15}C_{3}=\dfrac{15\times14\times13}{6}\) and \({}^{15}C_{r+1}={}^{15}C_{2}=\dfrac{15\times 14}{2}\)
\(\therefore\ {}^{15}C_{3r}:{}^{15}C_{r+1}=13:3\)
For \(r=2\),
\({}^{15}C_{3r}={}^{15}C_{6}=\dfrac{15\times14\times13\times12\times11\times10}{6\times5\times4\times3\times2\times1}\)
\({}^{15}C_{r+1}={}^{15}C_{3}=\dfrac{15\times14\times13}{6}\)
\(\therefore\ {}^{15}C_{3r}:{}^{15}C_{r+1}\ne 11:3\)
For \(r=3\),
\({}^{15}C_{3r}={}^{15}C_{9}=\dfrac{15\times14\times13\times12\times11\times10}{6\times5\times4\times3\times2\times1}\)
\({}^{15}C_{r+1}={}^{15}C_{4}=\dfrac{15\times14\times13\times12}{4\times3\times2\times1}\)
\(\therefore\ {}^{15}C_{3r}:{}^{15}C_{r+1}=11:3\)
For \(r=4\),
\({}^{15}C_{3r}={}^{15}C_{12}={}^{15}C_{3}=\dfrac{15\times14\times13}{3\times2\times1}\)
\({}^{15}C_{r+1}={}^{15}C_{5}=\dfrac{15\times14\times13\times12\times11}{5\times4\times3\times2\times1}\)
\(\therefore\ {}^{15}C_{3r}:{}^{15}C_{r+1}=5:33\)
Thus, \(r=3\).
Teacher's Note: 3r<=15 limits r to 0..5; test each value of r.
Exam Note: Test the finite possible values of r.
Question 5.55. Twenty-eight games were played in a football tournament with each team playing once against each other. How many teams were there?
Solution.
Let the number of teams be \(n\). Then number of matches to be played is \({}^{n}C_{2}=28\).
\(\therefore\ \dfrac{n(n-1)}{2}=28\)
\(\Rightarrow n^2-n-56=0\)
\(\Rightarrow (n-8)(n+7)=0\)
\(\Rightarrow n=8\) as \(n\ne -7\)
Teacher's Note: Each pair of teams plays once: nC2 equals 28.
Exam Note: Matches = nC2.
Question 5.56. In a network of railways, a small island has 15 stations. Find the number of different types of tickets to be printed for each class, if every stations must have tickets for other stations.
Solution.
For each pair of stations, two different types of tickets are required.
Now, the number of selections of 2 stations from 15 stations \(={}^{15}C_{2}\).
\(\therefore\) Required number of types of tickets \(=2\,{}^{15}C_{2}=2\dfrac{15!}{2!\,13!}=15\times 14=210\).
Teacher's Note: Each pair of stations needs two ticket types, one per direction.
Exam Note: Ordered pairs: twice nC2.
Question 5.57. In a certain algebraical exercise book there are 4 examples on arithmetical progressions, 5 examples on permutation and combination and 6 examples on binomial theorem. Find the number of ways a teacher can select for his pupils at least one but not more than 2 examples from each of these sets.
Solution.
Number of ways teacher can select examples from arithmetic progression \(=({}^{4}C_{1}+{}^{4}C_{2})\)
Number of ways teacher can select examples from permutation and combinations \(=({}^{5}C_{1}+{}^{5}C_{2})\)
Number of ways teacher can select examples from binomial theorem \(=({}^{6}C_{1}+{}^{6}C_{2})\)
Hence total number of ways \(=({}^{4}C_{1}+{}^{4}C_{2})({}^{5}C_{1}+{}^{5}C_{2})({}^{6}C_{1}+{}^{6}C_{2})=10\times 15\times 21=3150\).
Teacher's Note: Per set choose 1 or 2 examples; multiply the three counts.
Exam Note: Multiply independent selections.
Question 5.58. A person tries to form as many different parties as he can, out of his 20 friends. Each party should consist of the same number. How many friends should be invited at a time? In how many of these parties would the same friends be found?
Solution.
Let the person invite \(r\) number of friends at a time. Then, the number of parties is \({}^{20}C_{r}\), which is maximum when \(r=10\).
If a particular friend will be found in \(x\) parties, then \(x\) is the number of combinations out of 20 in which this particular friend must be included. Therefore, we have to select 9 more from 19 remaining friends. Hence, \(x={}^{19}C_{9}\).
Teacher's Note: nCr is maximum at middle r; fix one friend and choose the other 9 from 19.
Exam Note: Maximum nCr occurs at r = n/2.
Question 5.59. In how many of the permutations of \(n\) things taken \(r\) at a time will three given things occur?
Solution.
According to the condition of the problem, we have to select \(r-3\) things from remaining \(n-3\) things and permute these \(r\) things. So the number of permutations is
\({}^{n-3}C_{r-3}\,r!=\dfrac{(n-3)!\,r!}{(r-3)!\,(n-r)!}\)
Teacher's Note: Choose the other r-3 things from n-3, then permute all r things.
Exam Note: Select first, then arrange.
Question 5.60. Out of 10 consonants and 4 vowels, how many words can be formed each containing 3 consonants and 2 vowels?
Solution.
The number of ways of selection of three consonants from 10 is \({}^{10}C_{3}\). The number of ways of selection of two vowels from 4 is \({}^{4}C_{2}\). Permutation of these 5 letters (all distinct) is 5!. Therefore, number of words that can be formed is \({}^{10}C_{3}\times{}^{4}C_{2}\times 5!=86400\).
Teacher's Note: Select the letters first, then arrange the five chosen letters.
Exam Note: Selection then arrangement.
Question 5.61. Find the maximum number of points of intersection of 6 circles.
Solution.
Two circles intersect maximum at two distinct points. Now, two circles can be selected in \({}^{6}C_{2}\) ways. Again, each selection of two circles gives two points of intersection. Therefore, the total number of points of intersection is \({}^{6}C_{2}\times 2=30\).
Teacher's Note: Each pair of circles meets in at most 2 points: 2 times 6C2.
Exam Note: Pairs of circles times 2 points.
Question 5.62. There are 10 points on a plane of which no three points are collinear. If lines are formed joining these points, find the maximum points of intersection of these lines.
Solution.
Two points are required to form a line. Then, the number of lines is equal to the number of ways two points are selected, i.e., \({}^{10}C_{2}=45\).
Now, two lines intersect at one point. Hence, the number of points of intersection of lines is \({}^{45}C_{2}\) \((=990)\).
Teacher's Note: Count lines as 10C2, then every pair of lines gives one intersection.
Exam Note: Lines from points, then pairs of lines.
Question 5.63. There are 10 points on a plane of which 5 points are collinear. Also, no three of the remaining 5 points are collinear. Then find (i) the number of straight lines joining these points; (ii) the number of triangles formed joining these points.
Solution.
(i) Line is formed joining two points. Hence, number of lines is \({}^{10}C_{2}\). But joining any points from 5 collinear points gives the same line. Again, 2 points are selected from 5 in \({}^{5}C_{2}\) ways or lines joining collinear points is taken \({}^{5}C_{2}(=10)\) times. Then the number of straight lines \(={}^{10}C_{2}-10+1=36\).
(ii) For a triangle, three points are required. Three points can be selected in \({}^{10}C_{3}\) ways. Now, the selection of three points from 5 collinear points does not form triangle. Hence, number of triangles is \({}^{10}C_{3}-{}^{5}C_{3}\) \((=110)\).
Teacher's Note: Subtract the collinear selections, then add back the single common line.
Exam Note: Collinear points give one line, no triangle.
Question 5.64. Find the total number of rectangles on the normal chessboard.
Solution.
To form a rectangle on a chessboard two vertical lines and two horizontal lines should be selected. There are 9 vertical lines and 9 horizontal lines found on the chessboard. Selection of 2 vertical and 2 horizontal lines can be done in \({}^{9}C_{2}\times{}^{9}C_{2}\) ways, which is equivalent to the number of rectangles. \((=36\times 36=1296)\)
Teacher's Note: A rectangle is fixed by choosing 2 of 9 vertical and 2 of 9 horizontal lines.
Exam Note: Choose pairs of grid lines.
Question 5.65. A box contains 5 different red and 6 different white balls. In how many ways can 6 balls be selected so that there are at least two balls of each colour?
Solution.
The selection of 6 balls, consisting of at least two balls of each colour from 5 red and 6 white balls, can be made in the following ways:
| Red balls (5) | White balls (6) | Number of ways |
|---|---|---|
| 2 | 4 | \({}^{5}C_{2}\times{}^{6}C_{4}=150\) |
| 3 | 3 | \({}^{5}C_{3}\times{}^{6}C_{3}=200\) |
| 4 | 2 | \({}^{5}C_{4}\times{}^{6}C_{2}=75\) |
| Total | 425 |
Teacher's Note: Split by number of red balls (2, 3, 4) and add the products.
Exam Note: Case on colour counts, then add.
Question 5.66. In a conference 10 speakers are present. If \(S_1\) wants to speak before \(S_2\) and \(S_2\) wants to speak after \(S_3\), then find number of ways all the 10 speakers can give their speeches with the above restriction if the remaining seven speakers have no objection to speak at any number.
Solution.
According to question the order of speakers \(S_1,S_2\) and \(S_3\) can be (not necessarily consecutive)
\(S_1S_3S_2\) or \(S_3S_1S_2\)
For each order we can select three slots out of ten in \({}^{10}C_{3}\) ways.
After selecting these three slots in which speakers \(S_1,S_2,S_3\) have only one way of arrangement as said, the remaining seven speakers can be arranged in seven slots in 7! ways.
Hence total number of arrangements \(=2\,{}^{10}C_{3}\,7!\).
Teacher's Note: Choose slots for the three restricted speakers, order them in 2 valid ways, arrange the rest.
Exam Note: Fix slots, then order restricted speakers.
Question 5.67. A delegation of four students is to be selected from a total of 12 students. In how many ways can the delegation be selected
(i) if all the students are equally willing?
(ii) if two particular students have to be included in the delegation?
(iii) if two particular students do not wish to be together in the delegation?
(iv) if two particular students wish to be included together only in the delegation?
(v) if two particular students refuse to be together and two other particular students wish to be together only in the delegation?
Solution.
(i) Formation of delegation means selection of 4 out of 12. Hence, the number of ways is \({}^{12}C_{4}=495\).
(ii) If two particular students are already selected, we need to select only 2 out of the remaining 10. Hence, the number of ways is \({}^{10}C_{2}=45\).
(iii) The number of ways in which both are selected is 45. Hence, the number of ways in which the two are not included together is \(495-45=450\).
(iv) There are two possible cases:
(a) Both are selected. In this case, the number of ways in which the selection can be made is 45.
(b) Both are not selected. In this case, all the four students are selected from the remaining ten students. This can be done in \({}^{10}C_{4}=210\) ways.
Hence, the total number of ways of selection is \(45+210=255\).
(v) We assume that students \(A\) and \(B\) wish to be selected together and students \(C\) and \(D\) do not wish to be together.
| Cases | Number of selection |
|---|---|
| \(A,B\) always selected | \({}^{10}C_{2}=45=s_1\) |
| \(A,B\) always excluded | \({}^{10}C_{4}=210=s_2\) |
| \(A,B,C,D\) always selected | \(1=s_3\) |
| \(A,B\) excluded and \(C,D\) included | \({}^{8}C_{2}=28=s_4\) |
The total number of ways is
\(s_1-s_3+s_2-s_4=45-1+210-28=226\)
Teacher's Note: Use inclusion-exclusion: restricted pairs together or apart, subtracting forbidden overlaps.
Exam Note: Count allowed cases, subtract forbidden overlaps.
Question 5.68. Find the total number of ways of selecting five letters from the word 'INDEPENDENT'.
Solution.
Given letters are I, (N, N, N), (D, D), (E, E, E), P, T
The choices are as follows:
| Choice | Ways |
|---|---|
| All the letters are distinct [different letters are I, N, D, E, P, T] | \({}^{6}C_{5}=6\) |
| 3 distinct, 2 alike | \({}^{3}C_{1}\times{}^{5}C_{3}=30\) |
| 2 distinct, 3 alike | \({}^{2}C_{1}\times{}^{5}C_{2}=20\) |
| 2 alike, 2 alike, 1 distinct | \({}^{3}C_{2}\times{}^{4}C_{1}=12\) |
| 3 alike, 2 alike | \({}^{2}C_{1}\times{}^{2}C_{1}=4\) |
| Total | 72 |
Teacher's Note: Split by pattern of alike and distinct letters and add the cases.
Exam Note: Case on repeated-letter pattern.
Question 5.69. In a plane, there are 5 straight lines which will pass through a given point, 6 others which all pass through another given point and 7 others which all pass through a third given point. Supposing no three lines intersect at any point and no two are parallel, find the number of triangles formed by the intersection of the straight line.
Solution.
Let 5 straight lines be passing through \(A\), 6 passing through \(B\) and 7 passing through \(C\). In all, there are 18 straight lines.
To find the number of triangles equivalent, we have to find the number of selection of 3 lines from these 18 lines, keeping in mind that selection of 3 lines from the lines passing through \(A,B\) or \(C\) will not give any triangle.
Hence, the required number of triangles is \({}^{18}C_{3}-({}^{5}C_{3}+{}^{6}C_{3}+{}^{7}C_{3})=751\).
Teacher's Note: Choose any 3 of 18 lines; remove triples through one common point.
Exam Note: Concurrent lines make no triangle.
Question 5.70. A regular polygon of 10 sides is constructed. In how many ways can 3 vertices be selected so that no two vertices are consecutive?
Solution.
The required number of selections is given as
The number of selections without restriction − (the number of selections when 3 vertices are consecutive) − (the number of selections when 2 vertices are consecutive)
Now, the number of selections of 3 vertices without restriction is \({}^{10}C_{3}\).
The number of selections of 3 consecutive vertices is 10 (by observation: \(A_1A_2A_3,\ A_2A_3A_4,\ \ldots,\ A_{10}A_1A_2\)).
The number of selections when two vertices are consecutive is \(10\times{}^6C_1\).
(After selecting two consecutive vertices in 10 ways, the third can be selected from 6 vertices.)
Therefore, the required number of selections is
\({}^{10}C_{3}-10-10\times{}^{6}C_{1}=\dfrac{10\times9\times8}{6}-10-60=120-70=50\)
Teacher's Note: Subtract selections with 3 consecutive and with exactly 2 consecutive vertices from all.
Exam Note: Complement: remove adjacent-vertex selections.
Question 5.71. Five boys and 5 girls sit alternately around a round table. In how many ways can this be done?
Solution.
Five boys can be arranged in a circle in 4! ways.
After that girls can be arranged in the five gaps shown as '\(\times\)' in 5! ways. Hence, total number of ways is \(4!\times 5!=2880\).
Teacher's Note: Seat boys in a circle first (n-1)!, then girls in the gaps.
Exam Note: Circular arrangement fixes boys first.
Question 5.72. A round-table conference is to be held among 20 delegates belonging from 20 different countries. In how many ways can they be seated if two particular delegates are (i) always to sit together; (ii) never to sit together.
Solution.
(i) Let the two particular delegates who wish to sit together be treated as one delegate. So we have 19 delegates who can be arranged on a round table in \((19-1)!\), i.e., 18! ways.
After this, the two particular delegates can be permuted between themselves in \(2!=2\) ways. Hence, by product rule, number of required arrangements is \(2\times(18)!\).
(ii) The total number of arrangements of 20 delegates on a round table is 19!.
Hence, the number of arrangements in which the two particular delegates never sit together is \(19!-2\times 18!=18!\,(19-2)=17\times 18!\).
Teacher's Note: Glue the pair for 'together'; subtract from 19! for 'never together'.
Exam Note: Circular total is (n-1)!.
Question 5.73. A person invites a group of 10 friends at dinner and sits
(i) 5 on a round table and 5 more on another round table,
(ii) 4 on one round table and 6 on the other round table.
Find the number of ways in each case in which he can arrange the guests.
Solution.
(i) The number of ways of selection of 5 friends for first table is \({}^{10}C_{5}\). Remaining 5 friends are left for second table.
The total number of permutations of 5 guests on each table is 4!. Hence, the total number of arrangements is \({}^{10}C_{5}\times 4!\times 4!=\dfrac{10!}{(5!\times 5!)}4!\times 4!=10!/25\).
(ii) The number of ways of selection of 6 guests is \({}^{10}C_{6}\). The number of ways of permutations of 6 guests on round table is 5!. The number of permutation of 4 guests on round table is 3!.
Therefore, total number of arrangements is
\({}^{10}C_{6}\times 5!\,3!=\dfrac{(10)!}{6!\times 4!}5!\,3!=\dfrac{(10)!}{24}\)
Teacher's Note: Select guests for each table, then arrange each group circularly in (k-1)! ways.
Exam Note: Select, then circular arrangement each.
Question 5.74. Find the number of ways in which 10 different diamonds can be arranged to make a necklace.
Solution.
Since diamonds do not have natural order of left and right so clockwise and anticlockwise arrangements are taken as identical. Therefore, the number of arrangements of 10 different diamonds to make a necklace is \(\dfrac12\times 9!=181440\).
Teacher's Note: Necklace: circular arrangements (n-1)! halved for reflection.
Exam Note: Necklace count is (n-1)!/2.
Question 5.75. Six persons \(A,B,C,D,E,F\) are to be seated at a circular table. In how many ways can this be done if \(A\) should have either \(B\) or \(C\) on his right and \(B\) must always have either \(C\) or \(D\) on his right.
Solution.
Let the seat occupied by \(A\) be numbered as 1 and the remaining 5 seats be numbered as 2, 3, 4, 5, 6 in anticlockwise direction. There arise two cases:
Case I: \(B\) is on right of \(A\), i.e., at number 2.
Then, seat number 3 can be occupied by \(C\) or \(D\) in \({}^{2}C_{1}\) ways and remaining 3 persons can have remaining 3 seats in 3! ways. Hence, the number of arrangements in this case is \(2\times 6=12\).
Case II: \(C\) is on the right of \(A\), i.e., at number 2.
Then, \(B\) can occupy any seat from number 3 or 4 or 5. Then, \(D\) must be on the right of \(B\), so we are left with two persons and 2 seats, which can be occupied in 2! ways. Hence, the number of arrangements in this case is \({}^{3}C_{1}\times 2!=6\). These cases are exclusive. So by sum rule total number of arrangements is \(12+6=18\).
Teacher's Note: Fix A at seat 1, split into the two cases for A's right neighbour, then add.
Exam Note: Fix one person to break circular symmetry.
Question 5.76. Find the number of ways in which six persons can be seated at a round table, so that all shall not have the same neighbours in any two arrangements.
Solution.
In this case, anticlockwise and clockwise arrangements are the same.
Hence, the number of ways of arrangements is \(5!/2=60\).
Teacher's Note: Mirror-image seatings give the same neighbours, so halve (n-1)!.
Exam Note: Same neighbours: divide (n-1)! by 2.
Question 5.77. There are \(p\) copies each of \(n\) different books. Find the number of ways in which a non-empty selection can be made from them.
Solution.
Number of selections of any number of copies of a book is \(p+1\) (because copies of the same book are identical things). Similar is the case for each book. Therefore, total number of selections is \((p+1)^n\).
But this includes a selection, which is empty, i.e., zero copy of each book. Excluding this, the required number of non-empty selections is \((p+1)^n-1\).
Teacher's Note: Each book has p+1 choices (0 to p copies); remove the empty selection.
Exam Note: Multiply (p+1) per book, subtract 1.
Question 5.78. A person is permitted to select at least one and at most \(n\) coins from a collection of \((2n+1)\) distinct coins. If the total number of ways in which he can select coins is 255, find the value of \(n\).
Solution.
We have,
\({}^{2n+1}C_{1}+{}^{2n+1}C_{2}+\cdots+{}^{2n+1}C_{n}=255\qquad(1)\)
Also the sum of binomial coefficients is
\({}^{2n+1}C_{0}+{}^{2n+1}C_{1}+\cdots+{}^{2n+1}C_{n}+{}^{2n+1}C_{n+1}+\cdots+{}^{2n+1}C_{2n+1}=(1+1)^{2n+1}=2^{2n+1}\)
\(\Rightarrow {}^{2n+1}C_{0}+2({}^{2n+1}C_{1}+{}^{2n+1}C_{2}+\cdots+{}^{2n+1}C_{n})+{}^{2n+1}C_{2n+1}=2^{2n+1}\)
\(\Rightarrow 1+2(255)+1=2^{2n+1}\)
\(\Rightarrow 1+255=2^{2n}\)
\(\Rightarrow 2^{2n}=2^8\Rightarrow n=4\)
Teacher's Note: Use symmetry of binomial coefficients: total 2^(2n+1) equals 2 times given sum plus 2.
Exam Note: Binomial coefficients are symmetric.
Question 5.79. Nishi has 5 coins each of the different denomination. Find the number different sums of money she can form.
Solution.
Number of different sums of money she can form is equal to number of ways she select one or more coins
\(\therefore\) Required no. of ways \(={}^{5}C_{1}+{}^{5}C_{2}+{}^{5}C_{3}+{}^{5}C_{4}+{}^{5}C_{5}=2^5-1=31\).
Teacher's Note: Each non-empty selection of distinct-denomination coins gives a distinct sum.
Exam Note: Non-empty subsets: 2^n - 1.
Question 5.80. Find the number of groups that can be made from 5 different green balls, 4 different blue balls and 3 different red balls, if at least 1 green and 1 blue ball is to be included.
Solution.
At least, one green ball can be selected out of 5 green balls in \(2^5-1\), i.e., in 31 ways.
Similarly, at least one blue ball can be selected from 4 blue balls in \(2^4-1=15\) ways. And at least one red or no red ball can be selected in \(2^3=8\) ways.
Hence, the required number of ways is \(31\times 15\times 8=3720\).
Teacher's Note: Multiply: nonempty greens, nonempty blues, any reds.
Exam Note: At least one: 2^n - 1; any: 2^n.
Question 5.81. There are 3 books of mathematics, 4 of science, and 5 of literature. How many different collections can be made such that each collection consists of
(i) one book of each subject,
(ii) at least one book of each subject,
(iii) at least one book of literature.
Solution.
(i) \({}^{3}C_{1}\times{}^{4}C_{1}\times{}^{5}C_{1}=3\times 4\times 5=60\)
(ii) \((2^3-1)(2^4-1)(2^5-1)=7\times 15\times 31=3255\)
(iii) \((2^5-1)\times 2^7=31\times 128=3968\)
Teacher's Note: Use 2^n - 1 for 'at least one' in each required subject, 2^n for free subjects.
Exam Note: Subsets: 2^n - 1 for non-empty.
Question 5.82. Find the total number of proper factors of the number 35700. Also find
(i) sum of all these factors,
(ii) sum of the odd proper divisors,
(iii) the number of proper divisors divisible by 10 and the sum of these divisors.
Solution.
\(35700=5^2\times 2^2\times 3^1\times 7^1\times 17^1\)
The total number of factors is equal to the total number of selections from \((5,5),(2,2),(3),(7)\) and \((17)\), which is given by \(3\times 3\times 2\times 2\times 2=72\).
These include 1 and 35700. Therefore, the number of proper divisors (excluding 1 and 35700) is \(72-2=70\)
Sum of all these factors (proper) is
\((5^0+5^1+5^2)(2^0+2^1+2^2)(3^0+3^1)(7^0+7^1)(17^0+17^1)-1-35700\)
\(=31\times 7\times 4\times 8\times 18-1-35700=89291\)
Now, the sum of odd proper divisors is
\((5^0+5^1+5^2)(3^0+3^1)(7^0+7^1)(17^0+17^1)-1\)
\(=31\times 4\times 8\times 18-1=17856-1=17855\)
(Here, 2 as a factor and 1 as a divisor or are to be excluded.)
The number of proper divisors divisible by 10 is equal to number of selections from \((5,5),(2,2),(3),(7),(17)\) consisting of at least one 5 and at least one 2 and 35700 is to be excluded and is given by \(2\times 2\times 2\times 2\times 2-1=31\).
Sum of these divisors is
\((5^1+5^2)(2^1+2^2)(3^0+3^1)(7^0+7^1)(17^0+17^1)-35700\)
\(=30\times 6\times 4\times 8\times 18-35700=67980\)
Teacher's Note: Use exponent form: divisor count is product of (a+1); sum is product of geometric sums.
Exam Note: Proper divisors exclude 1 and N.
Question 5.83. Find the number of ways in which the number 94864 can be resolved as a product of two factors.
Solution.
\(94864=2^4\times 7^2\times 11^2\)
Hence, the number of ways is
\(\dfrac12[(4+1)(2+1)(2+1)+1]=23\)
Teacher's Note: A perfect square: pairs of factors = half of (divisor count plus 1).
Exam Note: Perfect square needs the +1 correction.
Question 5.84. Find the number of divisors of the number \(N=2^3\cdot 3^5\cdot 5^7\cdot 7^9\) which are perfect square.
Solution.
Since the divisor is perfect square each prime factor must occur even number of times.
2 can be taken in 2 ways \((2^0\text{ or }2^2)\)
3 can be taken in 3 ways \((3^0\text{ or }3^2\text{ or }3^4)\)
Similarly 5 can be taken in 4 ways \((5^0\text{ or }5^2\text{ or }5^4\text{ or }5^6)\) and 7 can be taken in 5 ways \((7^0\text{ or }7^2\text{ or }7^4\text{ or }7^6\text{ or }7^8)\)
hence total divisors which are perfect squares \(=2\cdot 3\cdot 4\cdot 5=120\)
Teacher's Note: Perfect-square divisors need even exponents; count even choices for each prime.
Exam Note: Even exponents only.
Question 5.85. Find the number of ways in which the number 300300 can be split into 2 factors which are relatively prime.
Solution.
\(300300=2^2\,3^1\,5^2\,7^1\,11^1\,13^1\)
Now we have to make factors which are relative prime.
\(\Rightarrow 2^2,3^1,5^2,7^1,11^1,13^1\) should behave as single identities.
So no. of divisors \((1+1)(1+1)(1+1)(1+1)(1+1)(1+1)=2^6=64\)
No. of ways of splitting into 2 factors \(=\dfrac{64}{2}=32\)
Teacher's Note: Each prime power goes wholly to one factor: 2^6 choices, halved for unordered pairs.
Exam Note: Unordered coprime pairs: 2^(k-1).
Question 5.86. Find the number of ways of dividing 52 cards among four players equally.
Solution.
We can divide 52 cards equally into four groups in \(52!/((13!)^4(4!))\) ways.
Now, these four groups can be distributed among four players as 4! ways.
Therefore, the total number of ways of dividing the cards among four players equally is
\(\dfrac{52!}{(13!)^4(4!)}\times 4!=\dfrac{52!}{(13!)^4}\)
Teacher's Note: Divide into four equal unlabelled groups, then assign groups to the players.
Exam Note: Equal groups: divide by 4! first.
Question 5.87. Find the number of ways to give 16 different things to three persons \(A,B,C\) so that \(B\) gets 1 more than \(A\) and \(C\) gets 2 more than \(B\).
Solution.
Let \(A\) get \(n\) objects, then \(B\) gets \(n+1\) and \(C\) gets \(n+3\)
Now \(n+n+1+n+3=16\Rightarrow n=4\)
\(\Rightarrow A,B,C\) gets 4, 5 and 7 objects respectively.
Number of ways of distribution is equal to number of ways 16 objects can be divided into three groups of size 4, 5 and 7.
Hence, number of ways \(=\dfrac{16!}{4!\,5!\,7!}\).
Teacher's Note: Find group sizes 4, 5, 7 from the conditions; count unequal-size divisions.
Exam Note: Sizes distinct, so no extra ordering.
Question 5.88. In how many ways can 8 different books be distributed among 3 students if each receives at least 2 books?
Solution.
If each receives at least two books, then the division trees would be (2, 2, 4) and (3, 3, 2).
The number of division ways for the tree (2, 2, 4) is \(8!/((2!)^2\,4!\,2!)\). The number of division ways for the tree (3, 3, 2) is \(8!/((3!)^2\,2!\,2!)\). The total number of ways of distribution of these groups among 3 students is
\(\left[\dfrac{8!}{(2!)^2\,4!\,2!}+\dfrac{8!}{(3!)^2\,2!\,2!}\right]\times 3!\) \((=2940)\)
Teacher's Note: Possible splits are 2,2,4 and 3,3,2; divide, then assign to three students.
Exam Note: Equal-size groups need division by factorial.
Question 5.89. \(n\) different toys have to be distributed among \(n\) children. Find the number of ways in which these toys can be distributed so that exactly one child gets no toy.
Solution.
If exactly one child gets no toy, then exactly one child must get two toys and rest \(n-2\) gets one toy each.
The division tree has one group of 0 objects, one group of 2 objects and \(n-2\) groups of 1 object each.
The number ways of division in the groups as shown in the tree is
\(\dfrac{n!}{0!\,2!\,(1!)^{n-2}(n-2)!}=\dfrac{n!}{2!\,(n-2)!}={}^nC_2\)
The number of ways of distribution of these \(n\) groups among \(n\) children is \(n!\). Then, the total number of ways of distributions is \({}^nC_2\times n!\).
Teacher's Note: Pick the two toys that go together, then assign the n groups to the n children.
Exam Note: Group the toys, then permute groups.
Question 5.90. Find the number of ways in which \(n\) different prizes can be distributed among \(m\ (<n)\) persons if each is entitled to receive at most \(n-1\) prizes.
Solution.
The total number of ways is \(m\times m\times\cdots n\text{ times}=m^n\). The number of ways in which one gets all the prizes is \(m\). Therefore, the required number of ways is \(m^n-m\).
Teacher's Note: Subtract the m cases where one person gets every prize.
Exam Note: Complement: one person takes all.
Question 5.91. Find the number of non-negative integral solutions of the equations \(x+y+z=10\).
Solution.
Here, the number of solutions is equivalent to the number of ways. Ten identical objects are distributed in 3 distinct boxes if empty boxes are allowed, which is \({}^{10+3-1}C_{3-1}={}^{12}C_2=66\).
Teacher's Note: Non-negative solutions of a sum of r variables equal n: (n+r-1)C(r-1).
Exam Note: Stars and bars with empty boxes allowed.
Question 5.92. Find the number of positive integral solutions of the equations \(x+y+z=12\).
Solution.
Here, the number of solutions is equivalent to number of ways. Twelve identical objects are distributed in 3 distinct boxes if empty boxes are not allowed, which is \({}^{12-1}C_{3-1}={}^{11}C_2=55\).
Teacher's Note: Positive solutions: (n-1)C(r-1).
Exam Note: Stars and bars, no empty boxes.
Question 5.93. Find the number of non-negative integral solutions of the equation \(x+y+z+2w=20\).
Solution.
Let \(w=0\). Then, the equation reduces to \(x+y+z=20\). Number of non-negative integral solutions is \({}^{20+3-1}C_{3-1}={}^{22}C_2\). If \(w=1\), then the equation reduces to \(x+y+z=18\). Number of non-negative integral solutions is \({}^{18+3-1}C_{3-1}={}^{20}C_2\).
Similarly, we have \(w=2,3,\ldots,10\).
Therefore, the total number of solutions is \({}^{22}C_2+{}^{20}C_2+{}^{18}C_2+\cdots+{}^{4}C_2+{}^{2}C_2\) \((=946)\).
Teacher's Note: Fix w from 0 to 10; count non-negative solutions of x+y+z = 20-2w each time.
Exam Note: Case on w, then stars and bars.
Question 5.94. Find the number of non-negative integral solutions of \(x+y+z+w\le 20\).
Solution.
Let,
\(x+y+z+w+t=20\qquad(1)\)
where \(t\ge 0\).
Now, we find the non-negative integral solutions of Eq. (1). The total number of such solutions is \({}^{20+5-1}C_{5-1}={}^{24}C_4\) \((=10626)\).
Teacher's Note: Add slack variable t to turn inequality into equation.
Exam Note: Slack variable converts <= to =.
Question 5.95. In how many ways can a party of 6 men be selected out of 10 Hindus, 8 Muslims and 6 Christians. If the party consists of at least one person of each religion, find the number of ways of selection. (Consider only the religion of the person.)
Solution.
Let \(x,y\) and \(z\) be the number of Hindus, Muslims and Christians, respectively, who are selected. Then,
\(x+y+z=6\qquad(1)\)
Also, at least one person must be selected from each religion when we have to find non-negative integral solutions of Eq. (1).
Therefore, the number of non-negative solutions of Eq. (1) is \({}^{6-1}C_{3-1}={}^5C_2=10\).
Teacher's Note: Each religion count is at least 1: positive solutions of x+y+z=6.
Exam Note: At least one each: positive solutions.
Question 5.96. Find the total number of positive integral solutions for \((x,y,z)\) such that \(xyz=24\). Also find out the total number of integral solutions.
Solution.
\(24=2^3\times 3\)
Now, consider three boxes \(x,y,z\). 3 can be put in any of the three boxes.
Also, 2, 2, 2 can be distributed in the three boxes in \({}^{3+3-1}C_{3-1}={}^5C_2\) ways. Hence, the total number of positive integral solutions is equal to the number of distributions which is given by \(3\times{}^5C_2=30\).
Note: If any box remains empty, say \(x\), then \(x=1\). To find integral solutions where integers are also allowed. Any two of the factors in each factorization may be negative. Therefore, the number of ways to associate negative sign in each case is \({}^3C_2=3\). Hence, the total number of integral solutions is \(30+3\times 30=120\).
Teacher's Note: Distribute prime factors 2,2,2 and 3 into three variables; negatives come in pairs.
Exam Note: Negative signs must occur in pairs.
Question 5.97. In how many ways can 10 persons take seats in a row of 24 fixed seats so that no two persons take consecutive seats.
Solution.
As no two persons take consecutive seats, there will be at least one vacant seat between any two persons sitting before the first person and after the last person. Let the number of vacant seats before the first person \(=x_0\), and the number of vacant seats between the first and the second persons be \(x_1\), etc.
Clearly, the total number of vacant seats is \(24-10=14\).
\(\therefore\ x_0+x_1+x_2+\cdots+x_9+x_{10}=14\)
where \(x_0\ge0,\ x_1\ge1,\ x_2\ge1,\ x_3\ge1,\ \ldots,\ x_9\ge1,\ x_{10}\ge0\).
Let \(x_0=y_0,\ x_1=y_1+1,\ x_2=y_2+1,\ \ldots,\ x_9=y_9+1,\ x_{10}=y_{10}\). Then, the equation becomes
\(y_0+(y_1+1)+(y_2+1)+\cdots+(y_9+1)+y_{10}=14\)
\(\Rightarrow y_0+y_1+y_2+\cdots+y_9+y_{10}=14-9=5\)
Therefore, the required number of ways = the number of non-negative integral solutions of the equation \(y_0+y_1+y_2+\cdots+y_9+y_{10}=5\), i.e., \({}^{5+11-1}C_{11-1}={}^{15}C_{10}\).
But 10 persons can arrange among themselves in 10! ways. Hence, the required number of ways is
\({}^{15}C_{10}\times 10!=\dfrac{15!}{10!\,5!}\times 10!=\dfrac{15!}{5!}\)
Teacher's Note: Place 14 vacant seats with at least one between persons; reduce to stars and bars, then arrange persons.
Exam Note: Gaps between persons need at least one empty seat.
Question 5.98. Find the number of distinct throws which can be thrown with \(n\) six-faced normal dice, which are indistinguishable among themselves.
Solution.
Consider six faces as six beggars and \(n\) identical dice to be identical coins.
Now, number of distribution is \({}^{n+6-1}C_{6-1}={}^{n+5}C_5\). If a beggar (say face 6) gets no coin, then it is equivalent to 6, which does not appear on the dice.
Teacher's Note: Throws are multisets: distribute n identical dice among 6 faces.
Exam Note: Indistinguishable dice give stars and bars.
Question 5.99. In how many ways 3 boys and 15 girls can sit together in a row such that between any 2 boys at least 2 girls sit.
Solution.
First three boys can be arranged in 3! ways. After arranging the boys, four gaps are created. Let in these gaps \(x,y,z\) and \(w\) girls sit as shown in the diagram. Let us first find out the distribution ways of girls in the four gaps. As given in question, \(y,z\ge2\) and \(x,w\ge0\), we have to find the integral solutions of the equation \(x+y+z+w=15\) with the above condition. Let,
\(y=y_1+2\) and \(z=z_1+2\) (where \(y_1,z_1\ge0\))
\(\Rightarrow x+y_1+z_1+w=11\)
Number of solutions of above equation is \({}^{11+4-1}C_{4-1}={}^{14}C_3\). After it is decided as in which gap how many girls will sit, they can be arranged in 15! ways.
Hence, the total number of ways is \(3!\,15!\,{}^{14}C_3\).
Teacher's Note: Arrange boys, distribute girls into 4 gaps with the two inner gaps at least 2, then arrange girls.
Exam Note: Reduce lower bounds by substitution.
Question 5.100. In how many ways the sum of upper faces of four distinct dices can be six.
Solution.
Here, the number of required ways will be equal to the number of solutions of \(x_1+x_2+x_3+x_4=6\), i.e., \(1\le x_1,x_2,x_3,x_4\le 6\). Since the upper limit is six, which is equal to the sum required, so upper limit can be taken as infinite. So, number of solutions is equal to the coefficient of \(t^6\) in \((t+t^2+t^3+\cdots)^4\)
\(=\text{Coefficient of }t^2\text{ in }(1+t+t^2+\cdots)^4\)
\(=\text{Coefficient of }t^2\text{ in }(1-t)^{-4}\)
\(={}^{2+4-1}C_{4-1}={}^5C_3=10\)
Teacher's Note: Dice limit equals the sum, so upper bound is irrelevant; count positive solutions via generating function.
Exam Note: Upper limit not binding: use (1-t)^(-n).
Question 5.101. In how many different ways can 3 persons \(A,B,C\) having 6 one-rupee coin, 7 one-rupee coin, 8 one-rupee coin, respectively, donate 10 one-rupee coin collectively?
Solution.
The number of ways in which they can donate Rs. 10 is same as the number of solutions to the equation \(x_1+x_2+x_3=10\) subject to the condition \(0\le x_1\le 6,\ 0\le x_2\le 7,\ 0\le x_3\le 8\).
Therefore, the required number of ways = Coefficient of \(x^{10}\) in \((1+x+x^2+\cdots+x^6)(1+x+x^2+\cdots+x^7)(1+x+x^2+\cdots+x^8)\)
\(=\text{Coefficient of }x^{10}\text{ in }(1-x^7)(1-x^8)(1-x^9)(1-x)^{-3}\)
\(=\text{Coefficient of }x^{10}\text{ in }(1-x^7-x^8-x^9)(1+{}^3C_1x+{}^4C_2x^2+{}^5C_3x^3+\cdots+{}^{12}C_{10}x^{10})\) (ignoring powers higher than 10).
\(={}^{12}C_2-{}^5C_3-{}^4C_2-{}^3C_1\)
\(=66-10-6-3=47\)
Teacher's Note: Use generating function with upper limits; expand (1-x^k) factors and ignore powers above 10.
Exam Note: Bounded variables: generating functions.
Question 5.102. In an examination, the maximum mark for each of the three papers is 50 and the maximum mark for the fourth paper is 100. Find the number of ways in which the candidate can score 60% marks in aggregate.
Solution.
Let the marks scored by the candidate in four papers be \(x_1,x_2,x_3,x_4\). Then, \(x_1+x_2+x_3+x_4=150\) (i.e., 60% of 250 is 150), where \(0\le x_1,x_2,x_3\le 50,\ 0\le x_4\le 100\).
The number of solutions of the equation is same as the coefficient of \(x^{150}\) in \((1+x+x^2+\cdots+x^{50})^3(1+x+x^2+\cdots+x^{100})\) which is given by
\(\text{Coefficient of }x^{150}\text{ in }\left(\dfrac{1-x^{51}}{1-x}\right)^3\left(\dfrac{1-x^{101}}{1-x}\right)\)
\(=\text{Coefficient of }x^{150}\text{ in }(1-x^{51})^3(1-x^{101})(1-x)^{-4}\)
\(=\text{Coefficient of }x^{150}\text{ in }(1-3x^{51}+3x^{102}-x^{101})(1-x)^{-4}\)
\(={}^{153}C_3-3\times{}^{102}C_3+3\times{}^{51}C_3-{}^{52}C_3\)
\(=110551\)
Teacher's Note: Generating function for bounded marks; expand numerators and read coefficient of x^150.
Exam Note: Bounded sums: inclusion-exclusion via (1-x^k).
Question 5.103. Find the number of non-negative integral solutions of \(x_1+x_2+x_3+4x_4=20\).
Solution.
The number of non-negative integral solutions of the given equation is equal to the coefficient of \(x^{20}\) in \((1-x)^{-1}(1-x)^{-1}(1-x)^{-1}\times(1-x^4)^{-1}\), which is given by
\(\text{Coefficient of }x^{20}\text{ in }(1-x)^{-3}(1-x^4)^{-1}\)
\(=\text{Coefficient of }x^{20}\text{ in }(1+{}^3C_1x+{}^4C_2x^2+{}^5C_3x^3+{}^6C_4x^4+\cdots)(1+x^4+x^8+\cdots)\)
\(=1+{}^6C_4+{}^{10}C_8+{}^{14}C_{12}+{}^{18}C_{16}+{}^{22}C_{20}=536\)
Teacher's Note: Coefficient of 4x4 term gives (1-x^4)^(-1); multiply series and collect x^20.
Exam Note: Non-uniform coefficients: use x^4 in series.
Question 5.104. In how many ways can 15 identical blankets be distributed among six beggars such that everyone gets at least one blanket and two particular beggars get equal blankets and another three particular beggars get equal blankets.
Solution.
The number of ways of distributing blankets is equal to the number of solutions of the equation \(3a+2b+c=15\), \(a,b,c\ge 1\), which is equal to coefficient of \(t^{15}\) in \((t^3+t^6+t^9+t^{12}+\cdots)(t^2+t^4+\cdots)(t+t^2+\cdots)\), which is given by
\(\text{Coefficient of }t^9\text{ in }(1+t^3+t^6+t^9)(1+t^2+t^4+t^6+t^8)(1+t+t^2+\cdots+t^9)\) (neglecting higher powers)
\(=\text{Coefficient of }t^9\text{ in }(1+t^2+t^3+t^4+t^5+2t^6+t^7+2t^8+2t^9)(1+t+t^2+\cdots+t^9)\)
\(=1+1+1+1+1+1+2+1+2+2=12\)
Teacher's Note: Group equal-share beggars: solve 3a+2b+c=15 in positive integers via generating functions.
Exam Note: Equal shares reduce variables.
Question 5.105. In how many ways can 14 identical toys be distributed among three boys so that each one gets at least one toy and no two boys get equal number of toys.
Solution.
Let the boys get \(a,b,c\) toys. Now, \(a+b+c=14,\ a,b,c\ge1\) and \(a,b\) and \(c\) are distinct.
Let \(a<b<c\) and \(x_1=a,\ x_2=b-a,\ x_3=c-b\). So,
\(3x_1+2x_2+x_3=13,\quad x_1,x_2,x_3\ge1\)
Therefore, the number of solutions is equal to the coefficient of \(t^{14}\) in \((t^3+t^6+t^9+\cdots)(t^2+t^4+\cdots)(t+t^2+\cdots)\)
\(=\text{Coefficient of }t^8\text{ in }(1+t^3+t^6)(1+t^2+t^4+t^6+t^8)(1+t+t^2+\cdots+t^8)\) (neglecting higher powers)
\(=\text{Coefficient of }t^8\text{ in }(1+t^2+t^3+t^4+t^5+2t^6+t^7+2t^8)(1+t+t^2+\cdots+t^8)\)
\(=1+1+1+1+1+2+1+2=10\)
Now, three distinct numbers can be assigned to three boys in 3! ways.
So, corresponding to each solution, we have six ways of distribution. So, total numbers of ways is \(10\times 6=60\).
Teacher's Note: Order a<b<c, use differences as variables, count, then multiply by 3! for assignment.
Exam Note: Distinct amounts: order, then permute.
Question 5.106. In how many ways can we get a sum of at most 17 by throwing six distinct dice.
Solution.
Let \(x_1,x_2,\ldots,x_6\) be the number that appears on the six dice. Let us find the number of ways to get the sum less than or equal to 17. This will be same as finding the number of solutions to the inequality \(x_1+x_2+x_3+\cdots+x_6\le17\). Introducing a dummy variable \(x_7\ (x_7\ge0)\), the inequality becomes an equation
\(x_1+x_2+\cdots+x_6+x_7=17\)
Here, \(1\le x_i\le 6\) where \(i=1,2,\ldots,6\) and \(x_7\ge0\). Therefore,
Number of solutions = Coefficient of \(x^{17}\) in \((x+x^2+\cdots+x^6)^6\times(1+x+x^2+\cdots)\)
\(=\text{Coefficient of }x^{11}\text{ in }(1-x^6)^6(1-x)^{-7}\)
\(=\text{Coefficient of }x^{11}\text{ in }(1-6x^6)(1-x)^{-7}={}^{17}C_6-6\,{}^{11}C_5\) \((=9604)\)
Teacher's Note: Add a slack variable for 'at most', then use generating function with upper bound 6.
Exam Note: Slack variable handles at most.
Question 5.107. In how many ways can we get a sum greater than 17 by throwing six distinct dice.
Solution.
Let \(x_1,x_2,\ldots,x_6\) be the number that appears on the six dice. Here, \(1\le x_i\le 6,\ \forall\ i\in\{1,2,3,4,5,6\}\) \(\Rightarrow\) total number of cases is \(6^6\). In the above example, we have calculated the number of ways to get the sum less than or equal to 17, which is
\({}^{17}C_{11}-6\times{}^{11}C_5\).
Hence, the number of ways to get a sum greater than 17 is \(6^6-({}^{17}C_{11}-6\,{}^{11}C_5)\) \((=37052)\).
Teacher's Note: Complement of the 'sum at most 17' count within all 6^6 outcomes.
Exam Note: Greater than = total minus at most.
Question 5.108. Find the numbers of positive integers from 1 to 1000, which are divisible by at least 2, 3 or 5.
Solution.
Let \(A_k\) be the set of positive integers form 1 to 1000, which is divisible by \(k\). Obviously, we have to find \(n(A_2\cup A_3\cup A_5)\). If \([\,\cdot\,]\) denotes the greatest integer function, then
\(n(A_2)=\left[\dfrac{1000}{2}\right]=500\)
\(n(A_3)=\left[\dfrac{1000}{3}\right]=333\)
\(n(A_5)=\left[\dfrac{1000}{5}\right]=200\)
Hence, \(n(A_2\cap A_3)=166,\ n(A_3\cap A_5)=66,\ n(A_2\cap A_5)=100,\ n(A_2\cap A_3\cap A_5)=33\).
Hence, \(n(A_2\cup A_3\cup A_5)=500+333+200-166-66-100+33=734\).
Note that the number of positive integers from 1 to 1000, which are not divisible by 2, 3 or 5 is \(1000-n(A_2\cup A_3\cup A_5)=266\).
Teacher's Note: Inclusion-exclusion over multiples of 2, 3, 5 using floor of 1000/k.
Exam Note: Add singles, subtract pairs, add triple.
Question 5.109. Find the number of ways in which two Americans, two British, one Chinese, one Dutch and one Egyptian can sit on a round table so that persons of the same nationality are separated.
Solution.
Total number of person is 6!. When \(A_1,A_2\) are together,
\(n(A)=5!\,2!=240\)
When \(B_1,B_2\) together,
\(n(B)=5!\,2!=240\)
Also \(n(A\cap B)=4!\,2!\,2!=96\).
\(\therefore\ n(A\cup B)=n(A)+n(B)-n(A\cap B)=240+240-96=384\)
Hence,
\(n(\bar A\cap\bar B)=\text{Total persons}-n(A\cup B)=6!-384=720-384=336\)
Teacher's Note: Total circular arrangements minus those where either nationality pair sits together.
Exam Note: Inclusion-exclusion with glued pairs.
Question 5.110. Find the number of permutations of letters \(a,b,c,d,e,f,g\) taken all together if neither 'beg' nor 'cad' pattern appear.
Solution.
The total number of permutations without any restrictions is 7!.
The number of permutations in which 'beg' pattern always appears is 5!. Likewise, there are some cases in which 'cad' pattern also appears.
The number of permutations in which 'cad' pattern always appears is 5!. Likewise, there are some cases in which 'beg' pattern also appears.
The number of permutations in which 'beg' and 'cad' patterns appears is 3!.
Therefore, the total number of permutations in which 'beg' and 'cad' patterns do not appear is \(7!-5!-5!+3!\) \((=4806)\).
Teacher's Note: Treat each pattern as a block; subtract single-pattern cases and add back both.
Exam Note: Inclusion-exclusion with block patterns.
Question 5.111. Find the number of \(n\) digit numbers, which contain the digits 2 and 7, but not the digits 0, 1, 8, 9.
Solution.
The total number without any restrictions containing digits 2, 3, 4, 5, 6, 7 is \(n(S)=6^n\).
The total number of numbers that contain 3, 4, 5, 6, 7 is \(n(A)=5^n\).
The total number of numbers that contain 2, 3, 4, 5, 6 is \(n(B)=5^n\).
The total number of numbers that contain 3, 4, 5, 6 is \(n(A\cap B)=4^n\).
The total number of numbers that do not contain digits 2 and 7 is \(5^n+5^n-4^n\). The total number of numbers that contain 2 and 7 is \(6^n-5^n-5^n+4^n\).
Teacher's Note: Use inclusion-exclusion to remove numbers lacking 2 or lacking 7 from 6^n.
Exam Note: Both digits present: 6^n - 2*5^n + 4^n.
Question 5.112. There are four balls of different colours and four boxes of colours same as those of the balls. Find the number of ways in which the balls, one in each box, could be placed in such a way that a ball does not go to box of its own colour.
Solution.
Number of derangements in such problems is given by
\(n!\left\{1-\dfrac1{1!}+\dfrac1{2!}-\dfrac1{3!}+\dfrac1{4!}-\cdots+(-1)^n\dfrac1{n!}\right\}\)
Hence, the required number of derangements is
\(4!\left\{\dfrac1{2!}-\dfrac1{3!}+\dfrac1{4!}\right\}=12-4+1=9\)
Teacher's Note: Count derangements of 4 objects with the formula n!(1 - 1/1! + 1/2! - ...).
Exam Note: Derangement: no object in own place.
Question 5.113. Find the number of ways in which 5 distinct balls can be distributed in three different boxes if no box remains empty.
Solution.
By above formula, the number of ways is \(3^5-{}^3C_1\times(3-1)^5+{}^3C_2(3-2)^5=243-96+3=150\).
Teacher's Note: Onto distributions by inclusion-exclusion: r^n - rC1(r-1)^n + rC2(r-2)^n.
Exam Note: Surjection count by inclusion-exclusion.
Question 5.114. If \(n(A)=5\) and \(n(B)=3\), then find the number of onto functions from \(A\) to \(B\).
Solution.
We know that in onto function, each image must be assigned at least one pre-image.
This is equivalent to number of ways in which 5 different objects (pre-images) can be distributed in 3 different boxes (images) if no box remains empty. The total number is given by
\(3^5-{}^3C_1(3-1)^5+{}^3C_2(3-2)^5=243-96+3=150\).
Teacher's Note: Onto functions equal distributions with no empty box.
Exam Note: Onto means every image is used.
Free study material for Mathematics
Download Cengage G Tewani Solutions for Class 11 Math PDF
Chapter-wise Cengage G Tewani Solutions: Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Solved Examples
Explore reliable mathematical solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Solved Examples tailored for Class 11 learners. Utilizing these complete exercise answers ensures your preparation aligns exactly with standard academic requirements.
Detailed Calculation Guides for Class 11
Each problem includes a step-by-step breakdown to clarify complex mathematical formulas and theorems. Utilizing these verified answers ensures students learn the proper problem-solving techniques expected in standard academic assessments.
Complete Your Class 11 Exam Preparation
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.