Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Multiple Correct Answers Type

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

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.

Multiple Correct Answers Type

Question 1. Number of ways in which three numbers in A.P. can be selected from 1, 2, 3, ..., \(n\) is

\((a)\ \left(\dfrac{n-1}{2}\right)^2\ \text{if }n\text{ is even}\)

\((b)\ \dfrac{n(n-2)}{4}\ \text{if }n\text{ is even}\)

\((c)\ \dfrac{(n-1)^2}{4}\ \text{if }n\text{ is odd}\)

(d) none of these

Solution.

Answer: (b), (c)

If \(a,b,c\) are in A.P., then \(a\) and \(c\) both are odd or both are even.

Case I: \(n\) is even.

The number of ways of selection of two even numbers \(a\) and \(c\) is \({}^{n/2}C_2\). Number of ways of selection of two odd numbers is \({}^{n/2}C_2\). Hence the number of A.P.'s is

\(2\,{}^{n/2}C_2=2\,\dfrac{\frac n2\left(\frac n2-1\right)}{2}=\dfrac{n(n-2)}{4}\)

Case II: \(n\) is odd.

The number of ways of selection of two odd numbers \(a\) and \(c\) is \({}^{(n+1)/2}C_2\). The number of ways of selection of two even numbers \(a\) and \(c\) is \({}^{(n-1)/2}C_2\). Hence the number of A.P.'s is

\({}^{(n+1)/2}C_2+{}^{(n-1)/2}C_2=\dfrac{\frac{n+1}{2}\left(\frac{n+1}{2}-1\right)}{2}+\dfrac{\frac{n-1}{2}\left(\frac{n-1}{2}-1\right)}{2}\)

