Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Subjective Type

Step-by-Step Solutions for Class 11 Mathematics Chapter 05 Permutation Combination

Explore reliable textbook solutions for Chapter 05 Permutation Combination tailored for Class 11 learners using methodologies. Utilizing these Mathematics answers ensures thorough preparation and strengthens foundational knowledge before final school evaluations.

Download Chapter 05 Permutation Combination Textbook Solutions PDF

View or download the dedicated Chapter 05 Permutation Combination solution resource below. Engaging with these textbook answers under focused study conditions ensures continuous academic progress and mastery of the 2026 curriculum for Mathematics.

Subjective Type

Question 1. Prove by combinatorial argument that \({}^{n+1}C_r={}^nC_r+{}^nC_{r-1}\).

Solution.

Consider \(n+1\) different toys \(T_0,\ldots\). Then,

no. of ways of selecting \(r\) toys out of \((n+1)\) different toys = no. of ways of selecting \((r-1)\) toys out of \(n\) toys when \(T_0\) is always included + no. of ways of selecting \(r\) toys when \(T_0\) is always excluded

\(={}^nC_{r-1}+{}^nC_r\)

Hence, \({}^{n+1}C_r={}^nC_{r-1}+{}^nC_r\).

Teacher's Note: Split selections by whether a fixed toy is included or excluded.

Exam Note: Pascal's rule by case split.

Question 2. Prove that \((n!)!\) is divisible by \((n!)^{(n-1)!}\).

Solution.

Now, \((n!)!\) is the product of the positive integers from 1 to \(n!\). We write the integers from 1 to \(n!\) in \((n-1)!\) rows as follows:

\(1\times2\times3\cdots n\)

\((n+1)(n+2)(n+3)\cdots(2n)\)

\((2n+1)(2n+2)\cdots(3n)\)

\((3n+1)(3n+2)\cdots(4n)\)

\(\vdots\)

\((n!-n+1)(n!-n+2)\cdots(n(n-1)!)\)

Each of these \((n-1)!\) rows contain \(n\) consecutive positive integers. The product of consecutive integers in each row is divisible by \(n!\). Thus, the product of all the integers from 1 to \(n!\) is divisible by \((n!)^{(n-1)!}\).

Teacher's Note: Split 1..n! into (n-1)! rows of n consecutive numbers; each row's product is divisible by n!.

Exam Note: Product of n consecutive integers is divisible by n!.

Question 3. If \(n_1\) and \(n_2\) are five-digit numbers, find the total number of ways of forming \(n_1\) and \(n_2\) so that these numbers can be added without carrying at any stage.

Solution.

\(n_1=x_1x_2x_3x_4x_5\), \(n_2=y_1y_2y_3y_4y_5\)

and \(n_1\) and \(n_2\) can be added without carrying at any stage if \(x_i+y_i\le 9\).

Value of \(x_5\)Value of \(y_5\)
00, 1, 2, ..., 9
10, 1, 2, ..., 8
20, 1, 2, ..., 7
30, 1, 2, 3, 4, 5, 6
40, 1, 2, 3, 4, 5
50, 1, 2, 3, 4
60, 1, 2, 3
70, 1, 2
80, 1
90

Thus, \(x_5\) and \(y_5\) can be selected collectively by \(10+9+8+\cdots+1=55\) ways. Similarly, each pair \((x_4,y_4),(x_3,y_3),(x_2,y_2)\) can be selected in 55 ways. But pair \((x_1,y_1)\) can be selected in \(1+2+3+\cdots+8=36\) ways as in this pair we cannot have 0 or 9.

Thus, total number of ways is \(36(55)^4\).

Teacher's Note: Count digit pairs with sum at most 9 per place; leading digits both nonzero.

Exam Note: No carry means digit sums stay at most 9.

Question 4. \(n_1\) and \(n_2\) are four-digit numbers. Find the total number of ways of forming \(n_1\) and \(n_2\) so that \(n_2\) can be subtracted from \(n_1\) without borrowing at any stage.

