Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Concept Application Exercises

Step-by-Step Solutions for 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.

Download Chapter 05 Permutation Combination Textbook Solutions PDF

Navigate directly to the solved Mathematics textbook exercises using the digital viewer below. Each solution includes detailed step-by-step explanations, allowing students to instantly cross-check their work and identify areas requiring further revision.

Concept Application Exercises

Question 5.1 (1). Four buses run between Bhopal and Gwalior. If a man goes from Gwalior to Bhopal by a bus and comes back to Gwalior by another bus, find the total possible ways.

Solution.

Answer: 12

The man can go in 4 ways; the return bus must be different, so there are 3 choices. Total \(4\times3=12\).

Teacher's Note: Multiply choices for going by bus and returning by a different bus.

Exam Note: Return bus differs, so 3 choices.

Question 5.1 (2). A gentleman wants to invite six friends. In how many ways can he send invitation cards to them, if he has three servants to carry the cards.

Solution.

Answer: 729

Each of the six cards can be given to any of the three servants. Total \(3^6=729\).

Teacher's Note: Each card independently has 3 choices of servant.

Exam Note: Six cards, three choices each.

Question 5.1 (3). Find the total number of ways of answering five objective type questions, each question having four choices.

Solution.

Answer: 1024

Each of five questions can be answered in 4 ways. Total \(4^5=1024\).

Teacher's Note: Multiply 4 choices over five questions.

Exam Note: Independent choices: 4^5.

Question 5.1 (4). In how many ways first and second rank in Mathematics, first and second rank in Physics, first rank in Chemistry and first rank in English be given away to a class of 30 students.

Solution.

Answer: 681210000

Mathematics ranks: \(30\times29\) ways; Physics ranks: \(30\times29\) ways (a student may win in more than one subject); Chemistry first rank: 30 ways; English first rank: 30 ways.

Total \((30\times29)^2\times30^2=681210000\).

Teacher's Note: Ranks in different subjects are independent; within a subject the two ranks go to different students.

Exam Note: (30x29)^2 x 30^2.

Question 5.1 (5). Five persons entered the lift cabin on the ground floor of an 8-floor building. If, each of them can leave the cabin independently at any floor beginning with the first; find the total number of ways in which each of the five persons can leave the cabin: (i) at any one of the 7 floors and (ii) at different floors.

Solution.

Answer: (i) 16807, (ii) 2520

(i) Each person can leave at any of the 7 floors: \(7^5=16807\).

(ii) Different floors: \({}^7P_5=7\times6\times5\times4\times3=2520\).

Teacher's Note: Each person chooses a floor; for distinct floors count injective choices.

Exam Note: 7^5 and 7P5.

Question 5.1 (6). If \(p,q\in\{1,2,3,4\}\), then find the number of equations of the form \(px^2+qx+1=0\) having real roots.

Solution.

Answer: 7

Real roots need \(q^2-4p\ge0\), i.e., \(q^2\ge4p\).

For \(q=1\): none. \(q=2\): \(p=1\) (1). \(q=3\): \(p=1,2\) (2). \(q=4\): \(p=1,2,3,4\) (4).

Total \(1+2+4=7\).

Teacher's Note: Use the discriminant q^2 >= 4p and count pairs.

Exam Note: Discriminant condition by q value.

Question 5.1 (7). Find the number of non-zero determinant of order 2 with elements 0 or 1 only.

Solution.

Answer: 6

The determinant \(ad-bc\) is non-zero when exactly one of \(ad,bc\) equals 1 and the other equals 0. \(ad=1\) (a = d = 1) and \(bc=0\) in 3 ways; similarly \(bc=1\) and \(ad=0\) in 3 ways. Total \(3+3=6\).

Teacher's Note: Determinant ad - bc is non-zero only if exactly one product is 1.

Exam Note: 3 + 3 = 6.

Question 5.1 (8). Find the number ordered pairs \((x,y)\) if \(x,y\in\{0,1,2,3,\ldots,10\}\) and if \(|x-y|>5\).

Solution.

Answer: 30

For \(|x-y|=d\) with \(d=6,\ldots,10\) there are \(2(11-d)\) ordered pairs. Total \(10+8+6+4+2=30\).

Teacher's Note: Count ordered pairs by difference d = 6 to 10.

Exam Note: 2(11 - d) pairs for each d.

Question 5.1 (9). (a) If \(a,b\in\{1,2,3,4,5,6\}\), find the number of ways \(a\) and \(b\) can be selected if

\(\displaystyle\lim_{x\to 0}\left(\dfrac{a^x+b^x}{2}\right)^{2/x}=6\)