\(=\dfrac18\left((n-1)((n+1)+(n-3)\right)=\dfrac{(n-1)^2}{4}\)

Teacher's Note: End terms of the progression have the same parity; middle term then fixed.

Exam Note: Case on n even or odd.

Question 2. Kanchan has 10 friends among whom two are married to each other. She wishes to invite five of them for a party. If the married couples refuse to attend separately, then the number of different ways in which she can invite five friends is

(a) \({}^8C_5\)

(b) \(2\times{}^8C_3\)

(c) \({}^{10}C_5-2\times{}^8C_4\)

(d) none of these

Solution.

Answer: (b), (c)

The number of ways of inviting, with the couple not included, is \({}^8C_5\). The number of ways of inviting with the couple included, is \({}^8C_3\). Therefore the required number of ways is

\({}^8C_5+{}^8C_3={}^8C_3+{}^8C_3\quad(\because\ {}^8C_5={}^8C_3)\)

Also,

\({}^{10}C_5-2\times{}^8C_4=\dfrac{10!}{5!\,5!}-2\times\dfrac{8!}{4!\,4!}\)

\(=\dfrac{10\times9\times8\times7\times6}{120}-2\times\dfrac{8\times7\times6\times5}{24}\)

\(=9\times4\times7-140\)

\(=112=2\times\dfrac{8!}{3!\,5!}\)

Teacher's Note: Couple attends together or not at all; compare each option with the total 112.

Exam Note: 8C5 + 8C3 = 112.

Question 3. A forecast is to be made of the results of five cricket matches, each of which can be a win or a draw or a loss for Indian team. Let,

\(p\) = number of forecasts with exactly 1 error

\(q\) = number of forecasts with exactly 3 errors and

\(r\) = number of forecasts with all five errors

Then the correct statement(s) is/are

(a) \(2q=5r\)

(b) \(8p=q\)

(c) \(8p=5r\)

(d) \(2(p+r)>q\)

Solution.

Answer: (a), (b), (d)

\(p={}^5C_4\times{}^2C_1=10\)

\(q={}^5C_2({}^2C_1)^3=80\)

\(r={}^5C_0({}^2C_1)^5=32\)

\(\Rightarrow 2q=5r,\ 8p=q\) and \(2(p+r)>q\)

Teacher's Note: Count forecasts by number of wrong matches, each wrong match having two wrong outcomes.

Exam Note: p = 10, q = 80, r = 32.

Question 4. Ten persons numbered 1, 2, ..., 10 play a chess tournament, each player playing against every other player exactly one game. It is known that no game ends in a draw. If \(w_1,w_2,\ldots,w_{10}\) are the number of games won by players 1, 2, 3, ..., 10, respectively, and \(l_1,l_2,\ldots,l_{10}\) are the number of games lost by the players 1, 2, ..., 10, respectively, then,

(a) \(\sum w_i=\sum l_i=45\)

(b) \(w_i+l_i=9\)

(c) \(\sum w_il_i^2=81+\sum l_i^2\)

(d) \(\sum w_i^2=\sum l_i^2\)

Solution.

Answer: (a), (b), (d)

Clearly, each player will play 9 games. And total number of games is \({}^{10}C_2=45\). Clearly,

\(w_i+l_i=9\ \text{and}\ \sum w_i=\sum l_i=45\)

\(\Rightarrow w_i=9-l_i\Rightarrow w_i^2=81+l_i^2-18l_i\)

\(\Rightarrow\sum w_i^2=81\times10+\sum l_i^2-18\sum l_i=810+\sum l_i^2-18\times45=\sum l_i^2\)

Teacher's Note: Each player plays 9 games, so w_i = 9 - l_i; square and sum.

Exam Note: Sum of w_i squared equals sum of l_i squared.

Question 5. The number of ways of choosing triplet \((x,y,z)\) such that \(z>\max\{x,y\}\) and \(x,y,z\in\{1,2,\ldots,n,n+1\}\) is

(a) \({}^{n+1}C_3+{}^{n+2}C_3\)

(b) \(n(n+1)(2n+1)/6\)

(c) \(1^2+2^2+\cdots+n^2\)

(d) \(2({}^{n+2}C_3)-{}^{n+1}C_2\)

Solution.

Answer: (a), (b), (c), (d)

When \(z=n+1\), we can choose \(x,y\) from \(\{1,2,\ldots,n\}\).

When \(z=n+1\), \(x,y\) can be chosen in \(n^2\) ways and when \(z=n\), \(x,y\) can be chosen in \((n-1)^2\) ways and so on. Therefore, the number of ways of choosing triplets is

\(n^2+(n-1)^2+\cdots+1^2=\dfrac16n(n+1)(2n+1)\)

Alternatively triplets with \(x=y<z,\ x<y<z,\ y<z<x\) can be chosen in \({}^{n+1}C_2,\ {}^{n+1}C_3,\ {}^{n+1}C_3\) ways. Therefore,

\({}^{n+1}C_2+2({}^{n+1}C_3)={}^{n+2}C_3+{}^{n+1}C_3=2({}^{n+2}C_3)-{}^{n+1}C_2\)

Teacher's Note: Fix z and count pairs (x,y) below it, or split by order of x, y, z.

Exam Note: Strict inequality z > max gives sum of squares.

Question 6. Number of ways in which 200 people can be divided in 100 couples is

(a) \(\dfrac{(200)!}{2^{100}(100)!}\)

(b) \(1\times 3\times 5\cdots 199\)

(c) \(\left(\dfrac{101}{2}\right)\left(\dfrac{102}{2}\right)\cdots\left(\dfrac{200}{2}\right)\)

(d) \(\dfrac{(200)!}{(100)!}\)

Solution.

Answer: (a), (b), (c)

\(\dfrac{(200)!}{2!\,2!\cdots2!\,(100)!}\ (100\text{ times})=\dfrac{(200)!}{100!\,2^{100}}=1\times3\times5\cdots199\)

Also,

\(\dfrac{(200)!}{100!\,2^{100}}=\left(\dfrac{101}{2}\right)\left(\dfrac{102}{2}\right)\cdots\left(\dfrac{200}{2}\right)\)

Teacher's Note: Divide 200 people into 100 unordered pairs: (200)! over 2^100 times 100!.

Exam Note: Pairing count equals the double factorial 199!!.

Question 7. If a seven-digit number made up of all distinct digits 8, 7, 6, 4, 2, \(x\) and \(y\) is divisible by 3, then

(a) maximum value of \(x-y\) is 9

(b) maximum value of \(x+y\) is 12

(c) minimum value of \(xy\) is 0

(d) minimum value of \(x+y\) is 3

Solution.

Answer: (a), (b), (c), (d)

\(8,7,6,4,2,x\) and \(y\)

Any number is divisible by 3 if sum of digits is divisible by 3, i.e., \(x+y+27\) is divisible by 3. \(x\) and \(y\) can take values from 0, 1, 3, 5, 9. Possible pairs are (5, 1) (3, 0) (9, 0) (9, 3) and (1, 5), (0, 3), (0, 9), (3, 9).

Teacher's Note: Digit sum 27 + x + y must be divisible by 3; list admissible distinct pairs.

Exam Note: Pairs: (5,1), (3,0), (9,0), (9,3) and reversals.

Question 8. If \(n\) is number of necklaces which can be formed using 17 identical pearls and two identical diamonds and similarly \(m\) is number of necklaces which can be formed using 17 identical pearls and different diamonds, then

(a) \(n=9\)

(b) \(m=18\)

(c) \(n=18\)

(d) \(m=9\)

Solution.

Answer: (a), (d)

Problem is same as dividing 17 identical things in two groups.

\(\therefore\ n=\dfrac{17+1}{2}=9\)

There is no effect if two diamonds are different as necklace can be flipped over. Hence, \(n=m=9\).

Teacher's Note: Two diamonds split 17 pearls into two arcs; necklaces can be flipped.

Exam Note: Different diamonds change nothing after flipping.

Question 9. Let \(f(n)\) be the number of regions in which \(n\) coplanar circles can divide the plane. If it is known that each pair of circles intersect in two different point and no three of them have common point of intersection, then

(a) \(f(20)=382\)

(b) \(f(n)\) is always an even number

(c) \(f^{-1}(92)=10\)

(d) \(f(n)\) can be odd

Solution.

Answer: (a), (b), (c)

The number of regions for \(n\) circles be \(f(n)\). Clearly, \(f(1)=2\). Now,

\(f(n)=f(n-1)+2(n-1),\ \forall\ n\ge2\)

\(\Rightarrow f(n)-f(n-1)=2(n-1)\)

Putting \(n=2,3,\ldots,n\), we get

\(f(n)-f(1)=2(1+2+3+\cdots+n-1)=(n-1)n\)

\(\Rightarrow f(n)=n(n-1)+2=(n^2-n+2)\) (which is always even)

\(\Rightarrow f(20)=20^2-20+2=382\)

Also,

\(n^2-n+2=92\)

\(\Rightarrow n^2-n-90=0\Rightarrow n=10\)

Teacher's Note: The nth circle adds 2(n-1) regions; solve the recurrence.

Exam Note: f(n) = n^2 - n + 2.

Question 10. Given that the divisors of \(n=3^p\cdot5^q\cdot7^r\) are of the form \(4\lambda+1,\ \lambda\ge0\). Then

(a) \(p+r\) is always even

(b) \(p+q+r\) is always odd

(c) \(q\) can be any integer

(d) if \(p\) is odd then \(r\) is even

Solution.

Answer: (a), (c)

\(3^p=(4-1)^p=4\lambda_1+(-1)^p\)

\(5^q=(4+1)^q=4\lambda_2+1\)

\(7^r=(8-1)^r=4\lambda_3+(-1)^r\)

Hence, any positive integer power of 5 will be in the form of \(4\lambda_2+1\). Even power of 3 and 7 will be in the form of \(4\lambda+1\) and odd power of 3 and 7 will be in the form of \(4\lambda-1\). Hence, both \(p\) and \(r\) must be odd or both must be even. Thus \(p+r\) is always even. Also, \(p+q+r\) can be odd or even.

Teacher's Note: Reduce powers modulo 4; 3^p and 7^r each give (-1)^p, (-1)^r.

Exam Note: p and r have the same parity.

Question 11. Number of ways of selecting three integers from \(\{1,2,3,\ldots,n\}\) if their sum is divisible by 3 is

(a) \(3\left({}^{n/3}C_3\right)+(n/3)^3\) if \(n=3k,\ k\in N\)

(b) \(2\left({}^{(n-1)/3}C_3\right)+\left({}^{(n+2)/3}C_3\right)+((n-1)/3)^2(n+2)/3\), if \(n=3k+1,\ k\in N\)

(c) \(2\left({}^{(n-1)/3}C_3\right)+\left({}^{(n+2)/3}C_3\right)+((n-1)/3)^2(n+2)\), if \(n=3k+2,\ k\in N\)

(d) independent of \(n\)

Solution.

Answer: (a), (b)

When \(n=3k\), there are exactly \(n/3\) integers of each type \(3p,\ 3p+1,\ 3p+2\).

Now, sum of three selected integers is divisible by 3. Then either all the integers of the same type \(3p,3p+1\) or \(3p+2\) or one-one integer from each type. Then number of selection ways is \({}^{n/3}C_3+{}^{n/3}C_3+{}^{n/3}C_3+({}^{n/3}C_1)({}^{n/3}C_1)({}^{n/3}C_1)=3({}^{n/3}C_3)+(n/3)^3\).

If \(n=3k+1\), then there are \((n-1)/3\) integers of the type \(3p,\ 3p+2\) and \((n+2)/3\) integers of the type \(3p+1\). Then number of selection ways is \(2\,({}^{(n-1)/3}C_3)+{}^{(n+2)/3}C_3+((n-1)/3)^2(n+2)/3\).

If \(n=3k+2\), there are \((n-2)/3\) integers of type \(3p\) and \((n+1)/3\) integers each of types \(3p+1\) and \(3p+2\), so the count is \({}^{(n-2)/3}C_3+2\,{}^{(n+1)/3}C_3+\dfrac{n-2}{3}\left(\dfrac{n+1}{3}\right)^2\), which differs from the expression in option (c).

Teacher's Note: Sort integers by remainder mod 3: sum divisible by 3 means same type or one of each.

Exam Note: Counts depend on n mod 3.

Question 12. Number of points of intersection of \(n\) straight lines if \(n\) satisfies

\({}^{n+5}P_{n+1}=\dfrac{11(n-1)}{2}\times{}^{n+3}P_n\) is

(a) 15

(b) 28

(c) 21

(d) 10

Solution.

Answer: (a), (c)

\({}^{n+5}P_{n+1}=\dfrac{11(n-1)}{2}\times{}^{n+3}P_n\)

\(\Rightarrow{}^{n+5}P_{n+1}=\dfrac{(n+5)!}{4!}=\dfrac{11(n-1)}{2}\dfrac{(n+3)!}{3!}\)

\(\Rightarrow(n+5)(n+4)=22(n-1)\)

After solving, we get \(n=6\) or \(n=7\).

The number of points of intersection of lines is \({}^6C_2\) or \({}^7C_2\) = 15 or 21.

Teacher's Note: Solve the permutation equation for n, then count intersections as nC2.

Exam Note: n = 6 or 7 gives 15 or 21 points.

Question 13. Number of shortest ways in which we can 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) is