Solution.

\(n_1=x_1x_2x_3x_4\), \(n_2=y_1y_2y_3y_4\)

\(n_1\) and \(n_2\) can be subtracted without borrowing at any stage if \(x_i\ge y_i\).

Value of \(x_4\)Value of \(y_4\)
90, 1, 2, ..., 9
80, 1, 2, ..., 8
70, 1, 2, ..., 7
60, 1, 2, 3, 4, 5, 6
50, 1, 2, 3, 4, 5
40, 1, 2, 3, 4
30, 1, 2, 3
20, 1, 2
10, 1
00

Thus, \(x_4\) and \(y_4\) can be selected collectively by \(10+9+8+\cdots+1=55\) ways. Similarly, each pair \((x_3,y_3),(x_2,y_2)\) can be selected in 55 ways. But, pair \((x_1,y_1)\) can be selected in \(1+2+3+\cdots+9=45\) ways as in this pair we cannot have 0.

Thus, total number of ways is \(45(55)^3\).

Teacher's Note: Count digit pairs with top digit at least bottom digit; leading digits cannot be zero.

Exam Note: No borrow means each top digit is at least the bottom digit.

Question 5. How many five-digit numbers can be made having exactly two identical digits?

Solution.

Case I: Two identical digits are 0, 0.

The number of ways to select three more digits is \({}^9C_3\). The number of arrangements of these five digits is \(5!/2!-4!=36\).

Hence, the number of such numbers is

\({}^9C_3\times 36=3024\qquad(1)\)

Case II: Two identical digits are (1, 1) or (2, 2) or ... or (9, 9).

If 0 is included, then number of ways of selection of two more digits is \({}^8C_2\). The number of ways of arrangements of these five digits is \(5!/2!-4!/2!=48\). Therefore, number of such numbers is \({}^8C_2\times48\).

If 0 is not included, then selection of three more digits is \({}^8C_3\). Therefore, number of such numbers is \({}^8C_3\times5!/2!={}^8C_3\times60\). Hence, total number of five-digit numbers with identical digits (1, 1), ..., (9, 9) is

\(9\times({}^8C_2\times48+{}^8C_3\times60)=42336\qquad(2)\)

From Eqs. (1) and (2), the required number of numbers is \(3024+42336=45360\).

Teacher's Note: Split by whether the repeated digit is 0 or nonzero; count arrangements with a nonzero leading digit.

Exam Note: Leading digit cannot be zero.

Question 6. An ordinary cubical dice having six faces marked with alphabets A, B, C, D, E and F is thrown \(n\) times and the list of \(n\) alphabets showing up are noted. Find the total number of ways in which among the alphabets A, B, C, D, E and F only three of them appear in the list.

Solution.

Out of six faces, three can be selected in \({}^6C_3\) ways.

Consider one such selection, say ABC. Each of the \('n'\) places can be filled in three ways. So total number of ways is \(3^n\).

But this includes those ways also, which contain exactly one alphabet or exactly two alphabets which are to be subtracted.

Now, number of ways which contain only one letter is 3 and number of ways containing exactly two alphabets is \({}^3C_2(2^n-2)\).

Hence, the number of ways is \(3^n-{}^3C_2(2^n-2)-3\). So, required number of ways is \({}^6C_3[3^n-{}^3C_2(2^n-2)-3]\).

Teacher's Note: Choose the three letters, count onto lists by subtracting those using only one or two letters.

Exam Note: Surjections via inclusion-exclusion.

Question 7. Find the number of three-digit numbers from 100 to 999 including all numbers which have any one digit that is the average of the other two.

Solution.

One of the digitsPatternNumber of numbers
1102, 1114+1=5
2240, 231, 2224+6+1=11
3306, 315, 324, 3334+6+6+1=17
4408, 417, 426, 435, 4444+6+6+6+1=23
5519, 528, 537, 546, 5556+6+6+6+1=25
6639, 648, 657, 6666+6+6+1=19
7759, 768, 7776+6+1=13
8879, 8886+1=7
99991
Total121
Alternative solution: Consider two sets.

