Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Linked Comprehension Type

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.

Practice Class 11 Mathematics Solutions: Chapter 05 Permutation Combination

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

Linked Comprehension Type

Question 1.

Passage for Problems 1-3: We have to choose 11 players for cricket team from eight batsmen, six bowlers, four all rounders and two wicket keepers in the following conditions.

The number of selections when almost one all rounder and one wicket keeper will play

(a) \({}^4C_1\times{}^{14}C_{10}+{}^2C_1\times{}^{14}C_{10}+{}^4C_1\times{}^2C_1\times{}^{14}C_9+{}^{14}C_{11}\)

(b) \({}^4C_1\times{}^{15}C_{11}+{}^{15}C_{11}\)

(c) \({}^4C_1\times{}^{15}C_{10}+{}^{15}C_{11}\)

(d) none of these

Solution.

Answer: (a)

When one all rounder and ten players from bowlers and batsmen play, number of ways is \({}^4C_1\,{}^{14}C_{10}\).

When one wicketkeeper and 10 players from bowlers and batsmen play, number of ways is \({}^2C_1\,{}^{14}C_{10}\).

When one all rounder, one wicketkeeper and nine from batsmen and bowlers play, number of ways is \({}^4C_1\,{}^2C_1\,{}^{14}C_9\).

When all eleven players play from bowlers and batsmen then, number of ways is \({}^{14}C_{11}\).

Total number of selections is \({}^4C_1\,{}^{14}C_{10}+{}^2C_1\,{}^{14}C_{10}+{}^4C_1\,{}^2C_1\,{}^{14}C_9+{}^{14}C_{11}\).

Teacher's Note: Case on whether an all-rounder or wicketkeeper plays, the rest from 14 batsmen and bowlers.

Exam Note: Four disjoint cases.

Question 2.

Passage for Problems 1-3: We have to choose 11 players for cricket team from eight batsmen, six bowlers, four all rounders and two wicket keepers in the following conditions.

Number of selections when two particular batsmen do not want to play when a particular bowler will play

(a) \({}^{17}C_{10}+{}^{19}C_{11}\)

(b) \({}^{17}C_{10}+{}^{19}C_{11}+{}^{17}C_{11}\)

(c) \({}^{17}C_{10}+{}^{20}C_{11}\)

(d) \({}^{19}C_{10}+{}^{19}C_{11}\)

Solution.

Answer: (a)

If the particular bowler plays then two batsmen will not play. So, rest of 10 players can be selected from 17 other players. Number of such selections is \({}^{17}C_{10}\).

If the particular bowler does not play, then number of selections is \({}^{19}C_{11}\) (this already includes the selections in which the two batsmen also do not play).

Total number of selections is \({}^{17}C_{10}+{}^{19}C_{11}\).

Teacher's Note: Case on whether the particular bowler plays; if so, both batsmen are out.

Exam Note: 17C10 + 19C11.

Question 3.

Passage for Problems 1-3: We have to choose 11 players for cricket team from eight batsmen, six bowlers, four all rounders and two wicket keepers in the following conditions.

Number of selections when a particular batsman and a particular wicket keeper do not want to play together

(a) \(2\,{}^{18}C_{10}\)

(b) \({}^{19}C_{11}+{}^{18}C_{10}\)

(c) \({}^{19}C_{10}+{}^{19}C_{11}\)

(d) none of these

Solution.

Answer: (b)

If the particular batsman is selected, then rest of 10 players can be selected in \({}^{18}C_{10}\) ways.

If particular wicketkeeper is selected, then rest of 10 players can be selected in \({}^{18}C_{10}\) ways.

If both are not selected, then number of ways is \({}^{18}C_{11}\).

Hence, total number of ways is \(2\,{}^{18}C_{10}+{}^{18}C_{11}={}^{19}C_{11}+{}^{18}C_{10}\).

Teacher's Note: Case on who is picked: the batsman, the wicketkeeper, or neither.

Exam Note: 2 18C10 + 18C11.

Question 4.

Passage for Problems 4-6: Twelve 12 persons are to be arranged around two round tables such that one table can accommodate seven persons and another five persons only. Answer the following questions.

Number of ways in which these 12 persons can be arranged is