(a) equivalent to number of ways of dividing 21 different objects in three groups of size 3, 7, 11

(b) equivalent to coefficient of \(y^3z^7\) in the expansion of \((1+y+z)^{21}\)

(c) equivalent to number of ways of distributing 21 different objects in three boxes of size 3, 7, 11

(d) equivalent to number of ways of arranging 21 objects of which 3 are alike of one kind, 7 are alike of second type and 11 are alike of third type

Solution.

Answer: (a), (b), (c), (d)

Total number of units to be covered is \(3+7+11=21\). A person can choose 3 units in \({}^{21}C_3\) ways. A person can choose 7 units in \({}^{18}C_7\) ways. The rest 11 units can be chosen in 1 way. Therefore, total number of ways is \({}^{21}C_3\times{}^{18}C_7\times1=21!/(3!\,7!\,11!)\).

Each of the options (a), (b), (c) and (d) gives this same number: (a), (c) the division or distribution of 21 different objects into groups of sizes 3, 7, 11, (b) the multinomial coefficient of \(y^3z^7\) in \((1+y+z)^{21}\), and (d) arrangements of 21 objects with 3, 7, 11 alike.

Teacher's Note: Shortest path needs 3 x-steps, 7 y-steps, 11 z-steps; arrange them.

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

Question 14. Number of ways in which 30 identical things are distributed among six persons is