(1) 1, 3, 5, 7, 9

(2) 0, 2, 4, 6, 8

The required number of ways = [any two from set (1) + any two from set (2) (excluding zero)] \(3!\) + [0 along with any one from set (2)] \(\times4\) + all three alike

\(=({}^5C_2+{}^4C_2)\times3!+{}^4C_1\,4+9\)

\(=121\)

Teacher's Note: List digit patterns where one digit is the mean of the other two; count arrangements.

Exam Note: Pattern: a, mean, b with equal parity.

Question 8. The members of a chess club took part in a round robin competition in which each player plays with other once. All members scored the same number of points, except four juniors whose total score were 17.5. How many members were there in the club? Assume that for each win a player scores 1 point: 1/2 for draw point and zero for losing.

Solution.

Let the number of members be \(n\). Total number of points is \({}^nC_2\).

Therefore, \({}^nC_2-17.5=(n-4)x\) (where \(x\) is the number of point scored by each player)

\(\Rightarrow n(n-1)-35=2(n-4)x\)

\(\Rightarrow 2x=\dfrac{n(n-1)-35}{n-4}\) (where \(x\) takes the values 0.5, 1, 1.5, etc.)

\(=\dfrac{n^2-n-35}{n-4}=\dfrac{n(n-4)+3(n-4)-23}{n-4}=(n+3)-\dfrac{23}{n-4}\)

\(\Rightarrow\dfrac{23}{n-4}\) must be an integer

\(\Rightarrow n=27\)

Teacher's Note: Total points nC2; equal scores of others give an integer condition on 23/(n-4).

Exam Note: Divisibility of 23 fixes n.

Question 9. There are \(2n\) guests at a dinner party. Supposing that the master and mistress of the house have fixed seats opposite one another and that there are two specified guests who must not be placed next to one another, show that the number of ways in which the company can be placed is \((2n-2)!\times(4n^2-6n+4)\).

Solution.

Excluding the two specified guests, \(2n-2\) persons can be divided into two groups one containing \(n\) and the other containing \(n-2\) in \((2n-2)!/[n!(n-2)!]\) ways and can sit on either side of master and mistress in 2! ways and can arrange themselves in \(n!\,(n-2)!\). Now, the two specified guests where \(n-2\) guests are seated will have \(n-1\) gaps and can arrange themselves in 2! ways. The number of ways when \(G_1G_2\) will always be together is

\(\dfrac{(2n-2)!}{n!\,(n-2)!}\,2!\,n!\,(n-2)!\,(n-1)\times2!=(2n-2)!\,4(n-1)\)

Hence, the number of ways when \(G_1G_2\) are never together is

\((2n)!-4(n-1)(2n-2)!=(2n-2)!\,[2n(2n-1)-4(n-1)]=(2n-2)!\,[4n^2-6n+4]\)

Teacher's Note: Count arrangements with the two guests together, subtract from all (2n)! seatings.

Exam Note: Never together: total minus together.

Question 10. In how many ways can two distinct subsets of the set \(A\) of \(k\ (k\ge2)\) elements be selected so that they have exactly two common elements?

Solution.

Let the two subsets be called \(A\) and \(B\). The elements for the two sets will be selected as follows.

First, two elements out of \(k\) elements for both the sets can be selected in \({}^kC_2\) ways. Now, remaining \(r\) elements for the subset \(A\) are selected from \(k-2\) elements and any number of elements for \(B\) from the remaining \(k-2-r\) elements.

Here \(r\) can vary from 0 to \(k-2\). For a fixed \(r\), the number of selections is \({}^{k-2}C_r\times2^{k-2-r}\), because the number of selections of any number of things from \(n\) things is \(2^n\). Then, the total number of selections is

\(\sum_{r=0}^{k-2}{}^{k-2}C_r\times2^{k-2-r}-1\), excluding the case when both the subsets are equal having only the two common elements.