(a) \({}^{12}C_5\,6!\,4!\)

(b) \(6!\,4!\)

(c) \({}^{12}C_5\,6!\,4!\)

(d) none of these

Solution.

Answer: (c)

Seven persons can be selected for first table in \({}^{12}C_7\) ways. Now these seven persons can be arranged in \(6!\) ways. The remaining five persons can be arranged on the second table in \(4!\) ways. Hence, total number of ways is \({}^{12}C_5\,6!\,4!\).

Teacher's Note: Choose seven for the larger table, arrange each table circularly.

Exam Note: Circular arrangements 6! and 4!.

Question 5.

Passage for Problems 4-6: Twelve 12 persons are to be arranged around two round tables such that one table can accommodate seven persons and another five persons only. Answer the following questions.

Number of ways of arrangements if two particular persons \(A\) and \(B\) do not want to be on the same table is

(a) \({}^{10}C_4\,6!\,4!\)

(b) \(2\ {}^{10}C_6\,6!\,4!\)

(c) \({}^{11}C_6\,6!\,4!\)

(d) none of these

Solution.

Answer: (b)

Here, \(A\) can sit on first table and \(B\) on the second or \(A\) on second table and \(B\) on the second table.

If \(A\) is on the first table, then remaining six for first table can be selected in \({}^{10}C_6\) ways. Now these seven persons can be arranged in \(6!\) ways. Remaining five can be arranged on the other table in \(4!\) ways.

Hence, total number of ways is \(2\,{}^{10}C_6\,6!\,4!\).

Teacher's Note: A and B at different tables; by symmetry double the case with A at table one.

Exam Note: 2 times 10C6 times 6! 4!.

Question 6.

Passage for Problems 4-6: Twelve 12 persons are to be arranged around two round tables such that one table can accommodate seven persons and another five persons only. Answer the following questions.

Number of ways of arrangement if two particular persons \(A\) and \(B\) want to be together and consecutive is

(a) \({}^{10}C_7\,6!\,3!\,2!+{}^{10}C_5\,4!\,5!\,2!\)

(b) \({}^{10}C_5\,6!\,3!+{}^{10}C_7\,4!\,5!\)

(c) \({}^{10}C_7\,6!\,2!+{}^{10}C_5\,5!\,2!\)

(d) none of these

Solution.

Answer: (a)

If \(A,B\) are on the first table, then remaining five can be selected in \({}^{10}C_5\) ways.

Now seven persons including \(A\) and \(B\) can be arranged on the first table in which \(A\) and \(B\) are together in \(2!\,5!\) ways. Remaining five can be arranged on the second table in \(4!\) ways. Total number of ways is \({}^{10}C_5\,4!\,5!\,2!\).

If \(A,B\) are on the second table, then remaining three can be selected in \({}^{10}C_3\) ways.

Now five persons including \(A\) and \(B\) can be arranged on the second table in which \(A\) and \(B\) are together \(2!\,3!\) ways. Remaining seven can be arranged on the first table in \(6!\) ways. Hence, number of ways for first table is \({}^{10}C_7\,6!\,3!\,2!\).

Teacher's Note: Case on which table holds A and B; treat them as one block.

Exam Note: Sum of the two table cases.

Question 7.

Passage for Problems 7-9: Five balls are to be placed in three boxes. Each box should hold all the five balls so that no box remains empty.

Number of ways if balls are different but boxes are identical is

(a) 30

(b) 25

(c) 21

(d) 35

Solution.

Answer: (b)

If no box remains empty, then we can have \((1,1,3)\) or \((1,2,2)\) distribution pattern.

When balls are different and boxes are identical, number of distributions is equal to number of divisions in \((1,1,3)\) or \((1,2,2)\) ways. Hence, total number of ways is

\(\dfrac{5!}{1!\,1!\,3!\,2!}+\dfrac{5!}{(2!)^2\,1!\,2!}=25\)

Teacher's Note: Divide five different balls into groups of sizes (1,1,3) or (1,2,2).

Exam Note: 10 + 15 = 25.

Question 8.

Passage for Problems 7-9: Five balls are to be placed in three boxes. Each box should hold all the five balls so that no box remains empty.