(a) \({}^{17}C_5\) if each gets odd number of things

(b) \({}^{16}C_{11}\) if each gets odd number of things

(c) \({}^{14}C_5\) if each gets even number of things (excluding 0)

(d) \({}^{15}C_{10}\) if each gets even number of things (excluding 0)

Solution.

Answer: (a), (c)

Let person \(P_i\) get \(x_i\) number of things such that

\(x_1+x_2+x_3+x_4+x_5+x_6=30\)

If \(x_i\) is odd or \(x_i=2\lambda_i+1\), where \(\lambda_i\ge0\), then

\(2(\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5+\lambda_6)+6=30\)

\(\Rightarrow\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5+\lambda_6=12\)

Then number of solutions is \({}^{12+6-1}C_{6-1}={}^{17}C_5\). If \(x_i\) is even or \(x_i=2\lambda_i\), where \(\lambda_i\ge1\), then

\(2(\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5+\lambda_6)=30\)

\(\Rightarrow\lambda_1+\lambda_2+\lambda_3+\lambda_4+\lambda_5+\lambda_6=15\)

Therefore, required number of ways is \({}^{15-1}C_{6-1}={}^{14}C_5\).

Teacher's Note: Write odd shares as 2*lambda+1 and even shares as 2*lambda; use stars and bars.

