Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Reasoning Type

Solutions for Class 11 Mathematics: Chapter 05 Permutation Combination

Review structured textbook solutions for Class 11 Mathematics Chapter 05 Permutation Combination prepared by . Built according to modern educational guidelines for the 2026 academic year, these downloadable answers support daily revision and mathematical accuracy.

Practice Class 11 Mathematics Solutions: 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.

Reasoning Type

Question 1.

Statement 1: The number of positive integral solutions of \(abc=30\) is 27.Statement 2: Number of ways in which three prizes can be distributed among three persons is \(3^3\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

We have, \(30=2\times3\times5\). So, 2 can be assigned to either \(a\) or \(b\) or \(c\), i.e. 2 can be assigned in 3 ways. Similarly, each of 3 and 5 can be assigned in 3 ways. Thus, the number of solutions is \(3\times3\times3=27\).

Teacher's Note: Each prime factor of 30 goes to one of the three variables.

Exam Note: Statement 2 gives the 3^3 count.

Question 2.

Statement 1: Number of ways in which 10 identical toys can be distributed among three students if each receives at least two toys is \({}^9C_2\).Statement 2: Number of positive integral solutions of \(x+y+z+w=7\) is \({}^6C_3\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (d)

Each student receives at least two toys. Let us first give each student one toy. Now, we are left with 7 toys, which can be distributed among three students such that each receives at least one toy, which is equivalent to number of positive integral solutions of the equation \(x+y+z+w=7\), which is given by \({}^{7-1}C_{4-1}={}^6C_3\).

Hence, statement 1 is false and statement 2 is correct.

Teacher's Note: Give each student two toys first, then count the remaining distributions.

Exam Note: Statement 1 count is not 9C2.

Question 3.

Statement 1: \((n^2)!/(n!)^n\) is a natural number for all \(n\in N\).Statement 2: Number of ways in which \(n^2\) objects can be distributed among \(n\) persons equally is \((n^2)!/(n!)^n\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

Number of ways of dividing \(n^2\) objects into \(n\) groups of same size is \(\dfrac{(n^2)!}{(n!)^n\,n!}\).

Now number of ways of distributing these \(n\) groups among \(n\) persons is

\(\left[\dfrac{(n^2)!}{(n!)^n\,n!}\right]n!=\dfrac{(n^2)!}{(n!)^n}\) which is always an integer.

Also we know that product of \(r\) is divisible by \(r!\). Now, \((n^2)!=1\times2\times3\times4\cdots n^2\) is written as \(1\times2\times3\cdots n\), \(\times(n+1)(n+2)\cdots2n\), \(\times(2n+1)(2n+2)\cdots3n\), ..., \(\times(n^2-(n-1))(n^2-(n-2))\cdots n^2\).

Thus, in \(n^2!\) there are \(n\) rows each consisting product of \(n\) integers. Each row is divisible by \(n!\).

Hence \((n^2)!\) is divisible by \((n!)^n\) or \(\dfrac{(n^2)!}{(n!)^n}\) is a natural number.

Hence, both statements are correct and statement 2 is correct explanation of statement 1.

Teacher's Note: Distributing n^2 objects equally among n persons gives an integer count.

Exam Note: Count of equal distributions is an integer.

Question 4.

Statement 1: The number of ways of writing 1400 as a product of two positive integers is 12.Statement 2: 1400 is divisible by exactly three prime factors.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (b)

\(1400=2^3\,5^2\,7\)

The number of ways in which 1400 can be expressed as a product of two positive integers is

\(\dfrac{(3+1)(2+1)(1+1)}{2}=12\)

Statement 2 is correct but does not explain statement 1 as it just gives the information about the prime factor about which 1400 is divisible.

Teacher's Note: Divisor count (3+1)(2+1)(1+1) = 24; pair up divisors.

Exam Note: Prime-factor count does not explain the 12.

Question 5.

Statement 1: Let \(E=\{1,2,3,4\}\) and \(F=\{a,b\}\). Then the number of onto functions from \(E\) to \(F\) is 14.Statement 2: Number of ways in which four distinct objects can be distributed into two different boxes is 14 if no box remains empty.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

In onto functions each image must be assigned at least one pre-image. Now if we consider the images \(a\) and \(b\) as two different boxes, then four distinct objects 1, 2, 3 and 4 (pre-images) can be distributed in \(2^4-{}^2C_1(2-1)^4=14\) ways.

Hence, both statements are correct and statement 2 is correct explanation of statement 1.

Teacher's Note: Onto functions correspond to distributions into two labelled boxes, neither empty.

Exam Note: 2^4 - 2 = 14.

Question 6.

Statement 1: Number of ways in which India can win the series of 11 matches is \(2^{10}\). (if no match is drawn).Statement 2: For each match there are two possibilities, either India wins or loses.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (b)

India must win at least 6 matches of 11 matches. Then number of ways in which India can win the series is

\({}^{11}C_6+{}^{11}C_7+\cdots+{}^{11}C_{11}=2^{10}\)

Thus, both the statements are true, but statement 2 is not correct explanation of statement 1.

Teacher's Note: India needs at least 6 wins of 11; sum upper half binomials.

Exam Note: Half of 2^11.

Question 7.

Statement 1: Number of ways in which Indian team (11 players) can bat, if Yuvraj wants to bat before Dhoni and Pathan wants to bat after Dhoni is \(11!/3!\).Statement 2: Yuvraj, Dhoni and Pathan can be arranged in batting order in 3! ways.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

The batting order of 11 players can be decided in \(11!\) ways. Now Yuvraj, Dhoni and Pathan can be arranged in \(3!\) ways. But the order of these three players is fixed, i.e., Yuvraj-Dhoni-Pathan. Now, \(11!\) answer is \(3!\) times more, hence the required answer is \(11!/3!\).

Teacher's Note: Fix the relative order of the three players: divide 11! by 3!.

Exam Note: Only one of the 3! relative orders works.

Question 8.

Statement 1: When number of ways of arranging 21 objects of which \(r\) objects are identical of one type and remaining are identical of second type is maximum, then maximum value of \({}^{13}C_r\) is 78.Statement 2: \({}^{2n+1}C_r\) is maximum when \(r=n\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (d)

Number of ways of arranging 21 objects when \(r\) are identical of one type and remaining are identical of second type is \(\dfrac{21!}{r!\,(21-r)!}={}^{21}C_r\), which is maximum when \(r=10\) or 11.

Therefore, \({}^{13}C_r={}^{13}C_{10}\) or \({}^{13}C_{11}\), hence maximum value of \({}^{13}C_r\) is \({}^{13}C_{10}=286\).

Hence, statement 1 is false. Obviously statement 2 is true.

Teacher's Note: 21Cr is largest at r = 10 or 11, which makes 13Cr equal 286, not 78.

Exam Note: Statement 1 value is 286.

Question 9.

Statement 1: Total number of five-digit numbers having all different digits and divisible by 4 can be formed using the digits \(\{1,3,2,6,8,9\}\) is 192.Statement 2: A number is divisible by 4, if the last two digits of the number are divisible by 4.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

A number is divisible by 4, if the last two digits are divisible by 4. Last two digits can be 12, 16, 28, 32, 36, 68, 92, 96. Thus, last two places can be filled in 8 ways. The remaining three places can be filled with remaining 4 digits in \({}^4C_3\,3!\) ways. Total number of such numbers is \(8\times({}^4C_3\,3!)=192\).

Teacher's Note: List admissible last-two-digit pairs, then fill the other three places.

Exam Note: 8 endings times 24.

Question 10.

Statement 1: Number of ways in which 30 can be partitioned into three unequal parts, each part being a natural number is 61.Statement 2: Number of ways of distributing 30 identical objects in three different boxes is \({}^{30}C_2\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (c)

We have \(a+b+c=30\), and \(a\ne b\ne c\). Let \(a<b<c\).

Now, relative values of \(a,b,c\) are tabulated as follows.

\(a\)\(b\)\(c\)Number of triplets \((a,b,c)\)
12 to 1427 to 1513
23 to 1325 to 1511
34 to 1323 to 1410
45 to 1221 to 148
56 to 1219 to 137
67 to 1117 to 135
78 to 1115 to 124
89, 1013, 122
910111
Total61

So statement 1 is correct. Statement 2 gives a different count (distributing 30 identical objects into three different boxes gives \({}^{32}C_2\) ways, or \({}^{29}C_2\) if no box is empty, not \({}^{30}C_2\)), so it is false.

Teacher's Note: List triples a<b<c with sum 30 by smallest part a.

Exam Note: Triples total 61; Statement 2 count is wrong.

Question 11.

Statement 1: If \(p,qStatement 2: If \(p,q>r\), the number of different selections of \(p+q\) things taking \(r\) at a time, where \(p\) things are identical and \(q\) other things are identical, is \(r-1\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (c)

When \(p,q<r\), we have selection procedure as follows:

From \(p\) identical thingsFrom \(q\) identical things
\(p\)\(r-p\)
\(p-1\)\(r-(p-1)\)
\(p-2\)\(r-(p-2)\)
......
\(r-q\)\(q\)
Total: \(p+q-r+1\)

When \(p,q>r\), we have selection procedure as follows:

From \(p\) identical thingsFrom \(q\) identical things
\(r\)0
\(r-1\)1
\(r-2\)2
......
0\(r\)
Total: \(r+1\)

Thus, statement 1 is correct, but statement 2 is false.

Teacher's Note: Count splits of r between two kinds of identical things.

Exam Note: Statement 2 total is r + 1.

Question 12.

Statement 1: The number of ways in which three distinct numbers can be selected from the set \(\{3^1,3^2,3^3,\ldots,3^{100},3^{101}\}\) so that they form a G.P. is 2500.Statement 2: If \(a,b,c\) are in A.P., then \(3^a,3^b,3^c\) are in G.P.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

Statement 2 is correct as when \(3^a,3^b,3^c\) are in G.P., we have \((3^b)^2=(3^a)(3^c)\Rightarrow2b=a+c\Rightarrow a,b,c\) are in A.P. Thus, selecting three numbers in G.P. from \(\{3^1,3^2,3^3,\ldots,3^{100},3^{101}\}\) is equivalent to selecting 3 numbers from \(\{1,2,3,\ldots,101\}\) which are in A.P. Now, \(a,b,c\) are in A.P. if either \(a\) and \(c\) are odd or \(a\) and \(c\) are even.

Number of selection ways of 2 odd numbers is \({}^{51}C_2\). Number of selection ways of 2 even numbers is \({}^{50}C_2\). Hence, total number of ways is \({}^{51}C_2+{}^{50}C_2=1275+1225=2500\).

Teacher's Note: Exponents of a G.P. from powers of 3 form an A.P.; count A.P.s in 1..101.

Exam Note: 1275 + 1225 = 2500.

Question 13.

Statement 1: Number of ways in which two persons \(A\) and \(B\) select objects from two different groups each having 20 different objects such that \(B\) selects always more objects than \(A\) (including the case when \(A\) selects no object) is \((2^{40}-{}^{40}C_{20})/2\).Statement 2: The sum \(\sum_{0\le i(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

Statement 2 is true, see the proof in binomial theorem.

Also in statement 1, if \(A\) selects \(i\) objects and \(B\) selects \(j\) objects then \(i<j\). Hence number of ways is \(\sum_{0\le i<j\le20}{}^{20}C_i\,{}^{20}C_j\).

Teacher's Note: Statement 1 reduces to the double sum of Statement 2 with n = 20.

Exam Note: Both counts equal (2^40 - 40C20)/2.

Question 14.

Statement 1: Number of ways of selecting 10 objects from 42 objects of which, 21 objects are identical and remaining objects are distinct is \(2^{20}\).Statement 2: \({}^{42}C_0+{}^{42}C_1+{}^{42}C_2+\cdots+{}^{42}C_{21}=2^{41}\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (c)
Number of objects from 21 different objectsNumber of objects from 21 identical objectsNumber of ways of selections
100\({}^{21}C_{10}\times1\)
91\({}^{21}C_9\times1\)
.........
010\({}^{21}C_0\times1\)

Thus, total number of ways of selection is \({}^{21}C_0+{}^{21}C_1+{}^{21}C_2+\cdots+{}^{21}C_{10}=2^{20}\).

Statement 2 is false, as given series is not exact half series. (For details, see the theory in binomial theorem.)

Teacher's Note: Take k from the distinct objects and 10-k from the identical ones.

Exam Note: Half of 2^21 = 2^20.

Question 15.

Statement 1: Number of terms in the expansion of \((x+y+z+w)^{50}\) is \({}^{53}C_3\).Statement 2: Number of non-negative solution of the equation \(p+q+r+s=50\) is \({}^{53}C_3\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

General term in the expansion of \((x+y+z+w)^{50}\) is

\(\dfrac{50!}{p!\,q!\,r!\,s!}x^py^qz^rw^s\)

where \(p+q+r+s=50,\ 0\le p,q,r,s\le50\) (see theory in binomial theorem).

Now number of terms is equal to number of ways in which we can adjust powers of \(x,y,z\) and \(w\) such that their sum is 50, i.e., equal to the non-negative solutions of \(p+q+r+s=50\), which is given by \({}^{50+4-1}C_{4-1}\).

Teacher's Note: Terms of the expansion correspond to non-negative solutions of p+q+r+s=50.

Exam Note: Stars and bars gives 53C3.

Question 16.

Statement 1: The number of ways in which \(n\) persons can be seated at a round table, so that all shall not have the same neighbours in any two arrangements is \((n-1)!/2\).Statement 2: Number of ways of arranging \(n\) different beads in circles in which is \((n-1)!/2\).

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (a)

When \(n\) persons be seated at a round table, so that all shall not have the same neighbours in any two arrangements, clockwise and anticlockwise arrangements are considered to be the same, which is the case when \(n\) different beads are arranged in the circle. Hence, number of ways is \((n-1)!/2\).

Teacher's Note: Reflections count as the same arrangement, like necklaces.

Exam Note: Circular arrangements halved for reflection.

Question 17.

Statement 1: Number of zeros at the end of 50! is equal to 12.Statement 2: Exponent of 2 in 50! is 47.

(a) Both the statements are TRUE and STATEMENT 2 is the correct explanation of STATEMENT 1.

(b) Both the statements are TRUE but STATEMENT 2 is NOT the correct explanation of STATEMENT 1.

(c) STATEMENT 1 is TRUE and STATEMENT 2 is FALSE.

(d) STATEMENT 1 is FALSE and STATEMENT 2 is TRUE.

Solution.

Answer: (b)

Exponent of 2 in 50! is

\(\left[\dfrac{50}{2}\right]+\left[\dfrac{50}{4}\right]+\left[\dfrac{50}{8}\right]+\left[\dfrac{50}{16}\right]+\left[\dfrac{50}{32}\right]=25+12+6+3+1=47\)

And exponent of 5 in 50! is

\(\left[\dfrac{50}{5}\right]+\left[\dfrac{50}{25}\right]=12\)

Now number of zeros in the end of 50! is equal to exponent of 10 in 50! which is equal to exponent of 5 in 50! Therefore, number of zeros in the end depends on exponent of 5, but not on the exponent of 2.

Hence both statements 1 and 2 are true; but statement 2 is not a correct explanation for statement 1.

Teacher's Note: Trailing zeros are fixed by the exponent of 5 in 50!.

Exam Note: Legendre: 12 factors of 5, 47 of 2.

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

Access Class 11 Mathematics Solutions

Explore reliable mathematical solutions for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Reasoning Type tailored for Class 11 learners. Utilizing these complete exercise answers ensures your preparation aligns exactly with standard academic requirements.

Concept-Driven Math Answers

Each problem includes a step-by-step breakdown to clarify complex mathematical formulas and theorems. Utilizing these verified answers ensures students learn the proper problem-solving techniques expected in standard academic assessments.

Next Steps in Your Mathematics Revision

Wrap up your chapter revision by testing your knowledge against standard objective question formats. Explore our full library of up-to-date syllabus details and mock evaluations to secure top grades in your math examinations.

FAQs

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.