Number of ways if balls and boxes are identical is

(a) 3

(b) 1

(c) 2

(d) none of these

Solution.

Answer: (c)

When balls as well as boxes are identical, we have only two ways \((1,1,3)\) and \((1,2,2)\). Hence, number of ways is 2.

Teacher's Note: Identical balls and boxes leave only the partitions of 5 into 3 parts.

Exam Note: Partitions (1,1,3) and (1,2,2).

Question 9.

Passage for Problems 7-9: Five balls are to be placed in three boxes. Each box should hold all the five balls so that no box remains empty.

Number of ways if balls as well as boxes are identical but boxes are kept in a row is

(a) 10

(b) 15

(c) 20

(d) 6

Solution.

Answer: (d)

When boxes are kept in a row, they will be treated as different. In this case the number of ways will be \({}^{5-1}C_{3-1}={}^4C_2=6\).

Teacher's Note: Boxes in a row are distinguishable; count positive solutions of x+y+z=5.

Exam Note: 4C2 = 6.

Question 10.

Passage for Problems 10-12: Let \(f(n)\) denote the number of different ways in which the positive integer \(n\) can be expressed as the sum of 1s and 2s. For example, \(f(4)=5\), since \(4=2+2=2+1+1=1+2+1=1+1+2=1+1+1+1\). Note that order of 1s and 2s is important.

The value of \(f(6)\) is

(a) 12

(b) 13

(c) 18

(d) 21

Solution.

Answer: (b)

\(6=0(2)+6(1)=1(2)+4(1)=2(2)+2(1)=3(2)+0(1)\)

Number of 2sNumber of 1sNumber of permutations
061
14\(\frac{5!}{4!}=5\)
22\(\frac{4!}{2!\,2!}=6\)
30\(\frac{3!}{3!}=1\)
Total = 13

\(\therefore\ f(6)=13\)

Teacher's Note: Count arrangements of 1s and 2s summing to 6 by number of 2s.

Exam Note: Number of compositions of 6 into 1s and 2s.

Question 11.

Passage for Problems 10-12: Let \(f(n)\) denote the number of different ways in which the positive integer \(n\) can be expressed as the sum of 1s and 2s. For example, \(f(4)=5\), since \(4=2+2=2+1+1=1+2+1=1+1+2=1+1+1+1\). Note that order of 1s and 2s is important.

The value of \(f(f(6))\) is

(a) 400

(b) 350

(c) 377

(d) none of these

Solution.

Answer: (c)

Now, \(f(f(6))=f(13)\):

Number of 1sNumber of 2sNumber of permutations
1301
111\(\frac{12!}{11!}=12\)
92\(\frac{11!}{9!\,2!}=55\)
73\(\frac{10!}{7!\,3!}=120\)
54\(\frac{9!}{5!\,4!}=126\)
35\(\frac{8!}{3!\,5!}=56\)
16\(\frac{7!}{6!}=7\)
Total = 377

\(\therefore\ f(f(6))=f(13)=377\)

Teacher's Note: Evaluate f(13) by counting 1s and 2s arrangements.

Exam Note: f(13) = 377.

Question 12.

Passage for Problems 10-12: Let \(f(n)\) denote the number of different ways in which the positive integer \(n\) can be expressed as the sum of 1s and 2s. For example, \(f(4)=5\), since \(4=2+2=2+1+1=1+2+1=1+1+2=1+1+1+1\). Note that order of 1s and 2s is important.

\(f:N\to N\) is

(a) one-one and onto

(b) one-one and into

(c) many-one and onto

(d) many-one and into

Solution.

Answer: (b)

\(f(1)=1\ (1)\)

\(f(2)=2\ (1,1\ \text{or}\ 2)\)

\(f(3)=3\ (1,1,1\ \text{or}\ 2,1\ \text{or}\ 1,2)\)

\(f(4)=5\) (explained in the paragraph)

By taking higher value of \(n\) in \(f(n)\), we always get more value of \(f(n)\). Hence, \(f(x)\) is one-one. Clearly, \(f(x)\) is into.

Teacher's Note: f takes Fibonacci-like increasing values, so it is injective but misses values.

Exam Note: f(1), f(2), f(3), f(4) = 1, 2, 3, 5.

