Official Textbook Solutions: Class 11 Mathematics 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.
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.
Objective Type
Question 1. If \(\alpha={}^mC_2\), then \({}^\alpha C_2\) is equal to
(a) \({}^{m+1}C_4\)
(b) \({}^{m-1}C_4\)
(c) \(3\ {}^{m+2}C_4\)
(d) \(3\ {}^{m+1}C_4\)
Solution.
Answer: (d)\(\alpha={}^mC_2\Rightarrow\alpha=\dfrac{m(m-1)}{2}\)
\(\therefore\ {}^\alpha C_2=\dfrac{\alpha(\alpha-1)}{2}=\dfrac12\cdot\dfrac{m(m-1)}{2}\left\{\dfrac{m(m-1)}{2}-1\right\}\)
\(=\dfrac18m(m-1)(m-2)(m+1)=\dfrac18(m+1)m(m-1)(m-2)=3\,{}^{m+1}C_4\)
Teacher's Note: Substitute alpha = m(m-1)/2 and simplify to a product of four consecutive terms.
Exam Note: Result equals 3 times (m+1)C4.
Question 2. If \({}^nC_3+{}^nC_4>{}^{n+1}C_3\), then
(a) \(n>6\)
(b) \(n>7\)
(c) \(n<6\)
(d) none of these
Solution.
Answer: (a)\({}^nC_3+{}^nC_4>{}^{n+1}C_3\Rightarrow{}^{n+1}C_4>{}^{n+1}C_3\quad(\because\ {}^nC_r+{}^nC_{r+1}={}^{n+1}C_{r+1})\)
\(\Rightarrow\dfrac{{}^{n+1}C_4}{{}^{n+1}C_3}>1\Rightarrow\dfrac{n-2}{4}>1\Rightarrow n>6\)
Teacher's Note: Use Pascal's rule, then the ratio of consecutive binomial coefficients exceeds 1.
Exam Note: Ratio (n-2)/4 greater than 1.
Question 3. The value of \(\sum_{r=0}^{n-1}{}^nC_r/({}^nC_r+{}^nC_{r+1})\) equals
(a) \(n+1\)
(b) \(n/2\)
(c) \(n+2\)
(d) none of these
Solution.
Answer: (b)\(\sum_{r=0}^{n-1}\dfrac{{}^nC_r}{{}^nC_r+{}^nC_{r+1}}=\sum_{r=0}^{n-1}\dfrac{1}{1+\dfrac{{}^nC_{r+1}}{{}^nC_r}}=\sum_{r=0}^{n-1}\dfrac{1}{1+\dfrac{n-r}{r+1}}\)
\(=\sum_{r=0}^{n-1}\dfrac{r+1}{n+1}=\dfrac{1}{n+1}\sum_{r=0}^{n-1}(r+1)=\dfrac{1}{n+1}[1+2+\cdots+n]=\dfrac n2\)
Teacher's Note: Divide by nCr, use ratio (n-r)/(r+1), then sum the arithmetic series.
Exam Note: Terms reduce to (r+1)/(n+1).
Question 4. In a city no two persons have identical set of teeth and there is no person without a tooth. Also no person has more than 32 teeth. If we disregard the shape and size of tooth and consider only the positioning of the teeth, the maximum population of the city is
(a) \(2^{32}\)
(b) \((32)^2-1\)
(c) \(2^{32}-1\)
(d) \(2^{32-1}\)
Solution.
Answer: (c)We have 32 places for teeth. For each place, we have two choices either there is a tooth or there is no tooth. Therefore, the number of ways to fill up these places is \(2^{32}\). As there is no person without a tooth, the maximum population is \(2^{32}-1\).
Teacher's Note: Each of 32 places has tooth or no tooth; exclude the toothless case.
Exam Note: 2^32 patterns minus the empty one.
Question 5. In a room, there are 12 bulbs of the same wattage, each having a separate switch. The number of ways to light the room with different amount of illumination is
(a) \(12^2-1\)
(b) \(2^{12}\)
(c) \(2^{12}-1\)
(d) \(12^2\)
Solution.
Answer: (c)For each bulb there are two possibilities. It will be switched on or off. Hence, total number of ways in which the room can be illuminated is \(2^{12}-1\).
Teacher's Note: Each bulb on or off; remove the all-off case.
Exam Note: 2^12 minus all bulbs off.
Question 6. The number of possible outcomes in a throw of \(n\) ordinary dice in which at least one of the dice shows an odd number is
(a) \(6^n-1\)
(b) \(3^n-1\)
(c) \(6^n-3^n\)
(d) none of these
Solution.
Answer: (c)The total number of ways is \(6\times6\times\cdots n\text{ times}=6^n\). The total number of ways to show only even numbers is \(3\times3\times\cdots n\text{ times}=3^n\). Therefore, the required number of ways is \(6^n-3^n\).
Teacher's Note: Total outcomes minus outcomes with every die even.
Exam Note: Complement: all dice even.
Question 7. Let \(A\) be a set of \(n\ (\ge3)\) distinct elements. The number of triplets \((x,y,z)\) of the \(A\) elements in which at least two coordinates are equal to
(a) \({}^nP_3\)
(b) \(n^3-{}^nP_3\)
(c) \(3n^2-2n\)
(d) \(3n^2(n-1)\)
Solution.
Answer: (b)Total number of triplets without restriction is \(n\times n\times n=n^3\). The number of triplets with all different coordinates is \({}^nP_3\). Therefore, the required number of triplets is \(n^3-n(n-1)(n-2)\), i.e., \(n^3-{}^nP_3\).
Teacher's Note: Subtract triplets with all distinct entries from all n^3 triplets.
Exam Note: At least two equal: complement of all distinct.
Question 8. The total number of flags with three horizontal strips in order, which can be formed using 2 identical red, 2 identical green and 2 identical white strips is equal to
(a) \(4!\)
(b) \(3\times(4!)\)
(c) \(2\times(4!)\)
(d) none of these
Solution.
Answer: (a)If all strips are of different colours, then number of flags is \(3!=6\). When two strips are of same colour, then number of flags is \({}^3C_1\times\dfrac{3!}{2}\times{}^2C_1=18\). Total number of flags is \(6+18=24=4!\).
Teacher's Note: Split into all three colours different, or exactly two strips same colour.
Exam Note: 6 flags plus 18 flags gives 24.
Question 9. The number of five-digit numbers that contain 7 exactly once is
(a) \((41)(9^3)\)
(b) \((37)(9^3)\)
(c) \((7)(9^4)\)
(d) \((41)(9^4)\)
Solution.
Answer: (a)If 7 is used at first place, the number of numbers is \(9^4\) and for any other four places it is \(8\times9^3\) each. Hence the total is \(9^4+4\times8\times9^3=9^3(9+32)=(41)(9^3)\).
Teacher's Note: Place the 7 first, or in one of four other places with nonzero lead.
Exam Note: Four non-leading positions, 8 choices for leading digit.
Question 10. A variable name in certain computer language must be either an alphabet or an alphabet followed by a decimal digit. The total number of different variable names that can exist in that language is equal to
(a) 280
(b) 290
(c) 286
(d) 296
Solution.
Answer: (c)Total number of variables if only alphabet is used is 26. Total number of variables if alphabets and digits both are used is \(26\times10\). Hence, the total number of variables is \(26(1+10)=286\).
Teacher's Note: Count a single letter, plus letter followed by a digit.
Exam Note: 26 plus 260.
Question 11. The number less than 1000 that can be formed using the digits 0, 1, 2, 3, 4, 5 when repetition is not allowed is equal to
(a) 130
(b) 131
(c) 156
(d) 155
Solution.
Answer: (b)The number of one-digit numbers is 6. The number of two-digit numbers is \(5\times5=25\). The number of three-digit numbers is \(5\times5\times4=100\). Hence, the total number is 131.
Teacher's Note: Count one-, two- and three-digit numbers separately with nonzero leading digit.
Exam Note: 6 + 25 + 100.
Question 12. Total number of six-digit numbers that can be formed, having the property that every succeeding digit is greater than the preceding digit, is equal to
(a) \({}^9C_3\)
(b) \({}^{10}C_3\)
(c) \({}^9P_3\)
(d) \({}^{10}P_3\)
Solution.
Answer: (a)\(x_1<x_2<x_3<x_4<x_5<x_6\), when the number is \(x_1x_2x_3x_4x_5x_6\). Clearly no digit can be zero. Also, all the digits are distinct. So, let us first select six digits from the list of digits 1, 2, 3, 4, 5, 6, 7, 8, 9 which can be done in \({}^9C_6\) ways.
After selecting these digits they can be put only in one order. Thus, total number of such numbers is \({}^9C_6\times1={}^9C_3\).
Teacher's Note: Choose six distinct nonzero digits; the increasing order is unique.
Exam Note: Selection of 6 from 9 digits.
Question 13. Numbers greater than 1000 but not greater than 4000, which can be formed with the digits 0, 1, 2, 3, 4 (repetition of digits is allowed), are
(a) 350
(b) 375
(c) 450
(d) 576
Solution.
Answer: (b)Numbers greater than 1000 and less than or equal to 4000 will be of 4 digits and will have either 1 (except 1000) or 2 or 3 in the 1st place with 0 in each of remaining places. After fixing 1st place, the 2nd place can be filled by any of the 5 digits. Similarly the 3rd place can be filled up in 5 ways and 4th place can be filled up in 5 ways. Thus, there will be \(5\times5\times5=125\) ways in which 1 will be in first place but this also includes 1000. Hence, there will be 124 numbers having 1 in the first place. Similarly, 125 for each 2 or 3. One number will be there in which 4 will be in the first place, i.e., 4000. Hence, the required number of ways is \(124+125+125+1=375\).
Teacher's Note: Fix the leading digit 1, 2, 3 (excluding 1000) and add 4000.
Exam Note: 124 + 125 + 125 + 1.
Question 14. The total number of five-digit numbers of different digits in which the digit in the middle is the largest is
(a) \(\sum_{n=4}^{9}{}^nP_4\)
(b) 33(3!)
(c) 30(3!)
(d) none of these
Solution.
Answer: (d)| Middle digit | Digits available for remaining four places | Number of ways filling remaining four places |
|---|---|---|
| 4 | 0, 1, 2, 3 | \(3\times{}^3P_3\) |
| 5 | 0, 1, ..., 4 | \(4\times{}^4P_3\) |
| 6 | 0, 1, ..., 5 | \(5\times{}^5P_3\) |
| 7 | 0, 1, ..., 6 | \(6\times{}^6P_3\) |
| 8 | 0, 1, ..., 7 | \(7\times{}^7P_3\) |
| 9 | 0, 1, ..., 8 | \(8\times{}^8P_3\) |
The total is \(\sum_{n=3}^{8}(n)\,{}^nP_3=18+96+300+720+1470+2688=5292\), which matches none of (a), (b), (c).
Teacher's Note: For each middle digit choose a nonzero first digit, then fill other places.
Exam Note: Total 5292 matches no option.
Question 15. The number of four-digit numbers that can be made with the digits 1, 2, 3, 4 and 5 in which at least two digits are identical is
(a) \(4^5-5!\)
(b) 505
(c) 600
(d) none of these
Solution.
Answer: (b)The number of numbers when repetition is allowed is \(5^4\). The number of numbers when digits cannot be repeated is \({}^5P_5\) (i.e., \(5!\)). Therefore, the required number of numbers is \(5^4-5!=505\).
Teacher's Note: All four-digit strings minus those with all digits different.
Exam Note: 625 - 120 = 505.
Question 16. The number of nine-non-zero digits such that all the digits in the first four places are less than the digit in the middle and all the digits in the last four places are greater than that in the middle is
(a) \(2(4!)\)
(b) \(3(7!)/2\)
(c) \(2(7!)\)
(d) \({}^4P_4\times{}^4P_4\)
Solution.
Answer: (d)According to given conditions, the middle digit must be 5, the first four places are filled with 1, 2, 3, 4 and the last four places with 6, 7, 8, 9. [Fig. 5.39: nine boxes, the first four filled with 1, 2, 3, 4, the last four filled with 6, 7, 8, 9.]
The required number of numbers is \({}^4P_4\times{}^4P_4\).
Teacher's Note: Middle digit is 5; arrange 1-4 on the left and 6-9 on the right.
Exam Note: 4! times 4! arrangements.
Question 17. Total number of words that can be formed using all letters of the word 'BRIJESH' that neither begins with 'I' nor ends with 'B' is equal to
(a) 3720
(b) 4920
(c) 3600
(d) 4800
Solution.
Answer: (a)Total number of words without any restriction is \(7!\). Total number of words beginning with I is \(6!\). Total number of words ending with B is \(6!\). Total number of words beginning with I and ending with B is \(5!\). Thus the total number of required words is \(7!-6!-6!+5!=7!-2(6!)+5!=3720\).
Teacher's Note: Inclusion-exclusion on words beginning with I or ending with B.
Exam Note: 7! - 6! - 6! + 5!.
Question 18. The total number of six-digit natural numbers that can be made with the digits 1, 2, 3, 4, if all digits are to appear in the same number at least once is
(a) 1560
(b) 840
(c) 1080
(d) 480
Solution.
Answer: (a)There can be two types of numbers.
(i) Any one of the digits 1, 2, 3, 4 appears thrice and the remaining digits only once, i.e., of the type 1, 2, 3, 4, 4, 4, etc. Number of ways of selection of digit which appears thrice is \({}^4C_1\). Then the number of numbers of this type is \((6!/3!)\times{}^4C_1=480\).
(ii) Any two of the digits 1, 2, 3, 4 appears twice and the remaining two only once, i.e., of the type 1, 2, 3, 3, 4, 4, etc. The number of ways of selection of two digits which appear twice is \({}^4C_2\). Then the number of numbers of this type is \([6!/(2!\,2!)]\times{}^4C_2=1080\). Therefore, the required number of numbers is \(480+1080=1560\).
Teacher's Note: Split by digit frequencies 3,1,1,1 or 2,2,1,1 and arrange.
Exam Note: 480 + 1080 = 1560.
Question 19. Total number of six-digit numbers in which all and only odd digits appear is
(a) \(\dfrac52(6!)\)
(b) \(6!\)
(c) \(\dfrac12(6!)\)
(d) none of these
Solution.
Answer: (a)Clearly, one of the odd digits 1, 3, 5, 7, 9 will be repeated. The number of selections of the sixth digit is \({}^5C_1=5\). Then the required number of numbers is \(5\times(6!/2!)=\dfrac52(6!)\).
Teacher's Note: All five odd digits appear, one repeats; choose it and arrange.
Exam Note: 5 choices times 6!/2!.
Question 20. Total number less than \(3\times 10^8\) and can be formed using the digits 1, 2, 3 is equal to
(a) \(\dfrac12(3^9+4\times 3^8)\)
(b) \(\dfrac12(3^9-3)\)
(c) \(\dfrac12(7\times 3^8-3)\)
(d) \(\dfrac12(3^9-3+3^8)\)
Solution.
Answer: (c)Formed number can be utmost of nine digits. Total number of such numbers is
\(3+3^2+3^3+\cdots+3^8+2\times3^8=\dfrac{3(3^8-1)}{3-1}+2\times3^8=\dfrac{3^9-3+4\times3^8}{2}=\dfrac{7\times3^8-3}{2}\)
Teacher's Note: Count all lengths up to 8 digits plus nine-digit ones starting with 1 or 2.
Exam Note: Geometric sum plus 2 times 3^8.
Question 21. If all the permutations of the letters in the word 'OBJECT' are arranged (and numbered serially) in alphabetical order as in a dictionary, then the 717th word is
(a) TOJECB
(b) TOEJBC
(c) TOCJEB
(d) TOJCBE
Solution.
Answer: (d)The order of letters of the word 'OBJECT' is B C E J O T.
Words starting with B, C, E, J, O can each be formed in 5! ways.
Words starting with TB, TC, TE, TJ can each be formed in 4! ways.
Words starting with TOB, TOC, TOE can each be formed in 3! ways.
Words starting with TOJB can be formed in 2! ways.
Words starting with TOJC can be formed in 2! ways.
Therefore, the total number of words is 718 words.
Hence 717th word is TOJCBE.
Teacher's Note: Count words alphabetically by prefix until reaching position 717.
Exam Note: Prefix counting gives TOJCBE.
Question 22. In a three-storey building, there are four rooms on the ground floor, two on the first and two on the second floor. If the rooms are to be allotted to six persons, one person occupying one room only, the number of ways in which this can be done so that no floor remains empty is
(a) \({}^8P_6-2(6!)\)
(b) \({}^8P_6\)
(c) \({}^8P_5(6!)\)
(d) none of these
Solution.
Answer: (a)The number of ways of allotment without any restriction is \({}^8P_6\). Now, it is possible that all rooms of 2nd floor or 3rd floor are not occupied. Thus, there are two ways in which one floor remains unoccupied. Hence, the number of ways of allotment in which a floor is unoccupied is \(2\times6!\). Hence, number of ways in which none of the floor remains unoccupied is \({}^8P_6-2(6!)\).
Teacher's Note: Subtract allotments leaving the first or second floor empty.
Exam Note: Ground floor cannot be empty.
Question 23. The total number not more than 20 digits that are formed by using the digits 0, 1, 2, 3 and 4 is
(a) \(5^{20}\)
(b) \(5^{20}-1\)
(c) \(5^{20}+1\)
(d) none of these
Solution.
Answer: (a)Each position can be filled in 5 ways. Hence, the total number of numbers is \(5^{20}\).
Teacher's Note: Each of 20 positions takes any of five digits.
Exam Note: Leading zeros treated as shorter numbers.
Question 24. The number of ways in which we can select four numbers from 1 to 30 so as to exclude every selection of four consecutive numbers is
(a) 27378
(b) 27405
(c) 27399
(d) none of these
Solution.
Answer: (a)The number of ways of selecting four numbers from 1 to 30 without any restriction is \({}^{30}C_4\). The number of ways of selecting four consecutive [i.e. (1, 2, 3, 4), (2, 3, 4, 5), ..., (27, 28, 29, 30)] number is 27. Hence, the number of ways of selecting four integers which excludes consecutive four selections is
\({}^{30}C_4-27=\dfrac{30\times29\times28\times27}{24}-27=27378\)
Teacher's Note: Subtract the 27 runs of four consecutive numbers from 30C4.
Exam Note: 27405 - 27 = 27378.
Question 25. The number of words of four letters containing equal number of vowels and consonants, where repetition is allowed, is
(a) \(105^2\)
(b) \(210\times 243\)
(c) \(105\times 243\)
(d) \(150\times 21^2\)
Solution.
Answer: (d)Let us first select two places for vowel, which can be selected from 4 places in \({}^4C_2\) ways. Now these places can be filled by vowels in \(5\times5=25\) ways as repetition is allowed. The remaining two places can be filled by consonants in \(21\times21\) ways. Then the total number of words is \({}^4C_2\times25\times21^2=150\times21^2\).
Teacher's Note: Choose two vowel places, then fill vowels and consonants freely.
Exam Note: 6 times 25 times 21 squared.
Question 26. The number of different seven digit numbers that can be written using only the three digits 1, 2 and 3 with the condition that the digit 2 occurs twice in each number is
(a) \({}^7P_2\,2^5\)
(b) \({}^7C_2\,2^5\)
(c) \({}^7C_2\,5^2\)
(d) none of these
Solution.
Answer: (b)Other than 2, remaining five places can be filled by 1 and 3 for each place. The number of ways for five places is \(2\times2\times2\times2\times2=2^5\). For 2, selecting 2 places out of 7 is \({}^7C_2\). Hence, the required number of ways is \({}^7C_2\times2^5\).
Teacher's Note: Choose the two places for digit 2, fill the rest with 1 or 3.
Exam Note: 7C2 times 2^5.
Question 27. The total number of three-letter words that can be formed from the letter of the word 'SAHARANPUR' is equal to
(a) 210
(b) 237
(c) 247
(d) 227
Solution.
Answer: (c)Letters: 1 S, 3 A, 1 H, 2 R, 1 N, 1 P, 1 U.
When all letters are different corresponding ways is \({}^7C_3\times3!={}^7P_3=210\). When two letters are of one kind and other is different, corresponding number of ways is \({}^2C_1\times{}^6C_1\times(3!/2!)=36\). When all letters are alike, corresponding number of ways is 1. Thus, total number of words that can be formed is \(210+36+1=247\).
Teacher's Note: Split by letter repetition pattern: all distinct, one pair, or all three alike.
Exam Note: 210 + 36 + 1.
Question 28. The number of ways to fill each of the four cells of the table with a distinct natural number such that the sum of the numbers is 10 and the sums of the numbers placed diagonally are equal is
(a) 4
(b) 8
(c) 24
(d) 6
Solution.
Answer: (b)The natural numbers are 1, 2, 3, 4. Clearly, in one diagonal we have to place 1, 4 and in the other 2, 3. [Fig. 5.40: two arrangements of a 2 by 2 table, (i) with 1, 4 on one diagonal and 2, 3 on the other, and (ii) with the roles of the diagonals exchanged.]
The number of ways in (i) is \(2!\times2!=4\). The number of ways in (ii) is \(2!\times2!=4\). Therefore, the total number of ways is 8.
Teacher's Note: Distinct naturals summing to 10 are 1-4, diagonals sum to 5 each.
Exam Note: Two diagonal pairings, each 4 arrangements.
Question 29. The number of ways of arranging \(m\) positive and \(n\ (<m+1)\) negative signs in a row so that no two negative signs are together is
(a) \({}^{m+1}P_n\)
(b) \({}^{n+1}P_m\)
(c) \({}^{m+1}C_n\)
(d) \({}^{n+1}C_m\)
Solution.
Answer: (c)First arrange \(m\) positive signs. The number of ways is just 1 (as all + signs are identical). Now, \(m+1\) gaps are created of which \(n\) are to be selected for placing '-' signs. Then the total number of ways of doing so is \({}^{m+1}C_n\). After selecting the gaps '-' signs can be arranged in one way only.
Teacher's Note: Place the positives, then choose n of the m+1 gaps for negatives.
Exam Note: Gap method gives (m+1)Cn.
Question 30. Three boys of class X, four boys of class XI and five boys of class XII sit in a row. The total number of ways in which these boys can sit so that all the boys of same class sit together is equal to
(a) \((3!)^2(4!)(5!)\)
(b) \((3!)(4!)^2(5!)\)
(c) \((3!)(4!)(5!)\)
(d) \((3!)(4!)(5!)^2\)
Solution.
Answer: (a)We can think of three packets. One consisting of three boys of class X, other consisting of 4 boys of class XI and last one consisting of 5 boys of class XII. These packets can be arranged in \(3!\) ways and contents of these packets can be further arranged in \(3!,\ 4!\) and \(5!\) ways, respectively. Hence, the total number of ways is \(3!\times3!\times4!\times5!\).
Teacher's Note: Treat each class as a block: arrange blocks, then boys inside blocks.
Exam Note: 3! block orders times 3! 4! 5!.
Question 31. A library has \('a'\) copies of one book, \('b'\) copies each of two books, \('c'\) copies each of three books, a single copy of \('d'\) books. The total number of ways in which these books can be arranged in a shelf is equal to
(a) \(\dfrac{(a+2b+3c+d)!}{a!\,(b!)^2(c!)^3}\)
(b) \(\dfrac{(a+2b+3c+d)!}{a!\,(2b!)(c!)^3}\)
(c) \(\dfrac{(a+b+3c+d)!}{(c!)^3}\)
(d) \(\dfrac{(a+2b+3c+d)!}{a!\,(2b)!\,(3c)!}\)
Solution.
Answer: (a)The total number of books is \(a+2b+3c+d\). The total number of ways in which these books can be arranged in a shelf (in same row) is
\(\dfrac{(a+2b+3c+d)!}{a!\,(b!)^2(c!)^3}\)
Teacher's Note: Arrange all books with repeated copies divided out by factorials.
Exam Note: Copies of one title are identical.
Question 32. The sum of the digits in the unit's place of all numbers formed with the help of 3, 4, 5, 6 taken all at a time is
(a) 18
(b) 432
(c) 108
(d) 144
Solution.
Answer: (c)Required sum is \(3!(3+4+5+6)=6\times18=108\).
[If we fix 3 in the unit place, other three digits can be arranged in 3! ways. Similarly for 4, 5, 6.]
Teacher's Note: Each digit appears 3! times in the unit place.
Exam Note: 3!(3+4+5+6) = 108.
Question 33. The sum of all the numbers of four different digits that can be made by using the digits 0, 1, 2 and 3 is
(a) 26664
(b) 39996
(c) 38664
(d) none of these
Solution.
Answer: (c)The number of numbers with 0 in the unit's place is \(3!=6\).
The number of numbers with 1 or 2 or 3 in the unit's place is \(3!-2!=4\). Therefore the sum of the digits in the unit's place is \(6\times0+4\times1+4\times2+4\times3=24\).
Similarly, for the ten's place, and hundred's places, the number of numbers with 1 or 2 or 3 is the same, so the sum of digits is 24 in each of these places. For the thousand's place, the number of numbers with 1 or 2 or 3 is \(3!\). Therefore, the sum of the digits in the thousand's place is \(6\times1+6\times2+6\times3=36\).
Hence, the required sum is \(36\times1000+24\times100+24\times10+24=38664\).
Teacher's Note: Find digit sums for each place; zero cannot lead, so unit and other places differ.
Exam Note: Place sums 36, 24, 24, 24.
Question 34. The sum of all four-digit numbers that can be formed by using the digits 2, 4, 6, 8 (when repetition of digits is not allowed) is
(a) 133320
(b) 533280
(c) 53328
(d) none of these
Solution.
Answer: (a)Total numbers ending with 2 is 3! as after fixing 2 in the unit's place other three places can be filled by 3! ways. Thus, 2 appears in the unit's place 3! times.
Similarly, all other digits 4, 6 and 8 also appear 3! times. Then sum of the digits in the unit's place is \(6(2+4+6+8)=120\) units. Similarly, sum of digits in ten's place is 120 tens and that in hundred's place is 120 hundreds, etc. Hence, sum of all the 24 numbers is \(120(1+10+10^2+10^3)=120\times1111=133320\).
Teacher's Note: Each digit appears 3! times in each place; sum place contributions.
Exam Note: 120 times 1111.
Question 35. The number of ordered pairs of integers \((x,y)\) satisfying the equation \(x^2+6x+y^2=4\) is
(a) 2
(b) 8
(c) 6
(d) none of these
Solution.
Answer: (b)\((x+3)^2+y^2=13\)
\(\Rightarrow x+3=\pm2,\ y=\pm3\ \text{or}\ x+3=\pm3,\ y=\pm2\)
This gives 4 + 4 = 8 ordered pairs.
Teacher's Note: Complete the square: (x+3)^2 + y^2 = 13 splits into squares 4 and 9.
Exam Note: Eight lattice points on the circle.
Question 36. The number of five-digit telephone numbers having at least one of their digits repeated is
(a) 90000
(b) 100000
(c) 30240
(d) 69760
Solution.
Answer: (d)Using the digits 0, 1, 2, ..., 9 the number of five digit telephone numbers which can be formed is \(10^5\) (since repetition is allowed). The number of five digit telephone numbers which have none of the digits repeated is \({}^{10}P_5=30240\). Therefore, the required number of telephone numbers is \(10^5-30240=69760\).
Teacher's Note: All telephone numbers minus those with five distinct digits.
Exam Note: 100000 - 30240.
Question 37. How many numbers can be made with the digits 3, 4, 5, 6, 7, 8 lying between 3000 and 4000, which are divisible by 5 while repetition of any digit is not allowed in any number?
(a) 60
(b) 12
(c) 120
(d) 24
Solution.
Answer: (b)3 must be at thousand's place and since the number should be divisible by 5, or 5 must be at unit's place. Now, we have to fill two places (tens and hundreds), i.e., \({}^4P_2=12\).
Teacher's Note: Fix 3 first and 5 last, then fill the middle two places.
Exam Note: 4P2 = 12.
Question 38. The number of ways in which ten candidates \(A_1,A_2,\ldots,A_{10}\) can be ranked such that \(A_1\) is always above \(A_{10}\) is
(a) 5!
(b) 2(5!)
(c) 10!
(d) \(\dfrac12(10!)\)
Solution.
Answer: (d)Two positions for \(A_1\) and \(A_{10}\) can be selected in \({}^{10}C_2\) ways. Rest 8 students can be ranked in \(8!\) ways. Hence total number of ways is \({}^{10}C_2\times8!=\tfrac12(10!)\).
Teacher's Note: Choose two positions for A1 and A10 (order fixed), rank others.
Exam Note: Half of all rankings.
Question 39. In the decimal system of numeration of six-digit numbers in which the sum of the digits is divisible by 5 is
(a) 180000
(b) 540000
(c) \(5\times 10^5\)
(d) none of these
Solution.
Answer: (a)[Fig. 5.41: six boxes; the first place has 9 choices, the next four places 10 each, and the last place depends upon the sum of the first five digits.]
First place from left cannot be filled with 0. Next four places can be filled with any of the 10 digits. After filling the first five places, the last place can be filled in following ways:
| Sum of digits in first five places | Digit in the unit's place |
|---|---|
| \(5k\) | 0 or 5 |
| \(5k+1\) | 4 or 9 |
| \(5k+2\) | 3 or 8 |
| \(5k+3\) | 2 or 7 |
| \(5k+4\) | 1 or 6 |
Thus, in any case the last place can be filled in two ways. Hence, the required number of numbers is \(9\times10^4\times2=180000\).
Teacher's Note: Fix the first five digits; the last digit has exactly two valid choices.
Exam Note: 9 times 10^4 times 2.
Question 40. To fill 12 vacancies there are 25 candidates of which five are from scheduled caste. If three of the vacancies are reserved for scheduled caste candidates while the rest are open to all, the number of ways in which the selection can be made is
(a) \({}^5C_3\times{}^{22}C_9\)
(b) \({}^{22}C_9-{}^5C_3\)
(c) \({}^{22}C_3+{}^5C_3\)
(d) none of these
Solution.
Answer: (a)The selection can be made in \({}^5C_3\times{}^{22}C_9\) ways.
(Since 3 vacancies are filled from 5 candidates in \({}^5C_3\) ways and now remaining candidates are 22 and remaining seats are 9.)
Teacher's Note: Choose three reserved-category candidates, then fill nine seats from 22 others.
Exam Note: 5C3 times 22C9.
Question 41. If the difference of the number of arrangements of three things from a certain number of dissimilar things and the number of selections of the same number of things from them exceeds 100, then the least number of dissimilar things is
(a) 8
(b) 6
(c) 5
(d) 7
Solution.
Answer: (d)Here,
\({}^nP_3-{}^nC_3>100\Rightarrow\dfrac{n!}{(n-3)!}-\dfrac{n!}{3!\,(n-3)!}>100\)
\(\Rightarrow\dfrac56n(n-1)(n-2)>100\Rightarrow n(n-1)(n-2)>120\Rightarrow n(n-1)(n-2)>6\times5\times4\)
\(\Rightarrow n=7,8,\ldots\)
So the least number is 7.
Teacher's Note: Solve nP3 - nC3 > 100, so n(n-1)(n-2) > 120.
Exam Note: Least n is 7.
Question 42. Among 10 persons, \(A,B,C\) are to speak at a function. The number of ways in which it can be done if \(A\) wants to speak before \(B\) and \(B\) wants to speak before \(C\) is
(a) 10!/24
(b) 9!/6
(c) 10!/6
(d) none of these
Solution.
Answer: (c)Places for A, B, C can be chosen in \({}^{10}C_3\) ways. Remaining 7 persons can speak in \(7!\) ways. Hence, the number of ways in which they can speak is \({}^{10}C_3\times7!=10!/6\).
Teacher's Note: Choose three slots for A, B, C (order fixed), arrange the others.
Exam Note: 10!/3! orderings.
Question 43. In how many ways can a team of 11 players be formed out of 25 players, if six out of them are always to be included and five always to be excluded
(a) 2020
(b) 2002
(c) 2008
(d) 8002
Solution.
Answer: (b)Since 5 players are always to be excluded and 6 players always to be included, therefore 5 players are to be chosen from 14. Hence required number of ways is \({}^{14}C_5=2002\).
Teacher's Note: Fixed 6 in and 5 out leaves choosing 5 from 14.
Exam Note: 14C5 = 2002.
Question 44. In how many ways can a team of six horses be selected out of a stud of 16, so that there shall always be three out of \(A\ B\ C\ A'\ B'\ C'\), but never \(A\ A',\ B\ B'\) or \(C\ C'\) together
(a) 840
(b) 1260
(c) 960
(d) 720
Solution.
Answer: (c)[Fig. 5.42: of the 16 horses, 6 are A, B, C, A', B', C' and 10 are others.]
The number of ways is \({}^{10}C_3\times\) number of ways of choosing out of \(ABCA'B'C'\), so that \(AA',BB'\) or \(CC'\) are not together \(={}^{10}C_3\) (one from each of pairs \(AA',BB',CC'\))
\(={}^{10}C_3\times8=\dfrac{10\times9\times8}{1\times2\times3}\times8=960\)
Teacher's Note: Choose three from the six with no pair together (2^3), then three others.
Exam Note: 10C3 times 8 = 960.
Question 45. There are two bags each containing \(m\) balls. If a man has to select equals number of balls from both the bags the number of ways in which he can do so if he must choose at least one ball from each bag is
(a) \(m^2\)
(b) \({}^{2m}C_m\)
(c) \({}^{2m}C_m-1\)
(d) none of these
Solution.
Answer: (c)The number of ways of selecting \(r\ (0\le r\le m)\) balls out of \(m\) is \({}^mC_r\). Therefore, the number of ways if selecting \(r\) balls from each of the bag is \(({}^mC_r)^2\). Further the number of ways of selecting equal number of balls from each of the two bags, choosing at least one from each bag, is
\(({}^mC_1)^2+({}^mC_2)^2+\cdots+({}^mC_m)^2={}^{2m}C_m-1\)
[\(\because\ ({}^mC_0)^2+({}^mC_1)^2+\cdots+({}^mC_m)^2={}^{2m}C_m\)]
Teacher's Note: Sum of squares of binomial coefficients minus the zero term.
Exam Note: Vandermonde identity minus 1.
Question 46. The number of ways in which the letters of the word 'PERSON' can be placed in the squares of the given figure so that no row remains empty is
(a) \(24\times 6!\)
(b) \(26\times 6!\)
(c) \(26\times 7!\)
(d) \(27\times 6!\)
Solution.
Answer: (b)There are 6 different letters. We have to select 6 squares, taking at least one from each row and then arranging in each selection. Let us first select places in each row such that no row remains empty.
| \(R_1\) | \(R_2\) | \(R_3\) | Number of selections |
|---|---|---|---|
| 1 | 1 | 4 | \({}^2C_1\,{}^2C_1\,{}^4C_4=4\) |
| 1 | 2 | 3 | \({}^2C_1\,{}^2C_2\,{}^4C_3=8\) |
| 2 | 1 | 3 | \({}^2C_2\,{}^2C_1\,{}^4C_3=8\) |
| 2 | 2 | 2 | \({}^2C_2\,{}^2C_2\,{}^4C_2=6\) |
Therefore, the total number of selections of 6 squares is \(4+8+8+6=26\). For each selection of 6 squares, the number of arrangements of 6 letters is \(6!=720\). Hence, the required number of ways is \(26\times720=18720\).
Teacher's Note: Choose 6 squares with every row used (26 ways), then arrange the 6 letters.
Exam Note: Row-wise square selections total 26.
Question 47. The number of words of four letters that can be formed from the letters of the word 'EXAMINATION' is
(a) 1464
(b) 2454
(c) 1678
(d) none of these
Solution.
Answer: (b)There are 11 letters A, A; I, I; N, N; E, X, M, T, O. For the selection of 4 letters we have the following possibilities:
(A) 2 alike, 2 alike
(B) 2 alike, 2 different
(C) All four different
(A) There are 3 pairs of 2 letters. So, the number of ways of selection of 2 pairs is \({}^3C_2\) and permutation of these 4 letters is \(4!/(2!\,2!)\). Therefore, the number of words in this case is \({}^3C_2\times4!/(2!\,2!)=18\).
(B) We have to select one pair from 3 pairs and 2 distinct letters from remaining 7 distinct letters. For illustration, let us select both A, A; then I, N, E, X, M, T, O, i.e., 7 as remaining distinct letters. Hence, the number of selections is \({}^3C_1\times{}^7C_2\) and these 4 (2 same, 2 distinct) can be permuted in \(4!/2!\) ways. Therefore, number of words is \({}^3C_1\times{}^7C_2\times4!/2!=3\times21\times12=756\).
(C) There are 8 distinct letters so number of words of 4 letters is \({}^8C_4\times4!=1680\). By sum rule, the total number of words is \(18+756+1680=2454\).
Teacher's Note: Split by pattern: two pairs, one pair plus two distinct, all distinct.
Exam Note: 18 + 756 + 1680.
Question 48. The letters of word 'ZENITH' are written in all possible ways. If all these words are written in the order of a dictionary, then the rank of the word 'ZENITH' is
(a) 716
(b) 692
(c) 698
(d) 616
Solution.
Answer: (d)The total number of words is \(6!=720\). Let us write the letters of word ZENITH alphabetically, i.e., EHINTZ.
| For ZENITH word start with | Word starting with | Number of words |
|---|---|---|
| Z | E | 5! |
| H | 5! | |
| I | 5! | |
| N | 5! | |
| T | 5! | |
| ZEN | ZEH | 3! |
| ZEI | 3! | |
| ZENI | ZENH | 2! |
| ZENIT | ZENIH | 1 |
| Total number of words before ZENITH | 615 |
Hence, there are 615 words before ZENITH, so the rank of ZENITH is 616.
Teacher's Note: Count words alphabetically smaller than ZENITH by prefix.
Exam Note: 615 words precede ZENITH.
Question 49. A class contains three girls and four boys. Every Saturday, five go on a picnic (a different group of students is sent every week). During the picnic, each girl in the group is given a doll by the accompanying teacher. If all possible groups of five have gone for picnic once, the total number of dolls that the girls have got is
(a) 21
(b) 45
(c) 27
(d) 24
Solution.
Answer: (b)| Number of girls | Number of boys | Number of groups going to picnic | Total number of dolls |
|---|---|---|---|
| 1 | 4 | \({}^3C_1\,{}^4C_4\) | \(1({}^3C_1\,{}^4C_4)=3\) |
| 2 | 3 | \({}^3C_2\,{}^4C_3\) | \(2({}^3C_2\,{}^4C_3)=24\) |
| 3 | 2 | \({}^3C_3\,{}^4C_2\) | \(3({}^3C_3\,{}^4C_2)=18\) |
| Total | 45 |
Teacher's Note: Count groups by number of girls; each group gives one doll per girl.
Exam Note: 3 + 24 + 18 = 45.
Question 50. A teacher takes three children from her class to the zoo at a time, but she does not take the same three children to the zoo more than once. She finds that she went to the zoo 84 times more than a particular child has gone to the zoo. The number of children in her class is
(a) 12
(b) 10
(c) 60
(d) none of these
Solution.
Answer: (b)The number of times the teacher goes to the zoo is \({}^nC_3\). The number of times a particular child goes to the zoo is equal to number of ways two other children can be selected who accompany a particular child, i.e., \({}^{n-1}C_2\). From the question,
\({}^nC_3-{}^{n-1}C_2=84\)
or
\((n-1)(n-2)(n-3)=6\times84=9\times8\times7\Rightarrow n-1=9\), so \(n=10\).
Teacher's Note: Teacher's trips nC3 minus a child's trips (n-1)C2 equals 84.
Exam Note: This reduces to (n-1)C3 = 84.
Question 51. Number of ways in which a lawn-tennis mixed double be made from seven married couples if no husband and wife play in the same set is
(a) 240
(b) 420
(c) 720
(d) none of these
Solution.
Answer: (b)We first select 2 men out of 7 in \({}^7C_2\) ways. Now we exclude the wives of these two selected men and so select 2 ladies from remaining 5 ladies in \({}^5C_2\) ways. Let A, B be two men and X, Y be the ladies playing in one set. Then we can have
(i) A and X playing against B and Y.
(ii) A and Y playing against B and X.
Then the total number of ways is \({}^7C_2\times{}^5C_2\times2=21\times10\times2=420\).
Teacher's Note: Choose two husbands, two wives not theirs, then pair them in two ways.
Exam Note: 21 times 10 times 2.
Question 52. In a class tournament, all participants were to play different games with one another. Two players fell ill after having played three games each. If the total number of games played in the tournament is equal to 84, the total number of participants in the beginning was equal to
(a) 10
(b) 15
(c) 12
(d) 14
Solution.
Answer: (b)Suppose there \(n\) players in the beginning. The total number of games to be played was equal to \({}^nC_2\) and each player would have played \(n-1\) games.
Let us assume that A and B fell ill. Now the total number of games of A and B is \((n-1)+(n-1)-1=2n-3\). But they have played 3 games each. Then their remaining number of games is \(2n-3-6=2n-9\). Given,
\({}^nC_2-(2n-9)=84\)
\(\Rightarrow n^2-5n-150=0\)
\(\Rightarrow n=15\)
Alternative solution: The number of games excluding A and B is \({}^{n-2}C_2\). But before leaving A and B played 3 games each. Then,\({}^{n-2}C_2+6=84\)
Solving this equation, we get \(n=15\).
Teacher's Note: Games played equal nC2 minus the games the two ill players missed.
Exam Note: Solve n^2 - 5n - 150 = 0.
Question 53. A person always prefers to eat 'parantha' and 'vegetable dish' in his meal. How many ways can he make his platter in a marriage party if there are three types of paranthas, four types of 'vegetable dish', three types of 'salads' and two types of 'sauces'?
(a) 3360
(b) 4096
(c) 3000
(d) none of these
Solution.
Answer: (a)The number of ways he can select at least one parantha is \(2^3-1=7\). The number of ways he can select at least one vegetable dish is \(2^4-1=15\). The number of ways he can select zero or more items from salads and sauces is \(2^5\).
Hence, the total number of ways is \(7\times15\times32=3360\).
Teacher's Note: Each item is chosen or not; need at least one parantha and one vegetable.
Exam Note: 7 times 15 times 32.
Question 54. The number of even divisors of the number \(N=12600=2^33^25^27\) is
(a) 72
(b) 54
(c) 18
(d) none of these
Solution.
Answer: (b)Number of even divisors is equal to number of ways in which one or more '2', zero or more '3', zero or more '5' and zero or more '7' can be selected, and is given by \((3)(2+1)(2+1)(1+1)=54\).
Teacher's Note: Even divisors need at least one factor 2.
Exam Note: 3 times 3 times 3 times 2.
Question 55. A candidate is required to answer six out of 10 questions, which are divided into two groups, each containing five questions. He is not permitted to attempt more than four questions from either group. The number of different ways in which the candidate can choose six questions is
(a) 50
(b) 150
(c) 200
(d) 250
Solution.
Answer: (c)The number of ways the candidate can choose questions under the given conditions is enumerated below.
| Group 1 | Group 2 | Number of ways |
|---|---|---|
| 4 | 2 | \(({}^5C_4)({}^5C_2)=50\) |
| 3 | 3 | \(({}^5C_3)({}^5C_3)=100\) |
| 2 | 4 | \(({}^5C_2)({}^5C_4)=50\) |
| Total number of ways | 200 |
Teacher's Note: Split questions as 4+2, 3+3 or 2+4 between the groups.
Exam Note: 50 + 100 + 50 = 200.
Question 56. There were two women participating in a chess tournament. Every participant played two games with the other participates. The number of games that the men played among themselves proved to exceed by 66 number of games that the men played with the women. The number of participants is
(a) 6
(b) 11
(c) 13
(d) none of these
Solution.
Answer: (c)Let there be \(n\) men participants. Then the number of games that the men play between themselves is \(2\times{}^nC_2\) and the number of games that the men played with the women is \(2\times(2n)\).
\(\therefore\ 2\times{}^nC_2-2\times2n=66\) (by hypothesis)
\(\Rightarrow n^2-5n-66=0\Rightarrow n=11\)
Hence, the number of participants is 11 men + 2 women = 13.
Teacher's Note: Games among men minus games with women equals 66; solve for number of men.
Exam Note: n^2 - 5n - 66 = 0.
Question 57. Two teams are to play a series of five matches between them. A match ends in a win, loss or draw for a team. A number of people forecast the result of each match and no two people make the same forecast for the series of matches. The smallest group of people in which one person forecasts correctly for all the matches will contain \(n\) people, where \(n\) is
(a) 81
(b) 243
(c) 486
(d) none of these
Solution.
Answer: (b)The smallest number of people = total number of possible forecasts = total number of possible results \(=3\times3\times3\times3\times3=243\).
Teacher's Note: Each match has three results; everyone forecasting differently covers all 3^5.
Exam Note: Smallest group equals all possible forecasts.
Question 58. Ten IIT and 2 DCE students sit in a row. The number of ways in which exactly 3 IIT students sit between 2 DCE students is
(a) \({}^{10}C_3\times 2!\times 3!\times 8!\)
(b) \(10!\times 2!\times 3!\times 8!\)
(c) \(5!\times 2!\times 9!\times 8!\)
(d) none of these
Solution.
Answer: (a)Three IIT students who will be between the DCE students can be selected in \({}^{10}C_3\) ways. Now, two DCE students having three IIT students between them can be arranged in \(2!\,3!\) ways. Finally, a group of above five students and the remaining seven students together can be arranged in \(8!\) ways. Hence, total number of ways is \({}^{10}C_3\times2!\times3!\times8!\).
Teacher's Note: Form a block of DCE, three IIT, DCE; arrange it with the other seven students.
Exam Note: Block plus 7 others is 8 objects.
Question 59. A team of four students is to be selected from a total of 12 students. The total number of ways in which the team can be selected such that two particular students refuse to be together and other two particular students wish to be together only is equal to
(a) 220
(b) 182
(c) 226
(d) none of these
Solution.
Answer: (c)Let \(S_1\) and \(S_2\) refuse to be together and \(S_3\) and \(S_4\) want to be together only. The total number of ways when \(S_3\) and \(S_4\) are selected is \(({}^8C_2+{}^2C_1\times{}^8C_1)=44\). The total ways when \(S_3\) and \(S_4\) are not selected is \(({}^8C_4+{}^2C_1\times{}^8C_3)=182\). Thus, the total number of ways is \(44+182=226\).
Teacher's Note: Case on whether the pair S3, S4 is in the team; handle S1, S2 separately.
Exam Note: 44 + 182 = 226.
Question 60. In an election, the number of candidates is one greater than the persons to be elected. If a voter can vote in 254 ways, the number of candidates is
(a) 7
(b) 10
(c) 8
(d) 6
Solution.
Answer: (c)Let there be \(n\) candidates. Then,
\({}^nC_1+{}^nC_2+\cdots+{}^nC_{n-1}=254\)
\(\Rightarrow 2^n-2=254\)
\(\Rightarrow 2^n=2^8\Rightarrow n=8\)
Teacher's Note: A voter picks 1 to n-1 candidates, so 2^n - 2 ways.
Exam Note: 2^n = 256 gives n = 8.
Question 61. Two players \(P_1\) and \(P_2\) play a series of \('2n'\) games. Each game can result in either a win or a loss for \(P_1\). The total number of ways in which \(P_1\) can win the series of these games is equal to
(a) \(\dfrac12(2^{2n}-{}^{2n}C_n)\)
(b) \(\dfrac12(2^{2n}-2\times{}^{2n}C_n)\)
(c) \(\dfrac12(2^n-{}^{2n}C_n)\)
(d) \(\dfrac12(2^n-2\times{}^{2n}C_n)\)
Solution.
Answer: (a)\(P_1\) must win at least \(n+1\) games. Let \(P_1\) win \(n+r\) games \((r=1,2,\ldots,n)\). Therefore, corresponding number of ways is \({}^{2n}C_{n+r}\). The total number of ways is
\(\sum_{r=1}^{n}{}^{2n}C_{n+r}={}^{2n}C_{n+1}+{}^{2n}C_{n+2}+\cdots+{}^{2n}C_{2n}\)
\(=\dfrac{2^{2n}-{}^{2n}C_n}{2}=\dfrac12\left(2^{2n}-{}^{2n}C_n\right)\)
Teacher's Note: P1 needs more than n wins; sum the upper binomial coefficients using symmetry.
Exam Note: Half of 2^(2n) minus the middle term.
Question 62. In an examination of nine papers, a candidate has to pass in more papers than the number of papers in which he fails in order to be successful. The number of ways in which he can be unsuccessful is
(a) 255
(b) 256
(c) 193
(d) 319
Solution.
Answer: (b)The candidate is unsuccessful if he fails in 9 or 8 or 7 or 6 or 5 papers. Therefore, the number of ways to be unsuccessful is
\({}^9C_9+{}^9C_8+{}^9C_7+{}^9C_6+{}^9C_5={}^9C_0+{}^9C_1+{}^9C_2+{}^9C_3+{}^9C_4\)
(recall the concept of half series)
\(=\dfrac12\left({}^9C_0+{}^9C_1+\cdots+{}^9C_9\right)=\dfrac12\times2^9=2^8\)
Teacher's Note: Unsuccessful means failing in at least 5 papers; half of 2^9 by symmetry.
Exam Note: Sum of half the binomial row.
Question 63. A student is allowed to select at most \(n\) books from a collection of \((2n+1)\) books. If the total number of ways in which he can select at least one book is 63, then the value of \(n\) is
(a) 2
(b) 3
(c) 4
(d) 5
Solution.
Answer: (b)Since the student is allowed to select at most \(n\) books out of \((2n+1)\) books, therefore in order to select one book he has the choice to select one, two, three, ..., \(n\) books. Thus, if \(T\) is the total number of ways of selecting one book, then
\(T={}^{2n+1}C_1+{}^{2n+1}C_2+\cdots+{}^{2n+1}C_n=63\qquad(i)\)
Again the sum of binomial coefficients is
\({}^{2n+1}C_0+{}^{2n+1}C_1+\cdots+{}^{2n+1}C_n+{}^{2n+1}C_{n+1}+{}^{2n+1}C_{n+2}+\cdots+{}^{2n+1}C_{2n+1}=(1+1)^{2n+1}=2^{2n+1}\)
or
\({}^{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+2T+1=2^{2n+1}\)
\(\Rightarrow 1+T=\dfrac{2^{2n+1}}{2}=2^{2n}\)
\(\Rightarrow 1+63=2^{2n}\)
\(\Rightarrow 2^6=2^{2n}\Rightarrow n=3\)
Teacher's Note: Use symmetry: selections of at most n from 2n+1 total 2^(2n) - 1.
Exam Note: 1 + 63 = 2^(2n) gives n = 3.
Question 64. In a group of 13 cricket players, four are bowlers. Find out in how many ways can they form a cricket team of 11 players in which at least 2 bowlers are included.
(a) 55
(b) 72
(c) 78
(d) None of these
Solution.
Answer: (c)The number of ways can be given as follows:
2 bowlers and 9 other players: \({}^4C_2\times{}^9C_9\)
3 bowlers and 8 other players: \({}^4C_3\times{}^9C_8\)
4 bowlers and 7 other players: \({}^4C_4\times{}^9C_7\)
Hence, required number of ways is \(6\times1+4\times9+1\times36=78\).
Teacher's Note: Case on number of bowlers (2, 3 or 4) and fill the rest from the 9 others.
Exam Note: 6 + 36 + 36 = 78.
Question 65. A person predicts the outcome of 20 cricket matches of his home team. Each match can result in a either win, loss or tie for the home team. Total number of ways in which he can make the predictions so that exactly 10 predictions are correct is equal to
(a) \({}^{20}C_{10}\times 2^{10}\)
(b) \({}^{20}C_{10}\times 3^{20}\)
(c) \({}^{20}C_{10}\times 3^{10}\)
(d) \({}^{20}C_{10}\times 2^{20}\)
Solution.
Answer: (a)Matches whose predictions are correct can be selected in \({}^{20}C_{10}\) ways. Now each wrong prediction can be made in 2 ways. Thus, the total number of ways is \({}^{20}C_{10}\times2^{10}\).
Teacher's Note: Choose the correct predictions, then each wrong one has two options.
Exam Note: 20C10 times 2^10.
Question 66. The number of different ways in which five 'alike dashes' and eight 'alike dots' can be arranged using only seven of these 'dashes' and 'dots' is
(a) 350
(b) 120
(c) 1287
(d) none of these
Solution.
Answer: (b)| Dashes | Dots | Arrangements |
|---|---|---|
| 5 | 2 | \({}^7C_2\) |
| 4 | 3 | \({}^7C_3\) |
| 3 | 4 | \({}^7C_4\) |
| 2 | 5 | \({}^7C_5\) |
| 1 | 6 | \({}^7C_6\) |
| 0 | 7 | \({}^7C_7\) |
The total number of ways is \({}^7C_2+{}^7C_3+{}^7C_4+{}^7C_5+{}^7C_6+{}^7C_7=2^7-8=120\).
Teacher's Note: Case on number of dashes (0 to 5) among the seven symbols.
Exam Note: Total is 2^7 minus 8.
Question 67. Let there be \(n\ge3\) circles in a plane. The value of \(n\) for which the number of radical centres is equal to the number of radical axes is (assume that all radical axes and radical centre exist and are different)
(a) 7
(b) 6
(c) 5
(d) none of these
Solution.
Answer: (c)For a radical centre, 3 circles are required. The total number of radical centres is \({}^nC_3\). The total number of radical axis is \({}^nC_2\). Now,
\({}^nC_2={}^nC_3\Rightarrow n=5\)
Teacher's Note: Radical centres need three circles, axes need two; equate nC3 and nC2.
Exam Note: nC2 = nC3 gives n = 5.
Question 68. The number of ways of choosing a committee of two women and three men from five women and six men, if Mr. A refuses to serve on the committee if Mr. B is a member and Mr. B can only serve, if Miss C is the member of the committee is
(a) 60
(b) 84
(c) 124
(d) none of these
Solution.
Answer: (c)(i) Miss C is taken
(A) B included \(\Rightarrow\) A excluded \(\Rightarrow{}^4C_1\times{}^4C_2=24\)
(B) B excluded \(\Rightarrow{}^4C_1\times{}^5C_3=40\)
(ii) Miss C is not taken
B does not come; \(\Rightarrow{}^4C_2\times{}^5C_3=60\)
Total \(=124\)
Alternative method:Case I: Mr. 'B' is present \(\Rightarrow\) 'A' is excluded and 'C' included. Hence, the number of ways is \({}^4C_2\,{}^4C_1=24\).
Case II: Mr. 'B' is absent \(\Rightarrow\) No constraint. Hence, the number of ways is \({}^5C_3\,{}^5C_2=100\).
Total \(=124\).
Teacher's Note: Case on whether B serves; if so, A is out and C is in.
Exam Note: 24 + 100 = 124.
Question 69. The last digit of \((1!+2!+\cdots+2005!)^{500}\) is
(a) 9
(b) 2
(c) 7
(d) 1
Solution.
Answer: (d)\(N=1!+2!+\cdots+2005!\)
\(=(1!+2!+3!+4!)+(5!+\cdots+2005!)\)
\(=33+\) an integer having 0 in its unit's place
= an integer having 3 in its unit's place
Hence, \(N^{500}\) is an integer having 1 in its unit's place.
Teacher's Note: Terms from 5! onward end in 0; the sum ends in 3 and 3^500 ends in 1.
Exam Note: Last digit of 3^500 is 1.
Question 70. \(ABCD\) is a convex quadrilateral and 3, 4, 5 and 6 points are marked on the sides \(AB,BC,CD\) and \(DA\), respectively. The number of triangles with vertices on different sides is
(a) 270
(b) 220
(c) 282
(d) 342
Solution.
Answer: (d)[Fig. 5.43: convex quadrilateral ABCD with 3 points marked on AB, 4 on BC, 5 on CD and 6 on DA.]
The number of triangles with vertices on sides AB, BC, CD is \({}^3C_1\times{}^4C_1\times{}^5C_1\).
Similarly, for other cases, the total number of triangles is
\({}^3C_1\times{}^4C_1\times{}^5C_1+{}^3C_1\times{}^4C_1\times{}^6C_1+{}^3C_1\times{}^5C_1\times{}^6C_1+{}^4C_1\times{}^5C_1\times{}^6C_1=342\)
Teacher's Note: Choose three of four sides, then one point on each.
Exam Note: 60 + 72 + 90 + 120 = 342.
Question 71. There are 10 points in a plane of which no three points are collinear and four points are concyclic. The number of different circles that can be drawn through at least three points of these points is
(a) 116
(b) 120
(c) 117
(d) none of these
Solution.
Answer: (c)Number of points required for the fixed circle is 3. So, first select any three points from the 10 points in \({}^{10}C_3\) ways.
In these ways, circle with four concyclic points is selected in \({}^4C_3\) ways. But it should be taken once, then total number of circles is \(({}^{10}C_3-{}^4C_3)+1=117\).
Teacher's Note: Count triples of points, then count the concyclic quadruple's circle only once.
Exam Note: 120 - 4 + 1 = 117.
Question 72. \(n\) lines are drawn in a plane such that no two of them are parallel and no three of them are concurrent. The number of different points at which these lines will cut is
(a) \(\sum_{k=1}^{n-1}k\)
(b) \(n(n-1)\)
(c) \(n^2\)
(d) none of these
Solution.
Answer: (a)The number of points of intersection is equal to the number of ways two lines are selected, which is given by
\({}^nC_2=\dfrac{n(n-1)}{2}=\sum_{k=1}^{n-1}k\)
Teacher's Note: Each pair of lines meets in exactly one point.
Exam Note: nC2 equals 1 + 2 + ... + (n-1).
Question 73. The number of triangles that can be formed with 10 points as vertices, \(n\) of them being collinear, is 110. Then \(n\) is
(a) 3
(b) 4
(c) 5
(d) 6
Solution.
Answer: (c)Out of 10 points let \(n\) points be collinear. Then the number of triangles is
\({}^{10}C_3-{}^nC_3=110\)
\(\Rightarrow\dfrac{10\times9\times8}{6}-\dfrac{n(n-1)(n-2)}{6}=110\)
\(\Rightarrow n(n-1)(n-2)=60\)
\(\Rightarrow n=5\)
Teacher's Note: Subtract triples of collinear points from 10C3.
Exam Note: n(n-1)(n-2) = 60 gives n = 5.
Question 74. There are three coplanar parallel lines. If any \(p\) points are taken on each of the lines, the maximum number of triangles with vertices on these points is
(a) \(3p^2(p-1)+1\)
(b) \(3p^2(p-1)\)
(c) \(p^2(4p-3)\)
(d) none of these
Solution.
Answer: (c)Select any three points from total \(3p\) points, which can be done \({}^{3p}C_3\) ways. But this also includes selection of three collinear points. Now three collinear points from each straight line can be selected in \({}^pC_3\) ways. Then the number of triangles is \({}^{3p}C_3-3\,{}^pC_3=p^2(4p-3)\).
Teacher's Note: Subtract collinear triples on the three lines from 3pC3.
Exam Note: 3pC3 - 3 pC3 simplifies to p^2(4p-3).
Question 75. The maximum number of points of intersection of five lines and four circles is
(a) 60
(b) 72
(c) 62
(d) none of these
Solution.
Answer: (c)Two circles intersect at two distinct points. Two straight lines intersect at one point. One circle and one straight line intersect at two distinct points. Then the total numbers of points of intersections are as follows:
| Number of ways of selection | Points of intersection |
|---|---|
| Two straight lines: \({}^5C_2\) | \({}^5C_2\times1=10\) |
| Two circles: \({}^4C_2\) | \({}^4C_2\times2=12\) |
| One line and one circle: \({}^5C_1\times{}^4C_1\) | \({}^5C_1\times{}^4C_1\times2=40\) |
| Total | 62 |
Teacher's Note: Count pairs of lines, circles, and line-circle pairs with maximal intersections.
Exam Note: 10 + 12 + 40 = 62.
Question 76. If \(m\) parallel lines in a plane are intersected by a family of \(n\) parallel lines, the number of parallelograms that can be formed is
(a) \(\dfrac14mn(m-1)(n-1)\)
(b) \(\dfrac12mn(m-1)(n-1)\)
(c) \(\dfrac14m^2n^2\)
(d) none of these
Solution.
Answer: (a)The number of selection of two parallel lines from \(m\) lines is \({}^mC_2\). The number of selection of two parallel lines from \(n\) lines is \({}^nC_2\). Hence, the number of parallelograms is
\({}^mC_2\times{}^nC_2=\dfrac14mn(m-1)(n-1)\)
Teacher's Note: Choose two lines from each family.
Exam Note: mC2 times nC2.
Question 77. The number of integral solutions of \(x+y+z=0\) with \(x\ge-5,\ y\ge-5,\ z\ge-5\) is
(a) 134
(b) 136
(c) 138
(d) 140
Solution.
Answer: (b)Let \(x=p-5,\ y=q-5\) and \(z=r-5\), where \(p,q,r\ge0\). Then the given equation reduces to
\(p+q+r=15\qquad(1)\)
Now, we have to find non-negative integral solution of Eq. (1). The total number of such solutions is \({}^{15+3-1}C_{3-1}={}^{17}C_2=136\).
Teacher's Note: Shift each variable by 5 and count non-negative solutions of p+q+r=15.
Exam Note: 17C2 = 136.
Question 78. The number of ways in which we can get a score of 11 by throwing three dice is
(a) 18
(b) 27
(c) 45
(d) 56
Solution.
Answer: (b)Dice is marked with numbers 1, 2, 3, 4, 5, 6. If the sum of dice in three throws is 11, then observations must be 1, 4, 6; 1, 5, 5; 2, 3, 6; 2, 4, 5; 3, 3, 5; 3, 4, 4.
We can get this observation in \(3!+3!/2!+3!+3!+3!/2!+3!/2!=27\) ways.
Teacher's Note: List unordered triples summing to 11 and count their arrangements.
Exam Note: Six triples give 27 ordered outcomes.
Question 79. In how many different ways can the first 12 natural numbers be divided into three different groups such that numbers in each group are in A.P.?
(a) 1
(b) 5
(c) 6
(d) 4
Solution.
Answer: (d)No group of four numbers from the first 12 natural numbers can have the common difference 4.
If one group including 1 is selected with the common difference 1, then the other two group can have the common difference 1 or 2.
If one group including 1 is selected with the common difference 2, then one of the other two groups can have the common difference 2 and the remaining group will have common difference 1.
If one group including 1 is selected with the common difference 3, then the other two groups can have the common difference 3.
Therefore, the required number of ways is \(2+1+1=4\).
Teacher's Note: Split 1..12 into three groups of four in AP by common difference.
Exam Note: Group containing 1 fixes the cases.
Question 80. Fifteen identical balls have to be put in five different boxes. Each box can contain any number of balls. The total number of ways of putting the balls into the boxes so that each box contains at least two balls is equal to
(a) \({}^9C_5\)
(b) \({}^{10}C_5\)
(c) \({}^6C_5\)
(d) \({}^{10}C_6\)
Solution.
Answer: (a)Let the balls put in the box are \(x_1,x_2,x_3,x_4\) and \(x_5\). We have,
\(x_1+x_2+x_3+x_4+x_5=15,\ x_i\ge2\)
\(\Rightarrow (x_1-2)+(x_2-2)+(x_3-2)+(x_4-2)+(x_5-2)=5\)
\(\Rightarrow y_1+y_2+y_3+y_4+y_5=5,\ y_i=x_i-2\ge0\)
The total number of ways is equal to number of non-negative integral solutions of the last equation, which is equal to \({}^{5+5-1}C_5={}^9C_5\).
Teacher's Note: Give each box two balls first, then distribute the remaining five freely.
Exam Note: Stars and bars gives 9C5.
Question 81. If \(n\) objects are arranged in a row, then the number of ways of selecting three of these objects so that no two of them are next to each other is
(a) \({}^{n-2}C_3\)
(b) \({}^{n-3}C_2\)
(c) \({}^{n-3}C_3\)
(d) none of these
Solution.
Answer: (a)Let \(x\) be the number of objects to the left of the first object chosen, \(y\) the number of objects between the first and the second, \(z\) the number of objects between the second and the third and \(u\) the number of objects to the right of the third objects. Then, \(x,u\ge0;\ y,z\ge1\) and \(x+y+z+u=n-3\). Let \(y_1=y-1\) and \(z_1=z-1\). Then, \(y_1\ge0,\ z_1\ge0\) such that \(x+y_1+z_1+u=n-5\).
The total number of non-negative integral solutions of this equation is \({}^{n-5+4-1}C_{4-1}={}^{n-2}C_3\).
Teacher's Note: Use gaps between chosen objects of at least one and count with stars and bars.
Exam Note: Equation x + y1 + z1 + u = n - 5.
Question 82. The number of ways to give 16 different things to three persons \(A,B,C\) so that \(B\) gets one more than \(A\) and \(C\) gets two more than \(B\), is
(a) \(\dfrac{16!}{4!\,5!\,7!}\)
(b) \(4!\,5!\,7!\)
(c) \(\dfrac{16!}{3!\,5!\,8!}\)
(d) none of these
Solution.
Answer: (a)Obviously, A, B and C get 4, 5 and 7 objects, respectively. Then, number of distribution ways is equal to number of division of ways, which is given by \(16!/(4!\,5!\,7!)\).
Teacher's Note: The conditions force shares 4, 5, 7; count ordered divisions.
Exam Note: Multinomial 16!/(4!5!7!).
Question 83. The number of ways in which we can distribute \(mn\) students equally among \(m\) sections is given by
(a) \(\dfrac{(mn)!}{n!}\)
(b) \(\dfrac{(mn)!}{(n!)^m}\)
(c) \(\dfrac{(mn)!}{m!\,n!}\)
(d) \((mn)^m\)
Solution.
Answer: (b)The number of ways is
\(\dfrac{(mn)!}{(n!)^m\,m!}\,m!=\dfrac{(mn)!}{(n!)^m}\)
Teacher's Note: Divide into m equal groups, then assign groups to the m sections.
Exam Note: Groups are labelled by sections.
Question 84. \(2m\) white counters and \(2n\) red counters are arranged in a straight line with \((m+n)\) counters on each side of a central mark. The number of ways of arranging the counters, so that the arrangements are symmetrical with respect to the central mark, is
(a) \({}^{m+n}C_m\)
(b) \({}^{2m+2n}C_{2m}\)
(c) \(\dfrac12\dfrac{(m+n)!}{m!\,n!}\)
(d) none of these
Solution.
Answer: (a)\(m+n\) counters on one side can be arranged in \(\dfrac{(m+n)!}{m!\,n!}\) ways.
For each arrangement on one side, corresponding arrangement on the other side is just one as arrangements are symmetrical. Hence, the total number of arrangements is
\(\dfrac{(m+n)!}{m!\,n!}={}^{m+n}C_m\)
Teacher's Note: Arrange one side freely; the other side mirrors it.
Exam Note: m white and n red on one side.
Question 85. A person buys eight packets of TIDE detergent. Each packet contains one coupon, which bears one of the letters of the word TIDE. If he shows all the letters of the word TIDE, he gets one free packet. If he gets exactly one free packet, then the number of different possible combinations of the coupons is
(a) \({}^7C_3\)
(b) \({}^8C_4\)
(c) \({}^8C_3\)
(d) \(4^4\)
Solution.
Answer: (a)Let \(x_1,x_2,x_3,x_4\) be the number of times T, I, D, E appears on the coupon. Then we must have \(x_1+x_2+x_3+x_4=8\), where \(1\le x_1,x_2,x_3,x_4\le8\) (as each letter must appear once). Then the required number of combinations of coupons is equivalent to number of positive integral solutions of the above equation, which is further equivalent to number of ways of 8 identical objects distributed among 4 persons when each gets at least one objects, and is given by \({}^{8-1}C_{4-1}={}^7C_3\).
Teacher's Note: Positive integer solutions of x1+x2+x3+x4=8.
Exam Note: Stars and bars gives 7C3.
Question 86. There are three copies each of four different books. The number of ways in which they can be arranged in a shelf is
(a) \(\dfrac{12!}{(3!)^4}\)
(b) \(\dfrac{12!}{(4!)^3}\)
(c) \(\dfrac{21!}{(3!)^4\,4!}\)
(d) \(\dfrac{12!}{(4!)^3\,3!}\)
Solution.
Answer: (a)Here, we have to divide 12 books into 4 sets of 3 books each. Therefore, the required number of ways is
\(\dfrac{12!}{(3!)^4\,4!}\times4!\)
Teacher's Note: Divide 12 books into four labelled sets of three.
Exam Note: 12!/(3!)^4 arrangements.
Question 87. The number of ways in which 12 books can be put in three shelves with four on each shelf is
(a) \(\dfrac{12!}{(4!)^3}\)
(b) \(\dfrac{12!}{(3!)(4!)^3}\)
(c) \(\dfrac{12!}{(3!)^3\,4!}\)
(d) none of these
Solution.
Answer: (a)Since the shelves which are to receive the books are different, therefore the required number of ways is \(12!/(4!)^3\).
Teacher's Note: Distinct shelves make the three groups of four labelled.
Exam Note: Multinomial 12!/(4!4!4!).
Question 88. The total number of ways in which \(2n\) persons can be divided into \(n\) couples is
(a) \(\dfrac{2n!}{n!\,n!}\)
(b) \(\dfrac{2n!}{(2!)^n}\)
(c) \(\dfrac{2n!}{n!\,(2!)^n}\)
(d) none of these
Solution.
Answer: (c)Here, we are dividing \(2n\) people in \(n\) groups of 2 each, and we are concerned with mere grouping. Hence, the required number of ways is \(\dfrac{(2n)!}{n!\,(2!)^n}\).
Teacher's Note: Unlabelled pairs: divide by n! for ordering of the pairs.
Exam Note: Option (c), reading 2n! as (2n)!.
Question 89. Let \(x_1,x_2,\ldots,x_k\) be the divisors of positive integer \('n'\) (including 1 and \(n\)). If \(x_1+x_2+\cdots+x_k=75\), then \(\sum_{i=1}^{k}1/x_i\) is equal to
(a) \(\dfrac{75}{n^2}\)
(b) \(\dfrac{75}{n}\)
(c) \(\dfrac{75}{k}\)
(d) none of these
Solution.
Answer: (b)\(\sum_{i=1}^{k}\dfrac1{x_i}=\dfrac1{x_1}+\dfrac1{x_2}+\cdots+\dfrac1{x_k}=\dfrac{\sum x_i}{n}=\dfrac{75}{n}\)
(as L.C.M. of \(x_1,x_2,\ldots,x_k\) is \(n\))
Teacher's Note: Divisors pair up as d and n/d, so reciprocals sum to (sum of divisors)/n.
Exam Note: Sum of reciprocals is 75/n.
Question 90. Let \(A=\{x_1,x_2,x_3,\ldots,x_7\}\), \(B=\{y_1,y_2,y_3\}\). The total number of functions \(f:A\to B\) that are onto and there are exactly three element \(x\) in \(A\) such that \(f(x)=y_2\) is equal to
(a) 490
(b) 510
(c) 630
(d) none of these
Solution.
Answer: (a)Three elements from set 'A' can be selected in \({}^7C_3\) ways. Their image has to be \(y_2\). Remaining 2 images can be assigned to remaining 4 pre-images in \(2^4\) ways. But the function is onto, hence the number of ways is \(2^4-2\). Then the total number of functions is \({}^7C_3\times14=490\).
Teacher's Note: Choose three elements for y2; map the other four onto y1, y3.
Exam Note: 35 times 14 = 490.
Question 91. The total number of ways in which \(n^2\) number of identical balls can be put in \(n\) numbered boxes (1, 2, 3, ..., \(n\)) such that \(i^{th}\) box contains at least \(i\) number of balls is
(a) \({}^{n^2}C_{n-1}\)
(b) \({}^{n^2-1}C_{n-1}\)
(c) \({}^{\frac{n^2+n-2}{2}}C_{n-1}\)
(d) none of these
Solution.
Answer: (c)If we put minimum number of balls required in each box, balls left are \(n(n-1)/2\) which can be put in \({}^{(n^2+n-2)/2}C_{n-1}\) ways without restriction.
Teacher's Note: Place i balls in box i first, then distribute the remaining freely.
Exam Note: Remaining balls n(n-1)/2.
Question 92. The total number of ways in which 15 identical blankets can be distributed among four persons so that each of them gets at least two blankets is equal to
(a) \({}^{10}C_3\)
(b) \({}^9C_3\)
(c) \({}^{11}C_3\)
(d) none of these
Solution.
Answer: (a)Let the blankets received by the persons are \(x_1,x_2,x_3\) and \(x_4\). We have,
\(x_1+x_2+x_3+x_4=15\ \text{and}\ x_i\ge2\)
\(\Rightarrow (x_1-2)+(x_2-2)+(x_3-2)+(x_4-2)=7\)
\(\Rightarrow y_1+y_2+y_3+y_4=7\ \text{(where}\ y_i=x_i-2\ge0)\)
The required number is equal to the number of non-negative integral solutions of this equation which is equal to \({}^{4+7-1}C_7\), i.e., \({}^{10}C_7={}^{10}C_3\).
Teacher's Note: Give each person two blankets, distribute the other seven freely.
Exam Note: Stars and bars gives 10C3.
Question 93. Number of ways in which 25 identical things be distributed among five persons if each gets odd number of things is
(a) \({}^{25}C_4\)
(b) \({}^{12}C_8\)
(c) \({}^{14}C_{10}\)
(d) \({}^{13}C_3\)
Solution.
Answer: (c)Let person \(P_i\) gets \(x_i\) number of things such that
\(x_1+x_2+x_3+x_4+x_5=25\)
Let \(x_i=2\lambda_i+1\), where \(\lambda_i\ge0\). Then,
\(2(\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5)+5=25\)
\(\Rightarrow\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5=10\)
We have to simply obtain the number of non-negative integral solutions of this equation, which is equal to \({}^{14}C_4\).
Teacher's Note: Write each share as 2*lambda + 1 and count non-negative solutions.
Exam Note: Sum of lambdas is 10.
Question 94. Number of ways in which Rs. 18 can be distributed amongst four persons such that nobody receives less than Rs. 3 is
(a) \(4^2\)
(b) \(2^4\)
(c) \(4!\)
(d) none of these
Solution.
Answer: (d)Suppose \(i^{th}\) person receives Rs \(x_i\); \(i=1,2,3,4\). Then, \(x_1+x_2+x_3+x_4=18\), where \(x_i\ge3\).
Let \(y_i=x_i-3,\ i=1,2,3,4\). Then,
\(y_1+y_2+y_3+y_4=6\)
The total number of ways is equal to number of solutions of the above equation, which is given by \({}^{6+4-1}C_{4-1}={}^9C_3=84\), which is none of the options.
Teacher's Note: Subtract Rs 3 from each share and count non-negative solutions.
Exam Note: Answer is 84, none of the options.
Question 95. In how many ways can 17 persons depart from railway station in 2 cars and 3 autos, given that 2 particular persons depart by same car (4 persons can sit in a car and 3 persons can sit in an auto)?
(a) \(\dfrac{15!}{2!\,4!\,(3!)^3}\)
(b) \(\dfrac{16!}{(2!)^2\,4!\,(3!)^3}\)
(c) \(\dfrac{17!}{2!\,4!\,(3!)^3}\)
(d) \(\dfrac{15!}{4!\,(3!)^3}\)
Solution.
Answer: (d)Make 1 group of 2 persons, 1 group of 4 persons and 3 groups of 3 persons among 15 persons (except 2 particular persons). Hence the number of ways by grouping method is
\(\dfrac{15!}{2!\,4!\,(3!)^3\,3!}\)
Now we add that 2 persons in the group of 2 persons and thus number of arrangements of these groups into cars and autos is
\(\dfrac{15!}{2!\,4!\,(3!)^3\,3!}\times2!\times3!=\dfrac{15!}{4!\,(3!)^3}\)
Teacher's Note: Group the other 15 around the fixed pair, then assign groups to cars and autos.
Exam Note: Cars and autos are distinct vehicles.
Question 96. The total number of ways of selecting six coins out of 20 one-rupee coins, 10 fifty-paise coins and 7 twenty-five paise coins is
(a) 28
(b) 56
(c) \({}^{37}C_6\)
(d) none of these
Solution.
Answer: (a)Since the total number of selections of \(r\) things from \(n\) things where each thing can be repeated as many times as one can is \({}^{n+r-1}C_r\). Therefore the required number is \({}^{3+6-1}C_6=28\).
Teacher's Note: Coins of one denomination are alike; count selections with repetition.
Exam Note: Counts of three types sum to six.
Question 97. Let \(f(n,k)\) denote the number of ways in which \(k\) identical balls can be coloured with \(n\) colours so that there is at least one ball of each colour. Then \(f(2n,n)\) must be equal to
(a) \({}^{2n}C_n\)
(b) \({}^{2n-1}C_{n+1}\)
(c) \({}^{2n-1}C_n\)
(d) none of these
Solution.
Answer: (c)\(f(2n,n)\) must be equal to number of positive integer solutions of \(x_1+x_2+\cdots+x_n=2n\), which must be equal to \({}^{2n-1}C_{n-1}={}^{2n-1}C_n\).
Teacher's Note: Positive integer solutions of x1+...+xn=2n by stars and bars.
Exam Note: Book reads f(2n, n) as 2n balls, n colours.
Question 98. The total number of ways in which three distinct numbers in \(A.P.\) can be selected from the set \(\{1,2,3,\ldots,24\}\) is equal to
(a) 66
(b) 132
(c) 198
(d) none of these
Solution.
Answer: (b)Let the numbers selected be \(x_1,x_2,x_3\). We must have
\(2x_2=x_1+x_3\)
\(\Rightarrow x_1+x_3=\text{even}\)
Therefore, \(x_1,x_3\) both are odd or both are even.
If \(x_1\) and \(x_3\) both are even, we can select them in \({}^{12}C_2\) ways. Similarly, if \(x_1\) and \(x_3\) both are odd, we can again select them in \({}^{12}C_2\) ways. Thus, the total number of ways is \(2\times{}^{12}C_2=132\).
Teacher's Note: End terms of the AP have equal parity; middle term is then determined.
Exam Note: Choose two of the same parity.
Question 99. The total number of ways of selecting two number from the set \(\{1,2,3,4,\ldots,3n\}\) so that their sum is divisible by 3 is equal to
(a) \(\dfrac{2n^2-n}{2}\)
(b) \(\dfrac{3n^2-n}{2}\)
(c) \(2n^2-n\)
(d) \(3n^2-n\)
Solution.
Answer: (b)Given number can be rearranged as
\(1,4,7,\ldots,3n-2\to3\lambda-2\)
\(2,5,8,\ldots,3n-1\to3\lambda-1\)
\(3,6,9,\ldots,3n\to3\lambda\)
That means, we must take two numbers from last row or one number each from first and second rows. Therefore, the total number of ways is
\({}^nC_2+{}^nC_1\times{}^nC_1=\dfrac{n(n-1)}{2}+n^2=\dfrac{3n^2-n}{2}\)
Teacher's Note: Sort numbers by remainder mod 3; pair remainders 0,0 or 1,2.
Exam Note: nC2 + n^2.
Question 100. Among the 8! permutations of the digits 1, 2, 3, ..., 8, consider those arrangements which have the following property. If we take any five consecutive positions, the product of the digits in these positions is divisible by 5. The number of such arrangements is equal to
(a) 7!
(b) 2.(7!)
(c) \({}^7C_4\)
(d) none of these
Solution.
Answer: (b)Let the arrangement be \(x_1x_2x_3x_4x_5x_6x_7x_8\), clearly 5 should occupy the position \(x_4\) or \(x_5\). Thus required number is \(2(7!)\).
Teacher's Note: The digit 5 must lie in every window of five consecutive positions.
Exam Note: Positions 4 and 5 lie in all windows.
Question 101. The total number of divisors of 480, that are of the form \(4n+2,\ n\ge0\), is equal to
(a) 2
(b) 3
(c) 4
(d) none of these
Solution.
Answer: (c)\(480=2^5\times3\times5\)
Now, \(4n+2=2(2n+1)\) = odd multiple of 2. Thus, the total number of such divisors is \(1\times2\times2=4\).
Teacher's Note: Divisors of form 4n+2 are 2 times an odd divisor.
Exam Note: Odd part 15 has 4 divisors.
Question 102. The total number of times, the digit '3' will be written, when the integers having less than 4 digits are listed is equal to
(a) 300
(b) 310
(c) 302
(d) 306
Solution.
Answer: (a)| Number of times 3 used | Pattern | Numbers of type | Number of times 3 appears |
|---|---|---|---|
| 1 | - - 3, - 3 -, 3 - - | \(3\times9\times9\) | \(1(3\times9\times9)\) |
| 2 | - 3 3, 3 3 -, 3 - 3 | \(3\times9\) | \(2(3\times9)\) |
| 3 | 333 | 1 | 3 |
| Total | 300 |
Any place other than 3 is filled by 9 ways as '0' can appear anywhere which gives all types of numbers like single digit, two digits, etc.
Alternative solution: A three-digit block from 000 to 999 means 1000 numbers, each number constituting 3 digits. Hence, the total numbers of digits which we have to write is 3000.Since the total number of digits is 10 (0 to 9) no digit is filled preferentially. Therefore, number of times we write 3 is \(3000/10=300\).
Teacher's Note: Count placements of the digit 3 in three-digit blocks 000 to 999.
Exam Note: Each digit occurs equally: 3000/10.
Question 103. Straight lines are drawn by joining \(m\) points on a straight line to \(n\) points on another line. Then excluding the given points, the number of point of intersections of the lines drawn is (no two lines drawn are parallel and no three lines are concurrent)
(a) \(\dfrac14mn(m-1)(n-1)\)
(b) \(\dfrac12mn(m-1)(n-1)\)
(c) \(\dfrac12m^2n^2\)
(d) \(\dfrac14m^2n^2\)
Solution.
Answer: (b)[Fig. 5.44: two parallel lines with points A1, A2 on the upper line and A3, A4 on the lower line; the lines A1A4 and A2A3 and the lines A1A3 and A2A4 are drawn, giving two different sets of straight lines.]
For intersection point we must have two straight lines, for which 2 points from each straight line must be selected. Now selection of these points can be done in \({}^mC_2\times{}^nC_2\) ways. Now as shown in diagram these four points can give two different sets of straight lines, which generate two distinct points of intersection.
Then total number of points of intersection is \({}^mC_2\times{}^nC_2\times2\).
Teacher's Note: Pick two points on each line; the four points give two crossings.
Exam Note: 2 times mC2 times nC2.
Question 104. In a polygon, no three diagonals are concurrent. If the total number of points of intersection of diagonals interior to the polygon is 70, then the number of diagonals of the polygon is
(a) 20
(b) 28
(c) 8
(d) none of these
Solution.
Answer: (a)[Fig. 5.45: a polygon with its diagonals.]
Let the number of sides be \(n\). A selection of four vertices of the polygon gives an interior intersection.
\(\therefore\ {}^nC_4=70\)
\(\Rightarrow n(n-1)(n-2)(n-3)=24\times70=8\times7\times6\times5\)
\(\Rightarrow n=8\)
So the number of diagonals is \(n(n-3)/2=20\).
Teacher's Note: Each four vertices give one interior intersection point; solve nC4 = 70.
Exam Note: n = 8 gives 20 diagonals.
Question 105. Two packs of 52 cards are shuffled together. The number of ways in which a man can be dealt 26 cards so that he does not get two cards of the same suit and same denomination is
(a) \({}^{52}C_{26}\cdot 2^{26}\)
(b) \({}^{104}C_{26}\)
(c) \(2\cdot{}^{52}C_{26}\)
(d) none of these
Solution.
Answer: (a)26 cards can be chosen out of 52 cards in \({}^{52}C_{26}\) ways. There are two ways in which each card can be dealt, because a card can be either from the first pack or from the second. Hence the total number of ways is \({}^{52}C_{26}\times2^{26}\).
Teacher's Note: Choose 26 distinct card types, then pick which pack each comes from.
Exam Note: 52C26 times 2^26.
Question 106. There are \((n+1)\) white and \((n+1)\) black balls each set numbered 1 to \(n+1\). The number of ways in which the balls can be arranged in a row so that the adjacent balls are of different colours is
(a) \((2n+2)!\)
(b) \((2n+2)!\times 2\)
(c) \((n+1)!\times 2\)
(d) \(2\{(n+1)!\}^2\)
Solution.
Answer: (d)Since the balls are to be arranged in a row so that the adjacent balls are of different colours, we can therefore begin with a white ball or a black ball. If we begin with a white ball, we find that \(n+1\) white balls numbered 1 to \(n+1\) can be arranged in a row in \((n+1)!\) ways. Now \(n+2\) places are created among \(n+1\) white balls which can be filled by \(n+1\) black balls in \((n+1)!\) ways.
So, the total number of arrangements in which adjacent balls are of different colours and first ball is a white ball is \((n+1)!\times(n+1)!=[(n+1)!]^2\). But we can begin with a black ball also. Hence, the required number of arrangements is \(2[(n+1)!]^2\).
Teacher's Note: Colours must alternate; choose the starting colour and arrange each colour.
Exam Note: Two starting colours times ((n+1)!)^2.
Question 107. The number of three-digit numbers of the form \(xyz\) such that \(x<y\) and \(z\le y\) is
(a) 276
(b) 285
(c) 240
(d) 244
Solution.
Answer: (a)If zero is included it will be at \(z\Rightarrow{}^9C_2\).
| Case | Condition | Ways |
|---|---|---|
| If zero is excluded | \(x,y,z\) all different | \({}^9C_3\times2!\) |
\(x=z| \({}^9C_2\) | | |
\(x| \({}^9C_2\) | |
The total number of ways is 276.
Alternative method: \(y\) can be from 2 to 9; so total number of ways is\(\sum_{r=2}^{9}(r^2-1)=276\)
Teacher's Note: Case on whether zero is used, or sum over the middle digit y.
Exam Note: Sum of (y^2 - 1) for y = 2 to 9.
Question 108. \(A\) is a set containing \('n'\) different elements. A subset \(P\) of \(A\) is chosen. The set \(A\) is reconstructed by replacing the elements of \(P\). A subset \(Q\) of \(A\) is again chosen. The number of ways of choosing \(P\) and \(Q\) so that \(P\cap Q\) contains exactly two elements is
(a) \({}^nC_3\times 2^n\)
(b) \({}^nC_2\times 3^{n-2}\)
(c) \(3^{n-2}\)
(d) none of these
Solution.
Answer: (b)The two common elements can be selected in \({}^nC_2\) ways. Remaining \(n-2\) elements, each can be chosen in three ways, i.e., \(a\in P\) and \(a\notin Q\) or \(a\in Q\) and \(a\notin P\) or \(a\) is neither in \(P\) nor in \(Q\). Therefore, the total number of ways is \({}^nC_2\times3^{n-2}\).
Teacher's Note: Choose the two common elements; every other element has three states.
Exam Note: nC2 times 3^(n-2).
Question 109. Messages are conveyed by arranging four white, one blue and three red flags on a pole. Flags of the same colour are alike. If a message is transmitted by the order in which the colours are arranged, the total number of messages that can be transmitted if exactly six flags are used is
(a) 45
(b) 65
(c) 125
(d) 185
Solution.
Answer: (d)We will consider the following cases
| Case | Flags | No. of signals |
|---|---|---|
| 4 alike and 2 others alike | 4 white, 2 red | \(\frac{6!}{4!\,2!}=15\) |
| 4 alike and 2 others different | 4 white, 1 red and 1 blue | \(\frac{6!}{4!}=30\) |
| 3 alike and 3 others alike | 3 white, 3 red | \(\frac{6!}{3!\,3!}=20\) |
| 3 alike and 2 other alike and 1 different | 3 white, 1 blue, 2 red or 3 red, 1 blue, 2 white | \({}^2C_1\times\frac{6!}{3!\,2!}=120\) |
| Total | 185 |
Teacher's Note: Case on repetition pattern of the six flags chosen from 4 white, 1 blue, 3 red.
Exam Note: 15 + 30 + 20 + 120 = 185.
Question 110. 20 persons are sitting in a particular arrangement around a circular table. Three persons are to be selected for leaders. The number of ways of selection of three persons such that no two were sitting adjacent to each other is
(a) 600
(b) 900
(c) 800
(d) none of these
Solution.
Answer: (c)The total number of ways of selection without restriction is \({}^{20}C_3\). The number of ways of selection when two are adjacent is \(20\times{}^{16}C_1\). The number of ways of selection when all the three are adjacent is 20. The required number of ways is
\({}^{20}C_3-20\times16-20=\dfrac{20\times19\times18}{6}-20\times16-20\)
\(=20[57-16-1]\)
\(=20\times40=800\)
Teacher's Note: Subtract selections with two or three adjacent persons from 20C3.
Exam Note: 1140 - 320 - 20 = 800.
Question 111. A seven-digit number without repetition and divisible by 9 is to be formed by using seven digits out of 1, 2, 3, 4, 5, 6, 7, 8, 9. The number of ways in which this can be done is
(a) 9!
(b) 2(7!)
(c) 4(7!)
(d) none of these
Solution.
Answer: (c)Sum of 7 digits is a multiple of 9. Sum of numbers 1, 2, 3, 4, 5, 6, 7, 8, 9 is 45; so two left digits should also have sum of 9. The pairs of left numbers are (1, 8), (2, 7), (3, 6), (4, 5). With each pair left number of 7-digit number is \(7!\). So with all 4 pairs, total number is \(4\times7!\).
Teacher's Note: Omit two digits summing to 9, then arrange the remaining seven.
Exam Note: Four omitted pairs times 7!.
Question 112. \(n\) is selected from the set \(\{1,2,3,\ldots,100\}\) and the number \(2^n+3^n+5^n\) is formed. Total number of ways of selecting \(n\) so that the formed number is divisible by 4 is equal to
(a) 50
(b) 49
(c) 48
(d) none of these
Solution.
Answer: (b)If \(n\) is odd,
\(3^n=4\lambda_1-1,\ 5^n=4\lambda_2+1\)
\(\Rightarrow 2^n+3^n+5^n\) is divisible by 4 if \(n\ge2\)
Thus, \(n=3,5,7,9,\ldots,99\), i.e., \(n\) can take 49 different values. If \(n\) is even, \(3^n=4\lambda_1+1,\ 5^n=4\lambda_2+1\)
\(\Rightarrow 2^n+3^n+5^n\) is not divisible by 4
as \(2^n+3^n+5^n\) will be in the form of \(4\lambda+2\).
Thus, the total number of ways of selecting \(n\) is equal to 49.
Teacher's Note: Odd n gives 3^n + 5^n divisible by 4, so n odd and at least 3.
Exam Note: n = 3, 5, ..., 99.
Question 113. The number of distinct natural numbers up to a maximum of four digits and divisible by 5, which can be formed with the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 each digit not occurring more than once in each number is
(a) 1246
(b) 952
(c) 1106
(d) none of these
Solution.
Answer: (c)| Number of digits | Numbers ending with 0 | Numbers ending with 5 | Total |
|---|---|---|---|
| x | 0 | 1 | 1 |
| x x | 8 | 9 | 17 |
| x x x | \(9\cdot8=72\) | \(8\cdot8=64\) | 136 |
| x x x x | \(9\cdot8\cdot7=504\) | \(8\cdot8\cdot7=448\) | 952 |
| Total | 1106 |
Teacher's Note: Count by number of digits, ending in 0 or 5 with nonzero lead.
Exam Note: 1 + 17 + 136 + 952 = 1106.
Question 114. A man has three friends. The number of ways he can invite one friend everyday for dinner on six successive nights so that no friend is invited more than three times is
(a) 640
(b) 320
(c) 420
(d) 510
Solution.
Answer: (d)Let \(x,y,z\) be the friends and \(a,b,c\) denote the case when \(x\) is invited \(a\) times, \(y\) is invited \(b\) times and \(z\) is invited \(c\) times. Now, we have the following possibilities:
\((a,b,c)=(1,2,3)\ \text{or}\ (3,3,0)\ \text{or}\ (2,2,2)\)
[grouping of 6 days of week]
Hence, the total number of ways is
\(\dfrac{6!}{1!\,2!\,3!}\,3!+\dfrac{6!}{3!\,3!\,0!}\,3!+\dfrac{6!}{(2!\,2!\,2!)\,3!}\,3!\)
\(=360+60+90=510\)
Teacher's Note: Split six nights as (1,2,3), (3,3,0) or (2,2,2) among the three friends.
Exam Note: 360 + 60 + 90 = 510.
Question 115. There are four letters and four directed envelopes. The number of ways in which all the letters can be put in the wrong envelope is
(a) 8
(b) 9
(c) 16
(d) none of these
Solution.
Answer: (b)There is concept of derangement. The required number is
\(4!\left[1-\dfrac1{1!}+\dfrac1{2!}-\dfrac1{3!}+\dfrac1{4!}\right]=9\)
Teacher's Note: All letters in wrong envelopes is the derangement D4.
Exam Note: D4 = 9.
Question 116. A bag contains four one-rupee coins, two twenty-five paisa coins and five ten-paisa coins. In how many ways can an amount, not less than Re 1 be taken out from the bag? (Consider coins of the same denominations to be identical.)
(a) 71
(b) 72
(c) 73
(d) 80
Solution.
Answer: (c)When at least one one-rupee coin is selected we can select any number of twenty five coins and ten paisa coins. Then number of ways of such selection is \(4(2+1)(5+1)=72\) as we can select zero or more twenty-five paisa and ten paisa coins to ensure that amount selected is Re. 1 or more.
But when none of one-rupee coins is selected we have to select all twenty-five paisa coins and ten paisa coins to ensure sum of Re. 1, which can be done only in one way. Then the total number of ways is 73.
Teacher's Note: Case on whether a rupee coin is taken; otherwise all small coins are needed.
Exam Note: 72 + 1 = 73.
Question 117. In a certain test, there are \(n\) questions. In the test \(2^{n-i}\) students gave wrong answers to at least \(i\) questions, where \(i=1,2,\ldots,n\). If the total number of wrong answers given is 2047, then \(n\) is equal to
(a) 10
(b) 11
(c) 12
(d) 13
Solution.
Answer: (b)Since the number of students giving wrong answers to at least \(i\) questions \((i=1,2,\ldots,n)\) is \(2^{n-i}\).
The number of students answering exactly \(i\ (1\le i\le n-1)\) questions wrongly = {the number of students answering at least \(i\) questions wrongly, \(i=1,2,\ldots\)} - {the number of students answering at least \((i+1)\) questions wrongly \((2\le i+1\le n)\)} \(=2^{n-i}-2^{n-(i+1)}\ (1\le i\le n-1)\).
Now, the number of students answering all the \(n\) questions wrongly is \(2^{n-n}=2^0\). Thus, the total number of wrong answers is
\(1(2^{n-1}-2^{n-2})+2(2^{n-2}-2^{n-3})+3(2^{n-3}-2^{n-4})+\cdots+(n-1)(2^1-2^0)+n(2^0)\)
\(=2^{n-1}+2^{n-2}+2^{n-3}+\cdots+2^0=2^n-1\) (\(\because\) it is a G.P.)
Therefore, as given,
\(2^n-1=2047\Rightarrow2^n=2048=2^{11}\Rightarrow n=11\)
Teacher's Note: Total wrong answers equals the sum of counts of students with at least i wrong answers.
Exam Note: Geometric sum 2^n - 1 = 2047.
Question 118. Rajdhani Express going from Bombay to Delhi stops at five intermediate stations, 10 passengers enter the train during the journey with 10 different ticket of two classes. The number of different sets of tickets they may have is
(a) \({}^{15}C_{10}\)
(b) \({}^{20}C_{10}\)
(c) \({}^{30}C_{10}\)
(d) none of these
Solution.
Answer: (c)For a particular class the total number of different tickets from first intermediate station is 5. Similarly, number of different tickets from second intermediate station is 4. So the total number of different tickets is \(5+4+3+2+1=15\). And same number of tickets for another class is equal to total number of different tickets, which is equal to 30 and number of selection is \({}^{30}C_{10}\).
Teacher's Note: Count distinct tickets per class (15) and double for two classes; choose 10 tickets.
Exam Note: Thirty distinct tickets, choose ten.
Question 119. A train timetable must be compiled for various days of the week so that two trains twice a day depart for three days, one train daily for two days and three trains once a day for two days. How many different timetables can be compiled?
(a) 140
(b) 210
(c) 133
(d) 72
Solution.
Answer: (b)The number of trains a day (the digits 1, 2, 3) are three groups of like elements from which a sample must be formed. In the time-table for a week, the number 1 is repeated twice, the number 2 is repeated 3 times and the number 3 is repeated twice.
The number of different time-tables is given by
\(p(2,3,2)=\dfrac{7!}{2!\,3!\,2!}=210\)
Teacher's Note: Arrange the 7 days by number of trains per day: counts 2, 3, 2 of values 1, 2, 3.
Exam Note: Multinomial 7!/(2!3!2!).
Question 120. The total number of positive integral solution of \(15<x_1+x_2+x_3\le 20\) is equal to
(a) 685
(b) 785
(c) 1125
(d) none of these
Solution.
Answer: (a)\(15<x_1+x_2+x_3\le20\)
\(\Rightarrow x_1+x_2+x_3=16+r,\ r=0,1,2,3,4\)
Now, the number of positive integral solution of \(x_1+x_2+x_3=16+r\) is \({}^{13+r+3-1}C_{13+r}\), i.e., \({}^{15+r}C_{13+r}={}^{15+r}C_2\).
Thus, the total number of solutions is
\(\sum_{r=0}^{4}{}^{15+r}C_2={}^{15}C_2+{}^{16}C_2+{}^{17}C_2+{}^{18}C_2+{}^{19}C_2\)
\(=\dfrac12(15\times14+16\times15+17\times16+18\times17+19\times18)\)
\(=685\)
Teacher's Note: Sum positive-solution counts for totals 16 to 20.
Exam Note: C(15,2) + ... + C(19,2) = 685.
Free study material for Mathematics
Step-by-Step Cengage G Tewani Solutions for Class 11 Math
Access Class 11 Mathematics Solutions
Explore reliable mathematical solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Objective Type tailored for Class 11 learners. Utilizing these complete exercise answers ensures your preparation aligns exactly with standard academic requirements.
Concept-Driven Math Answers
Beyond providing the final numerical answer, these guides break down the underlying mathematical principles. Cross-referencing completed work with these structured explanations helps eliminate calculation errors and reinforces conceptual clarity.
Next Steps in Your Mathematics Revision
Maximize your academic readiness by pairing these solutions with our official sample papers and interactive practice tests. All supplementary study materials for the 2026 session are available across our platform free of charge.
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.