But, every pair of \(A,B\) is appearing twice like \(\{a_1,a_2,a_3\},\{a_1,a_2,a_4,a_5,a_6\}\) and \(\{a_1,a_2,a_4,a_5,a_6\},\{a_1,a_2,a_3\}\). Hence, the required number of ways is

\(\dfrac12\times{}^kC_2\left(\sum_{r=0}^{k-2}{}^{k-2}C_r\times2^{k-2-r}-1\right)=\dfrac{k(k-1)}{2}\times\dfrac12\times[(2+1)^{k-2}-1]=\dfrac{k(k-1)}{4}(3^{k-2}-1)\)

Teacher's Note: Choose the two common elements, assign others to A, B or neither, remove equal case, halve for unordered pairs.

Exam Note: Each remaining element has 3 states.

Question 11. Prove that the number of ways to select \(n\) objects from \(3n\) objects of which \(n\) are identical and the rest are different is

\(2^{2n-1}+\dfrac12\cdot\dfrac{2n!}{(n!)^2}\)

Solution.

The number of selections of \(r\) objects from \(n\) identical objects and \(n-r\) objects from \(2n\) different objects is \(1\times{}^{2n}C_{n-r}={}^{2n}C_{n-r}\).

Here \(r\) varies from 0 to \(n\). Therefore, the required number of selections is

\(\sum_{r=0}^{n}{}^{2n}C_{n-r}={}^{2n}C_n+{}^{2n}C_{n-1}+{}^{2n}C_{n-2}+\cdots+{}^{2n}C_0\)

\(={}^{2n}C_0+{}^{2n}C_1+{}^{2n}C_2+\cdots+{}^{2n}C_n\) (writing in reverse order)

\(=\dfrac12\{2\cdot{}^{2n}C_0+2\cdot{}^{2n}C_1+2\cdot{}^{2n}C_2+\cdots+2\cdot{}^{2n}C_n\}\)

\(=\dfrac12\{({}^{2n}C_0+{}^{2n}C_{2n})+({}^{2n}C_1+{}^{2n}C_{2n-1})+\cdots+({}^{2n}C_{n-1}+{}^{2n}C_{n+1})+2\cdot{}^{2n}C_n\}\)

\(=\dfrac12\{{}^{2n}C_0+{}^{2n}C_1+{}^{2n}C_2+{}^{2n}C_3+\cdots+{}^{2n}C_{2n}+{}^{2n}C_n\}\)

\(=\dfrac12\{2^{2n}+{}^{2n}C_n\}\)

\(=2^{2n-1}+\dfrac12\cdot\dfrac{2n!}{(n!)^2}\)

Teacher's Note: Count selections by r identical objects taken, then sum binomials using symmetry.

Exam Note: Use symmetry of binomial coefficients.

Question 12. There are \(n\) straight lines in a plane, in which no two are parallel and no three pass through the same point. Their points of intersection are joined. Show that the number of fresh lines thus introduced is

\(\dfrac18\,n(n-1)(n-2)(n-3)\)

Solution.

Since no two lines are parallel and no three pass through the same point, their points of intersection, i.e., number of ways of selecting two lines from \(n\) lines is \({}^nC_2=N\) (say). It should also be noted that on each line there will be \((n-1)\) points of intersection made by the remaining \((n-1)\) lines.

Now we have to find number of new lines formed by these points of intersections. Clearly, a straight line is formed by joining two points so the problem is equivalent to select two points from \(N\) points. But each old line repeats itself \({}^{(n-1)}C_2\) times [selection of two points from \((n-1)\) points on this line]. Hence, the required number of new lines is

\({}^NC_2-n\cdot{}^{(n-1)}C_2=\dfrac12\times\dfrac12n(n-1)\left[\dfrac12n(n-1)-1\right]-\dfrac12n(n-1)(n-2)\)

\(=\dfrac18n(n-1)(n^2-n-2)-\dfrac12n(n-1)(n-2)\)