Question 13.

Passage for Problems 13-15: There are \(m\) seats in the first row of a theatre, of which \(n\) are to be occupied.

The number of ways of arranging \(n\) persons if no two persons sit side by side is

(a) \(\dfrac{(m-n+1)!}{(m-3n+1)!}\)

(b) \(\dfrac{(m-n+1)!}{(m-2n)!}\)

(c) \(\dfrac{(m-n+1)!}{(m-2n+1)!}\)

(d) \(\dfrac{(m-n+2)!}{(m-2n-1)!}\)

Solution.

Answer: (c)

Let \(x_0\) denote the number of empty seats to the left of the first person, \(x_i\ (1\le i\le n-1)\) the number of empty seats between the \(i^{th}\) and \((i+1)^{th}\) persons of the \(n^{th}\) person. Then \(x_0,x_n\ge0\) and \(x_i\ge1\) for \(1\le i\le n-1\).

\(x_0+x_1+\cdots+x_n=(m-n)\qquad(1)\)

Putting \(x_i=y_i+1\), where \(y_i\ge0\), we have

\(x_0+y_1+\cdots+y_{n-1}+x_n+(1+1+1+\cdots+(n-1)\ \text{times})=(m-n)\)

\(\Rightarrow x_0+y_1+\cdots+y_{n-1}+x_n=m-n-(n-1)\)

\(\Rightarrow x_0+y_1+\cdots+y_{n-1}+x_n=m-2n+1\)

Now number of non-negative integral solutions is \({}^{n+1+(m-2n+1)-1}C_{n+1-1}={}^{m-n+1}C_n\). Since we can permute \(n\) persons in \(n!\) ways, the required number of ways is

\(\left({}^{m-n+1}C_n\right)(n!)=\dfrac{(m-n+1)!}{n!\,(m-2n+1)!}n!=\dfrac{(m-n+1)!}{(m-2n+1)!}\)

Teacher's Note: Count empty-seat gaps with at least one empty seat between persons.

Exam Note: Gap variables and stars and bars.

Question 14.

Passage for Problems 13-15: There are \(m\) seats in the first row of a theatre, of which \(n\) are to be occupied.

If \(n\) is even, the number of ways of arranging \(n\) persons if each person has exactly one neighbour is

(a) \(({}^nP_{n/2})({}^{m-n+1}P_{n/2})\)

(b) \(({}^nP_n)({}^{m-n+1}P_{n/2})\)

(c) \(({}^nP_{n/2})({}^{m-n+1}P_n)\)

(d) none of these

Solution.

Answer: (a)

Let \(n=2k\), where \(k\) is some positive integer. Let \(x_0\) denote the number of empty seats to the left of the first pair, \(x_i\ (1\le i\le k-1)\) the number of empty seats between \(i^{th}\) and \((i+1)^{th}\) pair and \(x_k\) the number of empty seats to the right of the \(k^{th}\) pair. Note that \(x_0,x_k\ge0,\ x_i\ge1\ (1\le i\le k-1)\) and

\(x_0+x_1+\cdots+x_k=(m-2k)\qquad(2)\)

The number of integral solutions of Eq. (2) is \({}^{m-2k+1}C_k\) (see the solution to problem 13).

Since we can permute \(n\) persons in \(n!\) ways, the required number of ways is

\(\left({}^{m-2k+1}C_k\right)(2k)!=\dfrac{(m-2k+1)!}{k!\,(m-3k+1)!}(2k)!\)

\(=\dfrac{(2k)!}{k!}\cdot\dfrac{(m-2k+1)!}{(m-3k+1)!}\)

\(=\left({}^{2k}P_k\right)\left({}^{m-2k+1}P_k\right)=\left({}^nP_{n/2}\right)\left({}^{m-n+1}P_{n/2}\right)\)

Teacher's Note: Treat pairs as blocks of two adjacent persons and count gaps.

Exam Note: Pairs with at least one empty seat between.

Question 15.

Passage for Problems 13-15: There are \(m\) seats in the first row of a theatre, of which \(n\) are to be occupied.

The number of ways of arranging \(n\) persons, if out of any two seats located symmetrically in the middle of the row at least one is empty is