Exam Note: Odd gives 17C5, even gives 14C5.

Question 15. If \(N\) denotes the number of ways of selecting \(r\) objects out of \(n\) distinct objects \((r\ge n)\) with unlimited repetition but with each object included at least once in selection, then \(N\) is equal to

(a) \({}^{r-1}C_{r-n}\)

(b) \({}^{r-1}C_n\)

(c) \({}^{r-1}C_{n-1}\)

(d) none of these

Solution.

Answer: (a), (c)

Let \(x_i\ (1\le i\le n)\) be the number of objects selected of the \(i^{th}\) type. Since each object is to be selected at least once, we must have \(x_i\ge1\) and \(x_1+x_2+\cdots+x_n=r\). We have to find number of positive integral solutions of the above equation. Total number of such solutions is \({}^{r-1}C_{n-1}={}^{r-1}C_{r-n}\).

Teacher's Note: Positive integer solutions of x1+...+xn=r.

Exam Note: Stars and bars gives (r-1)C(n-1).

Question 16. \(A\) is a set containing \(n\) elements. A subset \(P_1\) of \(A\) is chosen. The set \(A\) is reconstructed by replacing the elements of \(P_1\). Next, a subset \(P_2\) of \(A\) is chosen and again the set is reconstructed by replacing the elements of \(P_2\). In this way, \(m\ (>1)\) subsets \(P_1,P_2,\ldots,P_m\) of \(A\) are chosen. The number of ways of choosing \(P_1,P_2,\ldots,P_m\) is

(a) \((2^m-1)^n\) if \(P_1\cap P_2\cap\cdots\cap P_m=\phi\)

(b) \(2^{mn}\) if \(P_1\cup P_2\cup\cdots\cup P_m=A\)

(c) \(2^{mn}\) if \(P_1\cap P_2\cap\cdots\cap P_m=\phi\)

(d) \((2^m-1)^n\) if \(P_1\cup P_2\cup\cdots\cup P_m=A\)

Solution.

Answer: (a), (d)

Let \(A=\{a_1,a_2,\ldots,a_n\}\). For each \(a_i\ (1\le i\le n)\), we have either \(a_i\in P_j\) or \(a_i\notin P_j\ (1\le j\le m)\). That is, there are \(2^m\) choices in which \(a_i\ (1\le i\le n)\) may belong to the \(P_j\)'s. One of these, there is only one choice, in which \(a_i\in P_j\) for all \(j=1,2,\ldots,m\) which is not favourable for \(P_1\cap P_2\cap\cdots\cap P_m\) to be \(\phi\). Thus, \(a_i\notin P_1\cap P_2\cap\cdots\cap P_m\) in \(2^m-1\) ways.

Since there are \(n\) elements in set \(A\), the total number of choices is \((2^m-1)^n\).

Also, there is exactly one choice, in which, \(a_i\notin P_j\) for all \(j=1,2,\ldots,m\) which is not favourable for \(P_1\cup P_2\cup\cdots\cup P_m\) to be equal to \(A\).