\(=\dfrac18n(n-1)[n^2-n-2-4n+8]\)

\(=\dfrac18n(n-1)(n-2)(n-3)\)

Teacher's Note: Join the nC2 intersection points pairwise, then remove the old lines counted nC(n-1,2) times each.

Exam Note: Subtract pairs lying on original lines.

Question 13. There are \(n\) points in a plane, in which no three are in a straight line except \('m'\) which are all in a straight line. Find the number of (a) different straight lines, (b) different triangles, (c) different quadrilaterals that can be formed with the given points as vertices.

Solution.

(a) A straight line can be formed by joining any two points. So number of straight lines (i.e., selection of two points from \(n\)) is \({}^nC_2\). But, selection of two points from \(m\) collinear points gives no extra line. Hence, number of distinct straight lines is

\({}^nC_2-({}^mC_2-1)=\dfrac12n(n-1)-\dfrac12m(m-1)+1\qquad(1)\)

(b) Formation of triangles is equivalent to selection of three points from \(n\) points. As \(m\) points are collinear, selection of three points from \(m\) collinear points gives no triangles. Hence, the number of triangles is

\({}^nC_3-{}^mC_3=\dfrac16[n(n-1)(n-2)-m(m-1)(m-2)]\)

(c) Four points determine a quadrilateral. But of these four points, not more than two is to be selected from the four collinear points. Now, number of selections of four points from all \(n\) is \({}^nC_4\). The number of selections of three points from \(m\) collinear and one from rest is \({}^mC_3\times{}^{(n-m)}C_1\). The number of selections of four points from \(m\) collinear \(={}^mC_4\).

Hence, the number of quadrilaterals is \({}^nC_4-{}^mC_3\times{}^{(n-m)}C_1-{}^mC_4\).

Teacher's Note: Subtract collinear selections: lines gain back 1, triangles lose mC3, quadrilaterals lose bad cases.

Exam Note: Remove selections of three or more collinear points.

Question 14. Find the number of ways of disturbing \(n\) identical objects among \(n\) persons if at least \(n-3\) persons get none of these objects.

Solution.

The number of ways of distributing \(n\) identical things among \(n\) persons when at least \(n-3\) persons get none of these objects is \(A+B+C\) (suppose), where \(A\) is the number of ways when exactly \(n-3\) persons get none of these, i.e., \({}^{n-1}C_2\,{}^nC_3\); \(B\) is the number of ways when exactly \(n-2\) persons get none of these, i.e., \({}^{n-1}C_1\,{}^nC_2\); \(C\) is the number of ways when exactly \(n-1\) persons get none of these, i.e., \({}^nC_1\). Hence,

\(A+B+C={}^{n-1}C_2\,{}^nC_3+{}^{n-1}C_1\,{}^nC_2+{}^nC_1\)

\(=\dfrac{(n-1)(n-2)}{2}\cdot\dfrac{n(n-1)(n-2)}{6}+\dfrac{(n-1)n(n-1)}{2}+\dfrac n1\)

\(=\dfrac{n(n-1)^2}{2}\left[\dfrac{(n-2)^2}{6}+1\right]+n\)

\(=\dfrac{n(n-1)^2}{2}\left[\dfrac{n^2-4n+10}{6}\right]+n\)

Teacher's Note: Case on how many persons receive objects (3, 2 or 1) and count positive distributions.

Exam Note: Choose receivers, then each gets at least one.

Question 15. The streets of a city are arranged like the lines of a chessboard. There are \(m\) streets running from north to south and \(n\) streets from east to west. Find the number of ways in which a man can travel from north-west to south-east corner, covering the shortest possible distance.

Solution.

Let the city be represented by a rectangle whose sides are of length \(a\) and \(b\) north-south and west-east, respectively. Man has to go from \(P\) to \(Q\). For this, he will have to travel a distance \(a\) vertically downward and a distance \(b\) horizontally from left to right.