(b) If \(a,b,c\in\{1,2,3,4,5,6\}\), find the number of ways \(a,b,c\) can be selected if \(f(x)=x^3+ax^2+bx+c\) is an increasing function.

Solution.

Answer: (a) 4, (b) 96

(a) The limit equals \(ab\) (as \(\lim(\frac{a^x+b^x}{2})^{2/x}=ab\)). So \(ab=6\): \((a,b)=(1,6),(2,3),(3,2),(6,1)\), i.e., 4 ways.

(b) \(f'(x)=3x^2+2ax+b\ge0\) for all \(x\) needs \(4a^2-12b\le0\), i.e., \(a^2\le3b\). Pairs \((a,b)\): \(a=1:6,\ a=2:5,\ a=3:4,\ a=4:1\), total 16. \(c\) is free in 6 ways: \(16\times6=96\).

Teacher's Note: Evaluate the limit to get ab = 6; increasing cubic needs non-positive discriminant of f'.

Exam Note: a^2 <= 3b gives 16 pairs.

Question 5.1 (10). Find the number of ways in which two small squares can be selected on the normal chessboard if they are not in same row or same column.

Solution.

Answer: 1568

First square: 64 ways; second square not in its row or column: \(7\times7=49\) ways. Order does not matter: \(\dfrac{64\times49}{2}=1568\).

Teacher's Note: Pick a square, then one in a different row and column; halve for unordered selection.

Exam Note: 64 x 49 / 2.

Question 5.2 (1). Prove that \((2n)!/n!=\{1\times 3\times 5\cdots(2n-1)\}\,2^n\).

Solution.

Answer: proved

\(\dfrac{(2n)!}{n!}=\dfrac{[1\cdot3\cdot5\cdots(2n-1)]\,[2\cdot4\cdots2n]}{n!}=\dfrac{[1\cdot3\cdots(2n-1)]\,2^n\,n!}{n!}=[1\cdot3\cdot5\cdots(2n-1)]\,2^n\)

Teacher's Note: Split (2n)! into odd and even factors; the even factors give 2^n n!.

Exam Note: Even factors are 2^n times n!.

Question 5.2 (2). Show that \(1!+2!+3!+\cdots+n!\) cannot be a perfect square for any \(n\in N,\ n\ge 4\).

Solution.

Answer: proved

\(1!+2!+3!+4!=33\). For \(n\ge5\), \(5!,6!,\ldots\) are multiples of 10, so the sum ends in 3.

A perfect square never ends in 3 (squares end in 0, 1, 4, 5, 6, 9), so the sum is not a perfect square for \(n\ge4\).

Teacher's Note: Last digit of the sum is 3 for n at least 4, and no square ends in 3.

Exam Note: Squares cannot end in 3.

Question 5.2 (3). Prove that \((n!+1)\) is not divisible by any natural number between 2 and \(n\).

Solution.

Answer: proved

Let \(2\le k\le n\). Then \(k\mid n!\), so \(n!+1\equiv1\pmod k\), which is not 0. Hence no natural number between 2 and \(n\) divides \(n!+1\).

Teacher's Note: Every k up to n divides n!, leaving remainder 1 on n! + 1.

Exam Note: n! + 1 leaves remainder 1 modulo k.

Question 5.2 (4). Find the remainder when \(1!+2!+3!+4!+\cdots+n!\) is divided by 15, if \(n\ge 5\).

Solution.

Answer: 3

\(1!+2!+3!+4!=33\). For \(n\ge5\), \(5!=120\) and all later factorials are divisible by 15. So the remainder is that of 33 on division by 15, i.e., \(33=2\times15+3\).

Teacher's Note: Factorials from 5! onward are divisible by 15, so only 33 matters.

Exam Note: 33 mod 15 = 3.

Question 5.2 (5). Find the exponent of 80 in 200!

Solution.

Answer: 49

\(80=2^4\times5\). Exponent of 5 in 200! \(=40+8+1=49\). Exponent of 2 in 200! \(=100+50+25+12+6+3+1=197\), which gives \(\lfloor197/4\rfloor=49\) factors of \(2^4\).

Exponent of 80 is \(\min(49,49)=49\).

Teacher's Note: Factor 80 = 2^4 x 5 and use Legendre's formula for 2 and 5 in 200!.

Exam Note: Both limits give 49.

Question 5.3 (1). Prove that \({}^nP_r={}^{n-1}P_r+r\,{}^{n-1}P_{r-1}\).

Solution.

Answer: proved

\({}^{n-1}P_r+r\,{}^{n-1}P_{r-1}=\dfrac{(n-1)!}{(n-1-r)!}+r\dfrac{(n-1)!}{(n-r)!}=\dfrac{(n-1)!}{(n-r)!}\left[(n-r)+r\right]=\dfrac{n!}{(n-r)!}={}^nP_r\)

Teacher's Note: Write both terms over (n-r)! and add.

Exam Note: (n-r) + r = n.

Question 5.3 (2). If \({}^nP_5=20\,{}^nP_3\), find the value of \(n\).

Solution.

Answer: n = 8

\({}^nP_5=20\,{}^nP_3\Rightarrow n(n-1)(n-2)(n-3)(n-4)=20\,n(n-1)(n-2)\)\(\Rightarrow(n-3)(n-4)=20\Rightarrow n^2-7n-8=0\Rightarrow n=8\) (as \(n\ge5\)).

Teacher's Note: Cancel common factors n(n-1)(n-2) and solve a quadratic.

Exam Note: (n-3)(n-4) = 20.

Question 5.3 (3). a. If \({}^{22}P_{r+1}:{}^{20}P_{r+2}=11:52\), find \(r\).

b. If \({}^{56}P_{r+6}:{}^{54}P_{r+3}=30800:1\), find \(r\).

Solution.

Answer: (a) r = 7, (b) r = 41

(a) \(\dfrac{{}^{22}P_{r+1}}{{}^{20}P_{r+2}}=\dfrac{22!/(21-r)!}{20!/(18-r)!}=\dfrac{22\cdot21}{(21-r)(20-r)(19-r)}=\dfrac{11}{52}\), so \((21-r)(20-r)(19-r)=42\times52=2184=14\cdot13\cdot12\), giving \(21-r=14\), i.e., \(r=7\).

(b) \(\dfrac{{}^{56}P_{r+6}}{{}^{54}P_{r+3}}=\dfrac{56!/(50-r)!}{54!/(51-r)!}=56\cdot55\cdot(51-r)=30800\)\(\Rightarrow51-r=10\Rightarrow r=41\).

Teacher's Note: Expand each permutation as a ratio of factorials and cancel.

Exam Note: Check by substitution.

Question 5.3 (4). How many numbers can be formed from the digits 1, 2, 3, 4 when repetition is not allowed?

Solution.

Answer: 64

Numbers of 1, 2, 3 and 4 digits without repetition: \({}^4P_1+{}^4P_2+{}^4P_3+{}^4P_4=4+12+24+24=64\).

Teacher's Note: Add numbers of one-, two-, three- and four-digit numbers.

Exam Note: 4 + 12 + 24 + 24.

Question 5.3 (5). Find the 3-digit odd numbers that can be formed by using the digits 1, 2, 3, 4, 5, 6 when the repetition is allowed.

Solution.

Answer: 108

Units place must be odd: 3 ways (1, 3, 5); tens and hundreds places: 6 ways each. Total \(6\times6\times3=108\).

Teacher's Note: Fill the restricted units place first, then the other two places freely.

Exam Note: 3 x 6 x 6.

Question 5.3 (6). If the 11 letters \(A,B,\ldots,K\) denote an arbitrary permutation of the integers \((1,2,\ldots,11)\), then \((A-1)(B-2)(C-3)\cdots(K-11)\) will be

a. necessarily zero

b. always odd

c. always even

d. none of these

Solution.

Answer: (c) always even

Among 1 to 11 there are 6 odd and 5 even integers. A factor \((A-1)\) etc. is odd only if the letter's value and its index have different parity. The six odd indices would need even values, but only 5 even values exist, so at least one factor is even.

Hence the product is always even.

Teacher's Note: Pigeonhole on parity: six odd indices but only five even values.

Exam Note: At least one factor is even.

Question 5.3 (7). In how many ways can 5 boys and 3 girls sit in a row so that no two girls are together?

Solution.

Answer: 14400

Seat the 5 boys in \(5!\) ways, creating 6 gaps. Place the 3 girls in different gaps in \({}^6P_3\) ways. Total \(5!\times{}^6P_3=120\times120=14400\).

Teacher's Note: Seat the boys first, then put each girl in a separate gap.

Exam Note: 5! times 6P3.

Question 5.3 (8). In how many ways can 5 girls and 5 boys be arranged in row if all boys are together.

Solution.

Answer: 86400

Treat the 5 boys as one block; with 5 girls there are 6 units: \(6!\) ways. Boys can be arranged inside the block in \(5!\) ways. Total \(6!\times5!=86400\).

Teacher's Note: Group the boys as one block and arrange the block with the girls.

Exam Note: 6! times 5!.

Question 5.3 (9). Find the number of words that can be made out of the letters of the word 'MOBILE' when consonants always occupy odd places.

Solution.

Answer: 36

MOBILE has 3 consonants (M, B, L) and 3 vowels (O, I, E). The odd places 1, 3, 5 are filled by consonants in \(3!\) ways, and the vowels fill places 2, 4, 6 in \(3!\) ways. Total \(3!\times3!=36\).

Teacher's Note: Consonants take the three odd places, vowels the even places.

Exam Note: 3! times 3!.

Question 5.3 (10). Find the number of positive integers, which can be formed by using any number of digits from 0, 1, 2, 3, 4, 5 but using each digit not more than once in each number. How many of these integers are greater than 3000? What happened when repetition is allowed?

Solution.

Answer: 1630; 1380 exceed 3000; with repetition 46655

Without repetition: 1-digit \(5\), 2-digit \(5\times5=25\), 3-digit \(5\times5\times4=100\), 4-digit \(5\times5\times4\times3=300\), 5-digit \(5\times5\times4\times3\times2=600\), 6-digit \(600\). Total \(5+25+100+300+600+600=1630\).

Greater than 3000: 4-digit numbers starting with 3, 4 or 5: \(3\times5\times4\times3=180\); 5-digit: 600; 6-digit: 600. Total \(180+600+600=1380\).

With repetition allowed, the positive integers number \(6^6-1=46655\), of which \(46655-648=46007\) exceed 3000.

Teacher's Note: Count by number of digits with a nonzero lead digit; sum the cases above 3000.

Exam Note: Without repetition 1630, and 1380 exceed 3000.

Question 5.4 (1). If \({}^{n+2}C_8:{}^{n-2}P_4=57:16\), find \(n\).

Solution.

Answer: n = 19

\(\dfrac{{}^{n+2}C_8}{{}^{n-2}P_4}=\dfrac{57}{16}\)\(\Rightarrow\dfrac{(n+2)!}{8!\,(n-6)!}\cdot\dfrac{(n-6)!}{(n-2)!}=\dfrac{57}{16}\)\(\Rightarrow\dfrac{(n+2)(n+1)n(n-1)}{40320}=\dfrac{57}{16}\)\(\Rightarrow(n+2)(n+1)n(n-1)=143640=21\cdot20\cdot19\cdot18\)\(\Rightarrow n=19\).

Teacher's Note: Write nCr and nPr as factorial ratios, cancel, and match four consecutive integers.

Exam Note: Product equals 21 x 20 x 19 x 18.

Question 5.4 (2). Find the ratio of \({}^{20}C_r\) and \({}^{25}C_r\) when each of them has the greatest possible value.

Solution.

Answer: 143 : 4025

Greatest \({}^{20}C_r\) is \({}^{20}C_{10}=184756\); greatest \({}^{25}C_r\) is \({}^{25}C_{12}=5200300\).

Ratio \({}^{20}C_{10}:{}^{25}C_{12}=184756:5200300=143:4025\).

Teacher's Note: nCr is greatest at r = n/2 (or the nearest integers).

Exam Note: 20C10 : 25C12 reduces to 143 : 4025.

Question 5.4 (3). If there are 12 persons in a party, and if each two of them shake hands with each other, how many handshakes happen in the party?

Solution.

Answer: 66

Each handshake corresponds to a pair of persons: \({}^{12}C_2=66\).

Teacher's Note: A handshake is an unordered pair of persons.

Exam Note: 12C2 = 66.

Question 5.4 (4). On the occasion if Deepawali festival, each student in a class sends greeting cards to others. If there are 20 students in the class, find the total number of greeting cards exchanged by the students?

Solution.

Answer: 380

Each ordered pair (sender, receiver) gives one card: \(20\times19=380\).

Teacher's Note: Each student sends one card to each of the other 19 students.

Exam Note: 20 x 19.

Question 5.4 (5). Out of 15 balls, of which some are white and the rest are black, how many should be white so that the number of ways in which the balls can be arranged in a row may be the greatest possible? It is assumed that the balls of same colour are alike.

Solution.

Answer: 7 or 8 white balls

With \(w\) white balls, the arrangements number \({}^{15}C_w\), which is greatest when \(w=7\) or \(w=8\).

Teacher's Note: Arrangements of w white among 15 positions is 15Cw.

Exam Note: 15Cw is largest at w = 7 or 8.

Question 5.4 (6). A committee of 6 is chosen from 10 men and 7 women so as to contain at least 3 men and two women. In how many ways can this be done if two particular women refuse to serve on the same committee?

a. 7850

b. 8700

c. 7800

d. none of these

Solution.

Answer: (c) 7800

Possible committees: 3 men + 3 women, or 4 men + 2 women (at least 3 men and 2 women, size 6). With the two particular women not together, women selections number \({}^7C_w-{}^5C_{w-2}\).

3M, 3W: \({}^{10}C_3({}^7C_3-{}^5C_1)=120\times30=3600\). 4M, 2W: \({}^{10}C_4({}^7C_2-{}^5C_0)=210\times20=4200\). Total \(3600+4200=7800\).

Teacher's Note: Case on 3 or 4 men; exclude women selections containing both particular women.

Exam Note: 3600 + 4200 = 7800.

Question 5.4 (7). Find the number of ways in which the birthdays of six different persons will fall in exactly two calendar months.

Solution.

Answer: 4092

Choose the two months in \({}^{12}C_2=66\) ways. Assign each of the six persons to one of the two months so that both are used: \(2^6-2=62\). Total \(66\times62=4092\).

Teacher's Note: Choose two months, then count onto assignments of six persons.

Exam Note: 66 x 62.

Question 5.4 (8). A bag contains 50 tickets numbered 1, 2, 3, ..., 50. Find the number of set of five tickets \(x_1,x_2,x_3,x_4,x_5\) one has if \(x_1<x_2<x_3<x_4<x_5\) and \(x_3=30\).

Solution.

Answer: 77140

With \(x_3=30\): \(x_1<x_2\) chosen from 1 to 29 in \({}^{29}C_2=406\) ways; \(x_4<x_5\) chosen from 31 to 50 in \({}^{20}C_2=190\) ways. Total \(406\times190=77140\).

Teacher's Note: Fix the middle ticket 30, choose two smaller and two larger tickets.

Exam Note: 29C2 times 20C2.

Question 5.4 (9). Four visitors A, B, C, D arrived at a town that has 5 hotels. In how many ways, can they disperse themselves among 5 hotels.

Solution.

Answer: 625

Each of the four visitors can choose any of 5 hotels: \(5^4=625\).

Teacher's Note: Each visitor independently picks a hotel.

Exam Note: 5^4 = 625.

Question 5.4 (10). In how many shortest ways can we reach from the point (0, 0, 0) to point (3, 7, 11) in space where the movement is possible only along the x-axis, y-axis and z-axis or parallel to them and change of axes is permitted only at integral points. (An integral point is one, which has its coordinate as integer.)

Solution.

Answer: 42325920

The shortest path needs 3 steps along x, 7 along y and 11 along z, in any order: \(\dfrac{21!}{3!\,7!\,11!}=42325920\).

Teacher's Note: Arrange 3 x-steps, 7 y-steps and 11 z-steps in a row.

Exam Note: 21!/(3!7!11!).

Question 5.4 (11). Out of 8 sailors on a boat, 3 can work only on one particular side and 2 only on the other side. Find the number of ways in which the sailors can be arranged on the boat.

Solution.

Answer: 1728

A boat has two sides of 4 sailors each. 3 sailors are fixed to one side, 2 to the other; the remaining 3 sailors fill one more place on the first side (3 ways) and the other two places on the second side. Each side's sailors can be arranged in \(4!\) ways. Total \(3\times4!\times4!=1728\).

Teacher's Note: Complete each side with the free sailors, then arrange the sailors on each side.

Exam Note: 3 x 4! x 4!.

Question 5.4 (12). For an examination, a candidate has to select 7 subjects from 3 different groups A, B, C, which contain 4, 5, 6 subjects, respectively. The number of different ways in which a candidate can make his selection if he has to select at least 2 subjects from each group is

a. 2500

b. 2600

c. 2700

d. 2800

Solution.

Answer: (c) 2700

Let the numbers of subjects from groups A, B, C (with 4, 5, 6 subjects) be \(a,b,c\) with \(a+b+c=7\) and each at least 2. The only possibilities are \((2,2,3),(2,3,2),(3,2,2)\).

Total \({}^4C_2\,{}^5C_2\,{}^6C_3+{}^4C_2\,{}^5C_3\,{}^6C_2+{}^4C_3\,{}^5C_2\,{}^6C_2=1200+900+600=2700\).

Teacher's Note: Only splits (2,2,3), (2,3,2), (3,2,2) of 7 subjects satisfy the condition.

Exam Note: 1200 + 900 + 600 = 2700.

Question 5.5 (1). In how many ways can 3 ladies and 3 gentlemen be seated around a round table so that any two and only two of the ladies sit together?

Solution.

Answer: 72

Seat the 3 gentlemen around the table in \((3-1)!=2\) ways, creating 3 gaps. One gap gets a pair of ladies and another gap gets one lady: choose the single lady in 3 ways, arrange the pair in 2 ways, and choose the two gaps in \(3\times2=6\) ways. Total \(2\times3\times2\times6=72\) (checked by direct enumeration).

Teacher's Note: Seat the men circularly, then put a pair of ladies in one gap and one lady in another.

Exam Note: 2 x 3 x 2 x 6 = 72.

Question 5.5 (2). In how many ways can 15 members of a council sit along a circular table, when the secretary is to sit on one side of the chairman and the deputy secretary on the other side?

Solution.

Answer: 2(12!)

Treat chairman with the secretary on one side and the deputy on the other as one block, which can be formed in 2 ways (secretary to the left or right). The block and the other 12 members form 13 objects around the table: \(12!\) ways. Total \(2\times12!\).

Teacher's Note: Make a block secretary-chairman-deputy (2 orders) and arrange 13 units circularly.

Exam Note: 2 times 12!.

Question 5.5 (3). Find the number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit together.

Solution.

Answer: 86400

Seat the 6 men round the table in \(5!\) ways. The 5 women take 5 of the 6 gaps in \({}^6P_5=720\) ways. Total \(120\times720=86400\).

Teacher's Note: Seat the men circularly, then place the women in separate gaps.

Exam Note: 5! times 6P5.

Question 5.5 (4). Find the number of ways that 8 beads of different colours be strung as a necklace.

Solution.

Answer: 2520

Arrangements of 8 beads in a circle: \(7!\); a necklace can be turned over, so divide by 2: \(7!/2=2520\).

Teacher's Note: Circular arrangements halved because a necklace can be flipped.

Exam Note: 7!/2 = 2520.

Question 5.5 (5). Find the number of ways in which 8 different flowers can be strung to form a garland so that four particular flowers are never separated.

Solution.

Answer: 288

Treat the four particular flowers as one block. The block and the other 4 flowers give 5 units: \(4!/2=12\) garlands. The block's flowers can be arranged in \(4!=24\) ways. Total \(12\times24=288\) (checked by direct enumeration).

Teacher's Note: Block the four flowers, arrange five units in a garland, then arrange inside the block.

Exam Note: (4!/2) times 4! = 288.

Question 5.6 (1). Out of 10 white, 9 black and 7 red balls, find the number of ways in which selection of one or more balls can be made (balls of the same color are identical).

Solution.

Answer: 879

Number of ways of choosing white, black, red balls: \((10+1)(9+1)(7+1)=880\), including choosing none. One or more balls: \(880-1=879\).

Teacher's Note: Choose 0 to n of each colour, subtract the empty selection.

Exam Note: 11 x 10 x 8 - 1.

Question 5.6 (2). In an election, number of candidates exceeds the number to be elected by 2. A man can vote in 56 ways. Find the number of candidates.

Solution.

Answer: 6

Let there be \(n\) candidates, \(n-2\) to be elected. A voter votes for at least 1 and at most \(n-2\) candidates: \(2^n-1-n-1=2^n-n-2=56\)\(\Rightarrow n=6\).

Teacher's Note: A vote picks 1 to n-2 of the n candidates; solve 2^n - n - 2 = 56.

Exam Note: Voting count 2^n - n - 2.

Question 5.6 (3). There are 5 historical monuments, 6 gardens and 7 shopping malls in a city. In how many ways a tourist can visit the city if he visits at least one shopping mall.

Solution.

Answer: 260096

Monuments: \(2^5\) subsets; gardens: \(2^6\) subsets; shopping malls (at least one): \(2^7-1=127\). Total \(32\times64\times127=260096\).

Teacher's Note: Each place visited or not; require at least one mall.

Exam Note: 2^5 x 2^6 x (2^7 - 1).

Question 5.6 (4). Find the number of divisors of 720. How many of these are even? Also find the sum of divisors.

Solution.

Answer: 30 divisors, 24 even, sum 2418

\(720=2^4\times3^2\times5\). Number of divisors \((4+1)(2+1)(1+1)=30\). Even divisors (at least one 2): \(4\times3\times2=24\). Sum of divisors \(\dfrac{2^5-1}{2-1}\cdot\dfrac{3^3-1}{3-1}\cdot\dfrac{5^2-1}{5-1}=31\times13\times6=2418\).

Teacher's Note: Use the prime factorisation 2^4 3^2 5 and the divisor count and sum formulas.

Exam Note: 30 divisors, 24 even, sum 2418.

Question 5.6 (5). Find the number of odd proper divisors of \(3^p\times 6^m\times 21^n\).

Solution.

Answer: (p+m+n+1)(n+1) - 1

\(3^p\times6^m\times21^n=2^m\,3^{p+m+n}\,7^n\). Odd divisors use no factor 2: \((p+m+n+1)(n+1)\). Proper divisors exclude 1 and the number itself (the number is even when \(m\ge1\)), so the count of odd proper divisors is \((p+m+n+1)(n+1)-1\).

Teacher's Note: Odd divisors ignore the prime 2; remove 1 as the book's proper divisors exclude 1 and N.

Exam Note: Take the exponent of 2 as zero.

Question 5.6 (6). In how many ways the number 7056 can be resolved as a product of 2 factors.

Solution.

Answer: 23

\(7056=2^4\times3^2\times7^2\) has \(5\times3\times3=45\) divisors. Since it is a perfect square (7056 = 84 squared), the number of ways to write it as a product of two factors (order not mattering) is \(\dfrac{45+1}{2}=23\).

Teacher's Note: For a perfect square with d divisors the unordered factor pairs number (d + 1)/2.

Exam Note: 45 divisors, a perfect square.

Question 5.7 (1). Find the number of ways in which 22 different books can be given to 5 students, so that two students get 5 books each and all the remaining students get 4 books each.

Solution.

Answer: \(\dfrac{22!}{(5!)^2(4!)^3}\times{}^5C_2\)

The 22 books are divided into groups of 5, 5, 4, 4, 4. Choose which two students get 5 books: \({}^5C_2\) ways. Then distribute the books to the students (all different): \(\dfrac{22!}{(5!)^2(4!)^3}\). Total \({}^5C_2\times\dfrac{22!}{(5!)^2(4!)^3}\).

Teacher's Note: Choose the two students getting five books, then distribute books by a multinomial coefficient.

Exam Note: 5C2 times 22!/((5!)^2 (4!)^3).

Question 5.7 (2). Find the number of ways in which 16 constables can be assigned to patrol 8 villages, 2 for each.

Solution.

Answer: \(\dfrac{16!}{(2!)^8}\)

Constables go to 8 different villages, 2 each: \(\dfrac{16!}{(2!)^8}\).

Teacher's Note: Distribute 16 distinct constables into 8 labelled pairs.

Exam Note: Multinomial 16!/(2!)^8.

Question 5.7 (3). In how many ways can 10 different prizes be given to 5 students if one particular boy must get 4 prizes and rest of the students can get any number of prizes?

Solution.

Answer: 860160

Choose the 4 prizes for the particular boy: \({}^{10}C_4=210\). Each of the remaining 6 prizes goes to one of the other 4 students: \(4^6=4096\). Total \(210\times4096=860160\).

Teacher's Note: Select exactly four prizes for him; give the other prizes to the other four students freely.

Exam Note: 10C4 times 4^6.

Question 5.7 (4). In how many different ways can a set \(A\) of \(3n\) elements be partitioned into 3 subsets of equal number of elements? (The subsets \(P,Q,R\) form a partition if \(P\cup Q\cup R=A,\ P\cap R=\phi,\ Q\cap R=\phi,\ R\cap P=\phi\).)

Solution.

Answer: \(\dfrac{(3n)!}{(n!)^3\,3!}\)

Dividing \(3n\) elements into three groups of \(n\) each: \(\dfrac{(3n)!}{(n!)^3\,3!}\) (division by \(3!\) as the three subsets are not distinguished).

Teacher's Note: Equal unlabelled groups: divide the multinomial by 3!.

Exam Note: Three equal-sized groups.

Question 5.7 (5). In how many ways can Rs. 16 be divided into 4 persons when none of them gets less than Rs. 3?

Solution.

Answer: 35

Let the persons get Rs \(x_1,x_2,x_3,x_4\) with \(x_i\ge3\) and sum 16. Put \(y_i=x_i-3\ge0\): \(y_1+y_2+y_3+y_4=4\), which has \({}^{4+4-1}C_{4-1}={}^7C_3=35\) solutions.

Teacher's Note: Subtract Rs 3 from each share and count non-negative solutions.

Exam Note: Stars and bars gives 7C3.

Question 5.7 (6). Find the number of ways of selecting 10 balls out of an unlimited number of identical white, red and blue balls.

Solution.

Answer: 66

Numbers \(w,r,b\ge0\) with \(w+r+b=10\): \({}^{12}C_2=66\).

Teacher's Note: Count non-negative solutions of w + r + b = 10.

Exam Note: 12C2 = 66.

Question 5.7 (7). If \(a,b,c,d\) are odd natural numbers such that \(a+b+c+d=20\), then find the number of values of the ordered quadruplet \((a,b,c,d)\).

Solution.

Answer: 165

Put \(a=2x+1\) etc. with \(x,y,z,w\ge0\): \(2(x+y+z+w)+4=20\Rightarrow x+y+z+w=8\), which has \({}^{11}C_3=165\) solutions.

Teacher's Note: Write odd numbers as 2x + 1 and count solutions of x + y + z + w = 8.

Exam Note: 11C3 = 165.

Question 5.7 (8). Roorkee University has to send 10 professors to 5 centres for its entrance examination, 2 to each centre. Two of the centres are in Roorkee and the others are outside. Two of the professors prefer to work in Roorkee while three prefer to work outside. In how many ways can this be made if the preferences are to be satisfied?

Solution.

Answer: 5400

Roorkee has 2 centres (4 places) and outside has 3 centres (6 places). Roorkee gets the 2 professors preferring it plus 2 chosen from the 5 without preference: \({}^5C_2=10\). Divide these 4 into the 2 Roorkee centres, 2 each: \(\dfrac{4!}{2!\,2!}=6\). The other 6 go to the 3 outside centres, 2 each: \(\dfrac{6!}{(2!)^3}=90\). Total \(10\times6\times90=5400\).

Teacher's Note: Fill Roorkee with its preferred professors plus two others; then split groups among centres.

Exam Note: 10 x 6 x 90 = 5400.

Question 5.7 (9). In how many ways, two different natural numbers can be selected, which are less than or equal to 100 and differ by almost 10.

Solution.

Answer: 945

For difference \(d=1,2,\ldots,10\) there are \(100-d\) pairs. Total \(\sum_{d=1}^{10}(100-d)=1000-55=945\).

Teacher's Note: Count unordered pairs by their difference d, from 1 to 10.

Exam Note: Sum of (100 - d) for d = 1 to 10.

Question 5.8 (1). In how many ways can 30 marks be allotted to 8 questions if each question carries at least 2 marks?

Solution.

Answer: \({}^{21}C_7=116280\)

Give each question 2 marks first (16 marks). The remaining 14 marks are distributed freely: \({}^{14+8-1}C_{8-1}={}^{21}C_7=116280\).

Teacher's Note: Give each question the minimum 2 marks, then distribute the remaining 14.

Exam Note: Stars and bars gives 21C7.

Question 5.8 (2). Find the number of positive integral solutions of the inequality \(3x+y+z\le 30\).

Solution.

Answer: 1215

Positive integer solutions of \(3x+y+z\le30\): for each \(x=1,\ldots,9\), \(y+z\le30-3x\) with \(y,z\ge1\) gives \({}^{30-3x}C_2\) solutions. Sum \(\sum_{x=1}^{9}{}^{30-3x}C_2=351+276+210+153+105+66+36+15+3=1215\) (x = 10 gives none).

Teacher's Note: Fix x, then count positive solutions of y + z <= 30 - 3x.

Exam Note: Sum of (30-3x)C2 over x.

Question 5.8 (3). Find the number of integers between 1 and 100000 having the sum of the digits 18.

Solution.

Answer: 4840

Numbers from 1 to 99999 as five-digit strings \(d_1d_2d_3d_4d_5\) (leading zeros allowed) with digit sum 18 (100000 has sum 1). Number of solutions of \(d_1+\cdots+d_5=18,\ 0\le d_i\le9\): \({}^{22}C_4-5\,{}^{12}C_4=7315-2475=4840\).

Teacher's Note: Count digit strings of length five with sum 18 by inclusion-exclusion on digits above 9.

Exam Note: 22C4 - 5 times 12C4.

Question 5.8 (4). Find the number of integral solutions of \(x_1+x_2+x_3=24\) subjected to the condition that \(1\le x_1\le 5,\ 12\le x_2\le 18\) and \(-1\le x_3\).

Solution.

Answer: 35

Let \(x_1=1+a,\ x_2=12+b,\ x_3=-1+c\) with \(0\le a\le4,\ 0\le b\le6,\ c\ge0\). Then \(a+b+c=24-1-12+1=12\). So \(c=12-a-b\ge0\) always holds for \(a+b\le10\) (max \(4+6=10\)), giving \(5\times7=35\) solutions.

Teacher's Note: Shift the variables to start at zero; the upper bounds then decide the count.

Exam Note: a in 0..4, b in 0..6, c determined.

Step-by-Step Cengage G Tewani Solutions for Class 11 Math

Complete Math Solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Concept Application Exercises

Access the complete chapter-wise PDF for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Concept Application Exercises. These structured Cengage G Tewani Solutions solutions for Class 11 Mathematics help students build foundational accuracy and prepare effectively for upcoming school evaluations.

Concept-Driven Math Answers

Clear, methodical explanations accompany every challenging problem within the text. Engaging with these detailed mathematical breakdowns lays a solid foundation for advanced learning and improves execution speed for upcoming exams.

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

What are these [current-page:node:field_author] Solutions for Class 11 Mathematics?

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.

Are the [current-page:node:field_author] Class 11 Mathematics Solutions free to read?

Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.

How should I use these [current-page:node:field_author] solutions for Class 11 Mathematics?

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.

Will practising [current-page:node:field_author] Class 11 Mathematics questions help in exams?

Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.

Are these solutions arranged chapter by chapter?

Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.

Which session are these Class 11 Mathematics Solutions for?

They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.