Thus, \(a_i\) can belong to \(P_1\cup P_2\cup\cdots\cup P_m\) in \((2^m-1)\) ways. Since there are \(n\) elements in set \(A\), the number of ways in which \(P_1\cup P_2\cup\cdots\cup P_m\) can be equal to \(A\) is \((2^m-1)^n\).

Teacher's Note: Each element has 2^m membership patterns; exclude the one forbidden pattern.

Exam Note: Per element 2^m - 1 allowed patterns.

Question 17. If \(10!=2^p\cdot3^q\cdot5^r\cdot7^s\), then

(a) \(2q=p\)

(b) \(pqrs=64\)

(c) number of divisors of 10! is 280

(d) number of ways of putting 10! as a product of two natural numbers is 135

Solution.

Answer: (a), (b), (d)

Exponent of 2 is \(\left[\dfrac{10}{2}\right]+\left[\dfrac{10}{2^2}\right]+\left[\dfrac{10}{2^3}\right]=5+2+1=8\)

Exponent of 3 is \(\left[\dfrac{10}{3}\right]+\left[\dfrac{10}{3^2}\right]=3+1=4\)

Exponent of 5 is \(\left[\dfrac{10}{5}\right]=2\)

Exponent of 7 is \(\left[\dfrac{10}{7}\right]=1\)

Thus \(p=8,\ q=4,\ r=2,\ s=1\), so \(2q=p\) and \(pqrs=64\).

The number of divisors of 10! is \((8+1)(4+1)(2+1)(1+1)=270\). The number of ways of putting \(N\) as a product of two natural numbers is \(270/2=135\).

Teacher's Note: Use Legendre's formula for exponents of 2, 3, 5, 7 in 10!.

Exam Note: Exponents 8, 4, 2, 1.

Question 18. If \(P=21(21^2-1^2)(21^2-2^2)(21^2-3^2)\cdots(21^2-10^2)\), then \(P\) is divisible by

(a) 22!

(b) 21!

(c) 19!

(d) 20!

Solution.

Answer: (b), (c), (d)

\(P=21(21+1)(21-1)(21+2)(21-2)\cdots(21+10)(21-10)\)

\(=(21-10)(21-9)\cdots(21-1)\,21\,(21+1)(21+10)\cdots(21+10)\)

\(=31\times30\times\cdots\times11\)

which is divisible by \(21!\), and hence by \(20!\) and \(19!\).

Teacher's Note: Factor each 21^2 - k^2 into (21-k)(21+k); the product is a run of consecutive integers.

Exam Note: P = 31!/10!, divisible by 21!.

Question 19. Let \(n\) is of four-digit integer in which all the digits are different. If \(x\) is number of odd integers and \(y\) is number of even integers, then

(a) \(x<y\)

(b) \(x>y\)

(c) \(x+y=4500\)

(d) \(|x-y|=54\)

Solution.

Answer: (a)

When \(n\) is odd: [Fig. 5.46: four boxes with 8 ways (0 does not appear), 8, 7, 5 ways i.e. with 1, 3, 5, 7, 9.]

The number of such numbers is \(8\times8\times7\times5=2240\).

When \(n\) is even:

If unit's place is filled with 0, then the total number is \(9\times8\times7=504\). [Fig. 5.47]

If unit's place is not filled with 0, then the total number is \(8\times8\times7\times4=1792\). [Fig. 5.48: 8 ways (0 does not appear), 8, 7, 4 ways i.e. with 2, 4, 6, 8.]

Hence, the total number of even numbers is \(y=504+1792=2296\).

So \(x=2240<y=2296\) and \(|x-y|=56\).

Teacher's Note: Count odd and even four-digit numbers with distinct digits by the last digit.

Exam Note: x = 2240 and y = 2296.

Download Cengage G Tewani Solutions for Class 11 Math PDF

Chapter-wise Cengage G Tewani Solutions: Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Multiple Correct Answers Type

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

Step-by-Step Mathematical Explanations

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.

Explore More Study Resources for Class 11 Math

In addition to these Cengage G Tewani Solutions chapters, students can explore a wider library of free online mock tests, printable sample papers, and short revision notes aligned with the 2026 academic session.

FAQs

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.