Let \(a_1,a_2,\ldots,a_{m-1}\) denote the distances between consecutive streets drawn horizontally beginning with the street passing through \(P\) and \(b_1,b_2,\ldots,b_{n-1}\) denote the distances between consecutive streets drawn vertically beginning with the street passing through \(P\).

Each arrangement of \((m+n-2)\) things \(a_1,a_2,\ldots,a_{m-1},b_1,b_2,\ldots,b_{n-1}\) in a row so that order of \(a_i\)'s does not change and order \(b_i\)'s does not change corresponds to one path to go from \(P\) to \(Q\).

Therefore, the required number is equal to number of arrangements of \(m+n-2\) things such that order of \(a_i\)'s does not change and order of \(b_i\)'s does not change, which is equal to \((m+n-2)!/((m-1)!\,(n-1)!)\).

Alternative solution: For each path total distance covered in horizontal direction is \(a\) and that in vertical direction is \(b\). Each path to go from \(P\) to \(Q\) will be an arrangement of \((m+n-2)\) line segments of which \((m-1)\) are horizontal and \((n-1)\) are vertical. Therefore, the required number is equal to number of arrangements of \(m+n-2\) different things of which \(m-1\) are of one kind and \(n-1\) are of another kind, which is given by \((m+n-2)!/((m-1)!\,(n-1)!)\).

Teacher's Note: Shortest path uses m-1 steps one way and n-1 the other; arrange them.

Exam Note: Lattice paths: choose positions of one step type.

Question 16. A batsman scores exactly a century by hitting fours and sixes in twenty consecutive balls. In how many different ways can he do it if some balls may not yield runs and the order of boundaries and overboundaries are taken into account?

Solution.

Let the batsman hit \(x\) fours, \(y\) sixes and let \(z\) balls may not yield runs. Then we have,

\(4x+6y+0z=100\qquad(1)\)

where

\(x+y+z=20\qquad(2)\)

From Eqs. (1) and (2),

\(4(20-y-z)+6y=100\)

\(\Rightarrow 2y-4z=20\)

\(\Rightarrow y-2z=10\)

\(\Rightarrow y=10+2z\)

Hence, \(z\) can be 0, 1, 2, 3 as any of \(x,y,z\) cannot exceed 20. So, we have following type of distribution of runs:

Number of fours, \(x\)Number of sixes, \(y\)Number of zeros, \(z\)Number of ways of arranging \(x,y\) and \(z\)
10100\(\frac{20!}{10!\,10!}\)
7121\(\frac{20!}{7!\,12!}\)
4142\(\frac{20!}{4!\,14!\,2!}\)
1163\(\frac{20!}{16!\,3!}\)

Hence, the total number of ways is

\(20!\left(\dfrac1{16!\,3!}+\dfrac1{14!\,4!\,2!}+\dfrac1{12!\,7!}+\dfrac1{10!\,10!}\right)\)

Teacher's Note: Solve 4x+6y=100 with x+y+z=20; arrange fours, sixes and blanks in each case.

Exam Note: Case on zero-run balls z = 0 to 3.

Question 17. In how many ways can \(2t+1\) identical balls be placed in three distinct boxes so that any two boxes together will contain more balls than the third?

Solution.

The total number of ways to place the balls disregarding the constraints is \({}^{2t+1+3-1}C_{3-1}={}^{2t+3}C_2\).

The total number of ways to place the balls so that the first box will have more balls than the other two is \({}^{t+3-1}C_{3-1}={}^{t+2}C_2\).

[We place \(t+1\) balls in the first box and then divide the rest of \(t\) balls in the three boxes arbitrarily.]

The same result applies to the case of 2nd box holding more balls than 1st or 3rd combined and also for the 3rd box containing more balls than 1st and 2nd combined. Hence, required number of ways is

\({}^{2t+3}C_2-3\,{}^{t+2}C_2=\dfrac t2(t+1)\)

Teacher's Note: Subtract the three cases where one box holds more than the other two together.