(a) \(({}^{m/2}C_n)(2^n)-1\)

(b) \({}^{m/2}P_n\)

(c) \(({}^{m/2}P_n)(2^n-1)\)

(d) \(({}^{m/2}P_n)(2^n)\)

Solution.

Answer: (d)

\(m\) is even. Let \(m=2k\), where \(k\) is some positive integer. We can choose \(n\) seats out of the \(k\) seats to the left of the middle seat in \({}^kC_n\) ways. Each chosen seat can be either empty or occupied. Thus, the number of ways of choosing seats for \(n\) persons is equal to \(({}^kC_n)(2^n)\). We can arrange \(n\) persons at these seats in \({}^nP_n\) ways. Hence, the required number of arrangements is given by

\((n!)\,({}^kC_n)(2^n)=({}^kP_n)(2^n)=({}^{m/2}P_n)(2^n)\)

Teacher's Note: Choose n of the m/2 symmetric seat pairs, pick one seat of each pair, arrange persons.

Exam Note: Each pair contributes 2 choices.

Question 16.

Passage for Problems 16-18: Consider the letters of the word 'MATHEMATICS'.

Possible number of words taking all letters at a time such that at least one repeating letter is at odd position in each word is

(a) \(\dfrac{11!}{2!\,2!\,2!}-\dfrac{9!}{2!\,2!}\)

(b) \(\dfrac{9!}{2!\,2!\,2!}\)

(c) \(\dfrac{9!}{2!\,2!}\)

(d) \(\dfrac{11!}{2!\,2!\,2!}\)

Solution.

Answer: (d)

Since there are 5 even places and 3 pairs of repeated letters, therefore at least one of these must be at an odd place. Therefore, the number of ways is \(11!/(2!\,2!\,2!)\).

Teacher's Note: Six repeated letters cannot all fit into the five even places.

Exam Note: So every arrangement qualifies.

Question 17.

Passage for Problems 16-18: Consider the letters of the word 'MATHEMATICS'.

Possible number of words taking all letters at a time such that in each word both M's are together and both T's are together but both A's are not together is

(a) \(\dfrac{11!}{2!\,2!\,2!}-\dfrac{10!}{2!\,2!}\)

(b) \(7!\,{}^8C_2\)

(c) \(\dfrac{6!\,4!}{2!\,2!}\)

(d) \(\dfrac{9!}{2!\,2!\,2!}\)

Solution.

Answer: (b)

Make a group of both M's and another group of T's. Then except A's we have 5 letters remaining. So M's, T's and the letters except A's can be arranged in \(7!\) ways. Therefore, total number of arrangements is \(7!\times{}^8C_2\).

Teacher's Note: Treat MM and TT as blocks; place the two A's in separate gaps.

Exam Note: 8 gaps for the two A's.

Question 18.

Passage for Problems 16-18: Consider the letters of the word 'MATHEMATICS'.

Possible number of words in which no two vowels are together is

(a) \(7!\,{}^8C_4\dfrac{4!}{2!}\)

(b) \(\dfrac{7!}{2!}\,{}^8C_4\dfrac{4!}{2!}\)

(c) \(\dfrac{7!}{2!\,2!}\,{}^8C_4\dfrac{4!}{2!}\)

(d) \(\dfrac{7!}{2!\,2!\,2!}\,{}^8C_4\dfrac{4!}{2!}\)

Solution.

Answer: (c)

Consonants can be placed in \(7!/(2!\,2!)\) ways. Then there are 8 places and 4 vowels. Therefore, number of ways is

\(\dfrac{7!}{2!\,2!}\,{}^8C_4\,\dfrac{4!}{2!}\)

Teacher's Note: Arrange consonants first, then place vowels in four of the eight gaps.

Exam Note: Vowels A, A, E, I arranged in 4!/2!.

Class 11 Mathematics: Cengage G Tewani Solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Linked Comprehension Type

Access Class 11 Mathematics Solutions

Review detailed solutions for Class 11 Mathematics. The Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Linked Comprehension Type PDF provides comprehensive answers mapped to standard Cengage G Tewani Solutions textbooks, ensuring targeted revision for weekly tests and terminal exams.

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.