Exam Note: Complement of one box being too large.

Question 18. Sohan has \(x\) children by his first wife. Geeta has \((x+1)\) children by her first husband. They marry and have children of their own. The whole family has 24 children. Assuming that two children of the same parents do not fight, prove that the maximum possible number of fights that can take place is 191.

Solution.

The whole family has 24 children. Children of Geeta and Sohan are \(24-x-(x+1)=23-2x\) in number. When Sohan's child fights with a Geeta's child, there are \(x(x+1)\) fights. When Sohan's child fights with Sohan and Geeta's children, there are \(x(23-2x)\) fights. Again, when Geeta's child fights with Sohan and Geeta's children, there are \((x+1)(23-2x)\) fights. Therefore, total number of fights is

\(F(x)=x(x+1)+x(23-2x)+(x+1)(23-2x)\)

\(=23+45x-3x^2\)

\(=3\left[\dfrac{23}{3}+\dfrac{225}{4}-\left(x-\dfrac{15}{2}\right)^2\right]\)

For \(F(x)\) to be maximum,

\(x-\dfrac{15}{2}=0,\ \text{i.e.,}\ x=7.5\)

Since \(x\) is an integer, therefore, \(x=7\) or 8. For both \(x=7\) and \(x=8\). Total number of fights is \(F(x)=191\).

Teacher's Note: Count cross-family fights as a quadratic in x and maximise at integer x near 7.5.

Exam Note: Quadratic maximum at nearest integers.

Question 19. Let \(S(n)\) denote the number of ordered pairs \((x,y)\) satisfying \(1/x+1/y=1/n\) where \(n>1\) and \(x,y,n\in N\).

(i) Find the value of \(S(6)\).

(ii) Show that if \(n\) is prime, then \(S(n)=3\) always.

Solution.

Given,

\(nx+ny=xy\)

\(\Rightarrow xy-nx-ny+n^2=n^2\)

\(\Rightarrow (x-n)(y-n)=n^2\)

Hence, \((x-n)\) and \((y-n)\) are two integral factors of \(n^2\). Obviously, if \(d\) is one divisor of \(n^2\), then for each sub-divisor there will be an ordered pair \((x,y)\). Let \(S(n)\) be the number of divisors of \(n^2\).

(i) For \(n=6\), we have \(d=1,2,3,6,9,12,18,36\). \(\therefore\ S(6)=9\)

(ii) If \(n\) is prime, then \(d=1,n\) and \(n^2\); hence \(S(n)=3\).

Teacher's Note: Rewrite as (x-n)(y-n)=n^2 and count divisors of n^2.

Exam Note: Pairs correspond to divisors of n^2.

Question 20. Six apples and six mangoes are to be distributed among ten boys so that each boy receives at least one fruit. Find the number of ways in which the fruits can be distributed.

Solution.

Twelve fruits go to ten boys with each boy getting at least one, so either nine boys get one fruit each and one boy gets three fruits, or eight boys get one fruit each and two boys get two fruits each.

(Case of one boy getting three fruits: the number of ways comes to 4200.)

Case of two boys getting two fruits each: \(({}^{10}C_2)\,[2({}^8C_2)+4({}^8C_3)+3({}^8C_4)]\)

\(=\dfrac{10!}{2!\,8!}\left[2\dfrac{8!}{2!\,6!}+4\dfrac{8!}{3!\,5!}+3\times\dfrac{8!}{4!\,4!}\right]\)

\(=\dfrac{10!}{2!\,6!}\left[14+\dfrac{15}{4}\right]=22050\)

Hence, the required number of ways is \(4200+22050=26250\).

Teacher's Note: Split into one boy with three fruits, or two boys with two fruits each.

Exam Note: Case split on how the 12 fruits are shared.

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

Chapter-wise Cengage G Tewani Solutions: Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Subjective Type

Access the complete chapter-wise PDF for Cengage G Tewani Solutions Algebra Chapter 5 Permutation Combination Subjective Type. 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

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

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.