# 70. .Permutations and Combinations Solutions Part 5

Let the \(n\) letters be denoted by \(1,2,3,4,\ldots,n\).

Let \(A_i\) denote the set of distribution of letters in envelops(one letter in each envelope) so that only:math:i th letter is put in the corresponding envelope.

Then \(n(A_i) = 1\times (n-1)!\) for every \(i\)) letters leaving the \(i\) th letter can be put in remaining (\(n - 1\)) envelopes in \((n-1)!\) ways.)

Similarly, \(n(A_i\cap A_j) = 1\times 1\times (n-2)! = (n-2)!\)

\(n(A_i\cap A_j\cap A_k) = (n-3)!\) etc.

Required number \(= n(A_1^\prime \cap A_2^\prime\cap\ldots\cap A_n^\prime)\)

\(=n(A_1\cup A_2\cap\ldots\cup A_n)^\prime\)

\(= n! - n(A_1\cup A_2\cup\ldots\cup A_n)\)

\(= n! \left[\sum n(A_i) - \sum n(A_i\cap A_j+ \sum n(A_i\cap A_j\cap A_k) - \ldots + (-1)^{n-1}n(A_1\cap A_2\cap \ldots\cap A_n))\right]\)

\(= n! \left[{}^nC_1(n-1)! -{}^nC_2(n-2)! + \ldots+(-1^{n-1}) {}^{n-1}C_{n-1}\right]\)

\(=n!\left(\frac{1}{2!}-\frac{1}{3!}+\ldots+(-1)^n\frac{1}{n!}\right)\)

Number of non-congruent square size \(1\times 1, 2\times 2, \ldots, 8\times 8\) is each \(1\)

\(\therefore\) number of non-congruent squares \(= 8\)

Number of non-congruent squares \(= 8\)

Number of non-congruent rectangles which are not squares(here rectangle may be of size \(m\times n\), where \(m\neq n\) and \(m = 1, 2, 3, \ldots, 8, n=1, 2, 3, \ldots, 8\))

\(= {}^8C_2 = 28\)

\(\therefore\) Required number \(= 28 + 8 = 36\)

Given numbers are \(1, 2, 3, \ldots, n\)

Let the three selected numbers in A.P. are \(a,b,c\), then

\(2b = a + c\)

Clearly, \(a + c\) should be an even integer. This is possible only when both \(a\) and \(c\) are odd or both are even.

**Case I:**When \(n\) is even. Let \(n = 2m\)Number of odd numbers \(= m\)

Number of even numbers \(= m\)

No. of ways of choosing \(a\) and \(c\) are \(=2.{}^mC_2\)

\(= \frac{n(n - 2)}{4}\)

**Case II:**When \(n\) is odd. Let \(n = 2m + 1\)Number of odd numbers \(= m + 1\)

Number of even numbers \(= m\)

Required number \(= {}^{m+1}C_2 + {}^mC_2 = \frac{1}{4}(n - 1)^2\)

Since there are two packs of \(52\) playing cards, thereffore, number of cards of the same suit and same denomination will be \(2\) for each denomination.

Number of ways of selecting \(26\) cards out of \(52\) \(= {}^{52}C_{26}\)

But card of any denomination of a particualr suit can be selected in \(2\) ways.

\(\therefore\) Desired answer \(= {}^{52}C_{26}\)

Total no. of vertices of the polygon \(= n(n > 5)\)

Total no. of selection of \(3\) vertices out of \(n = {}^nC_3\)

Since each selection of \(3\) vertices gives one triangle, total no. of triangles formed \(= {}^nC_3 = \frac{n(n - 1)(n - 2)}{6}\)

Number of triangles formed having two sides commin with the sides of a polygon = numbers of selections of \(3\) consecutive vertices of the polygon \(= n\)

Number of triangled formed having exactly one side common with the sides of the polygon \(=\) number of selection of \(3\) vertices out of which only two are consecutive \(= n.{}^{n-4}C_1 = n(n - 4)\)

\(\therefore\) Required no. of triangles \(={}^nC_4 - n(n - 4)\)

\(= \frac{n}{6}(n - 4)(n - 5)\)

Let us solve these one by one:

If \(n\) objects are \(a_1, a_2, \ldots, a_n\) then possible selection will be \(a_1a_2a_3, a_2a_3a_4, \ldots,a_{n-2}a_{n-1}a_n\)

\(\therefore\) Required number \(= n - 3 + 1 = n - 2\)

Total no. of selections of \(3\) objects when there is no restrictions \(={}^nC_3\)

Number of selection of \(3\) objects which are consecutive \(= n - 2\)

\(\therefore\) Required number \(= ^nC_3 - n + 2\)

**Case I:**When \(n\) is even.Number of ways of selecting \(3\) points from \(\frac{n}{2}\) points which are not consecutive for odd positions \(= {}^{\frac{n}{2}}C_3\)

Same is the number of ways for even positions.

Thus, total no. of ways \(=2.{}^{\frac{n}{2}}C_3\)

**Case II:**When \(n\) is odd.Number of ways of selecting \(3\) points from \(\frac{n+1}{2}\) odd positions \(={}^\frac{n+1}{2}C_3\)

Number of wyas of selecting \(3\) points from \(\frac{n-1}{2}\) even positions \(={}^\frac{n - 1}{2}C_3\)

Sum of all these is the desired anwer.

Let \(S_1, S_2, S_3, S_4\) be the four intermediate stations where the train stops.

\(a~S_1~b~S_2~c~S_3~d~S_4~e\)

Let \(a, b, c, d, e\) be the number of stations between \(A\) and \(S_1\), \(S_1\) and \(S_2\), \(S_2\) and \(S_3\), \(S_3\) and \(S_4\) and \(S_4\) and \(B\) respectively.

Then, \(a + b + c + d + e = 8\) where \(a\geq 0, b\geq 1, c\geq 1, d\geq 1, e\geq 0\)

Let \(x = a, y = b - 1, z =c - 1, t = d - 1, w = e\)

Now, \(x + y + z + t + w = a + b + c + d + e - 3\)

\(= 8 - 3 = 5\)

\(\therefore\) Required number = Number of non-negative integral solutions of previous equality \(={}^{n + r - 1}C_1 ={}^9C_5 = 126\)

Total number of points in the plane \(= m\)

Number of straight lines formed by these \(m\) points \(={}^mC_2 = n\) (say)

If each pair of these \(n\) lines intersect at different points, then total number of points of intersection of these \(n\).

Number of lines passing through \(A_1 = m - 1\)

Each pair of these \(m - 1\) lines intersect at \(A_1\) and that too is not to be counted.

Number of pair of lines intersecting at \(A_1 ={}^{m - 1}C_2\)

Similar will be the case for lines meeting at \(A_2, A_3, \ldots, A_m\)

Hence required number of points of intersection \(={}nC_2 - ({}^{m - 1}C_2 + {}^{m - 1}C_2 + \ldots ~\text{to}~m~\text{terms})\)

\(={}^nC_2 - m.{}^{m-1}C_2 = \frac{m(m - 1)}{8}(m^2 - 5m + 6)\)

\(= \frac{1}{8}\frac{m!}({m - 4)!}\)

The word BAC cannot be spelt if the \(m\) selected coupons do not contain at least one of \(A, B\) and \(C\).

Number of ways of selecting \(m\) coupons which are \(A\) or \(B = 2^m\)

This also includes the case when all the \(m\) coupons are either \(A\) or all are \(B\).

Number of ways of selecting \(m\) coupons which are \(B\) or \(C = 2^m\)

This also includes the case when all the \(m\) coupons are either \(B\) or all are \(C\).

Number of ways of selecting \(m\) coupons which are \(A\) or \(C = 2^m\)

This also includes the case when all the \(m\) coupons are either \(A\) or all are \(C\).

Number of ways of selecting \(m\) coupons when all are \(A = 1\)

Number of ways of selecting \(m\) coupons when all are \(B = 1\)

Number of ways of selecting \(m\) coupons when all are \(C = 1\)

\(\therefore\) Required answer \(= 3.(2^m - 1)\)

Number of types of cards(number of suits) \(= 4\) (Heart, Club, Spade and Diamond)

Number of consecutive cards in each suit \(= 13\)

Number of ways of selecting \(5\) consecutive cards from out of \(13\) from one suit \(= n - r + 1 = 13 - 5 + 1 = 9\)

But one card of any denomination can be selected from any one of the \(4\) suits in \(4\) ways.

\(\therefore~5\) cards of five different denominations can be selected from \(4\) suits in \(4^5\) ways.

\(\therefore\) Required numbers \(= 9\times 4^5 = 9216\)

Number of ways of selecting \(5\) consecutive cards \(=9216\)

Number of ways of selecting \(5\) consecutive cards from one suit \(= 9\)

\(\therefore\) Number of ways of selecting \(5\) cards from the same suit \(= 9\times 4 = 36\)

\(\therefore\) Required number \(= 9216 - 36 = 9180\)

Let \(A = {a_1, a_2,\ldots, a_n}\)

For element \(a_1\) and one subset \(P_1\) there are two possibilities(i) \(a_1\in P_1\) (ii) \(a_1\notin P_1\)

\(\therefore\) Total number of ways for one element \(a_1\) and \(m\) subsets \(= P_1.P_2.\ldots .P_m = 2^m\)

Number of ways in which \(a_1\) belongs to all \(m\) subsets \(= 1^m\)

Number of ways in which \(a_1\) does not belong to all \(m\) subsets \(= 1^m\)

Number of ways in which \(a_1\in(P_1\cap P_2\cap\ldots\cap P_m)=1^m\)

Number of ways in which \(a_1\notin(P_1\cap P_2\cap\ldots\cap P_m)=2^m - 1^m\)

Numer of ways in which \(a_1\notin(P_1\cup P_2\cup\ldots\cup P_m) = 1^m\)

Numer of ways in which one element \(a_1\in(P_1\cup P_2\cup\ldots\cup P_m) = 2^m - 1^m\)

Here exactly \(r\) elements of \(A\) belongs to \(P_1\cup P_2\cup\ldots P_m\)

\(\therefore\) Required number \(={}^nC_r(2^m - 1^m)^r.(1^m)^{n - r}\)

Here \(P_1\cap P_2\cap\ldots \cap P_m\) contains exactly \(r\) elements means \(r\) elements belong to \(P_1\cap P_2\cap \ldots \cap P_m\) and \(n - r\) elements do not belong to \(P_1\cap P_2\cap\ldots \cap P_m\)

Required number \(={}^nC_r(1^m)^r(2^m - 1^m)^{n - r}\)

Let \(P_{m+1} = A - (P_1\cup P_2\cup\ldots \cup P_m)\)

Since \(P_i\cap P_j = \phi, i\neq j,\) where \(i, j = 1, 2, 3, \ldots, m\)

Each element of \(A\) should belong to exactly one of the \((m + 1)\) subsets.

For element of \(a_1\) of \(A,\) number of ways \(= m+1\)

For element of \(a_2\) of \(A,\) number of ways \(= m+1\)

\(\ldots\)

For element of \(a_n\) of \(A,\) number of ways \(= m+1\)

Desired answer \(= (m + 1)^n\)

Number of boxes \(= 2m,\) number of identical balls \(= m\)

Number of selections of \(m\) boxes out of \(2m ={}^{2m}C_m\)

Since \(m\) balls are identical, thus, they can be arranged among themselves in \(\frac{m!}{m!}\)

\(\therefore\) Required number \(={}^{2m}C_m = \frac{2m!}{m!m!}\)

We will show by induction that \(\frac{4^m}{2\sqrt{n}}\leq \frac{2m!}{(m!)^2}\geq \frac{4^m}{\sqrt{m + 1}}\)

Let \(P(m): \frac{4^m}{2\sqrt{m}}\leq \frac{2m!}{(m!)^2}\)

When \(m = 1\) L. H. S. \(= \frac{4}{2} = 2\) and R. H. S. \(= \frac{2}{1^2} = 2\)

Let \(P(k)\) be true.

To prove \(P(k+1)\) to be true i.e. \(\frac{4^{k+1}}{2\sqrt{k + 1}}\leq \frac{(2k + 2)!}{(k + 1)!^2} = \alpha\) (say)

Multiplying both sides by \(\frac{(2k+1)(2k+2)}{(k + 1)^2}\) we get

\(\frac{2(2k + 1)4^k}{2\sqrt{k}(k + 1)}\leq \frac{(2k + 2)!}{(k+1)!^2}\)

Now \(\frac{\beta}{\alpha} = \frac{(2k + 1)4^k}{\sqrt{k}(k + 1)}.\frac{2\sqrt{k + 1}}{4^{k + 1}}\)

\(= \frac{\sqrt{4k^2 + 4k + 1}}{\sqrt{4k^2 + 4k}} >1\)

Thus, \(P(k + 1)\) is true if \(P(k)\) is true.

Second part is left as an exercise.

Number of selections with \(1\) lady and \(4\) gentlemen \(={}^4C_1.{}^6C_4 = 60\)

Number of selections with \(2\) ladies and \(3\) gentlemen \(=({}^4C_2 -{}^2C_0).{}^6C_3= 100\)

Number of selections with \(3\) ladies and \(2\) gentlemen \(=({}^4C_3 -{}^2C_1).{}^6C_2= 30\)

\(\therefore\) Reuired number \(= 60 + 100 + 30 = 190\)

Problem 214 has been left as an exercise.

To get one point of intersection as desired in the question we need two points on the first line and two points in the second line. Now two points on the first line can be selected out of \(m\) points in \(^mC_2\) ways. Again, two points on the second line out of \(n\) points in \(^nC_2\) ways.

One such selection of \(4\) points two on one line and two on the other gives one point of intersection.

\(\therefore\) Desired answer \(={}^mC_2.{}^nC_2 = \frac{1}{4} mn(m - 1)(n - 1)\)

Let \(y\) be the children after John and Mary marry.

Then \(x + x + 1 + y = 24\) or \(2x + y = 23\)

Let \(z\) be the number of fights then

\(z ={}^xC_1.{}^yC_1 +{}^xC_1.{}^{x + 1}C_1 +{}^yC_1.{}^{x + 1}C_1\)

\(= xy + x(x + 1) + y(y + 1)\)

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

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

Since \(x\) is real \(\therefore 45^2 - 12(z - 23)\geq 0\)

\(z\leq \frac{2301}{12} = 191.75\)

Therefore, number of fights possible \(= 191\)

\(2520 = 2^3.3^2.5.7\)

Each term of the product \((1 + 2 + 2^2 + 2^3)\)\((1 + 3 + 3^2)\) \((1+5)(1+7)\) is a divisor of \(2520\)

\(\therefore\) Number of divisors \(= 48\)

Sum of divisors \((1 + 2 + 2^2 + 2^3)(1 + 3 + 3^2)(1 + 5)(1 + 7)\)

\(= 9360\)

Set of three positive integers whose sum is \(5\) are \(\{3, 1, 1\}, \{2, 2, 1\}\)

Elements of 1st set can be arranged in \(\frac{3!}{2!}\) ways.

Elements of 2nd set can be arranged in \(\frac{3!}{2!}\) ways.

\(\therefore\) Required number \(= \frac{3!}{2!}{}^5C_3.{}^2C_1. {}^1C_1 + \frac{3!}{2!}.{}^5C_2.{}3^C_2.{}^1C_1 = 60 + 90 =150\)

Let \(m = (n - 1)!\), then \(n! = mn\)

\(\frac{(n!)!}{(n!)^{(n-1)!}} = \frac{(mn)!}{(n!)^m}\)

\(=\) number of ways in which \(mn\) different things can be distributed among \(m\) persons when each person gets \(n\) things

\(=\) an integer

\(\frac{(ab)!}{a!(b!)^a} =\) number of ways of dividing \(ab\) different things in \(a\) sets each having \(b\) things

\(=\) an integer

Let \(a, b, c, d, e, f, g\) be the number of persons entering through the doors \(A, B, C, D, E, F, G\) respectively.

Then, \(a + b + c + d + e + f + g = 200\)

Number of ways of divigin \(200\) persons in \(7\) parts

\(={}^{n + r - 1}C_r ={}^{206}C_6\)

Number of ways of dividing \(200\) persons in \(7\) sets conatining \(a, b, c, d, e, f, g\) persons respectively \(= \frac{200!}{a!b! c!d!e!f!g!}\)

Now \(a\) persons in the first set can be arranged among themselves in the list in \(a!\) ways.

Similarly, \(b, c, d, e, f, g\) persons can be arranged among themselves in \(b!, c!, d!, e!, f!, g!\) ways respectively.

\(\therefore\) Desired answer \(={}^{206}C_6.\frac{200!}{a!b!c!d! e!f!g!}.a!b!c!d!e!f!g!\)

\(={}^{206}C_6.(200)! ={}^{206}P_6\)

Let the four persons be given \(a, b, c, d\) things respectively, then

\(a + b + c + d = 16,\) where \(a, b, c, d \geq 3\)

Let \(x = a - 3, y = b - 3, z=c - 3, t = d - 3\)

Then \(x + y + z + t = a + b + c + d - 12 = 4, x,y,z,t\geq 0\)

\(\therefore\) Desired answer \(=\) number of ways of distributing \(4\) identical things among \(4\) persons where each person can get zero or more things

\(={}^{n + r - 1}C_r ={}^7C_4 = 35\)

Let the number of red, white, blue and green balls be \(x, y, z\) and \(w\) respectively, then \(x + y + z + w = 10,\) where \(x, y, z, w \geq 0\)

\(\therefore\) desired answer \(=\) number of non-negative integral solutions of above equations

\(=\) number of ways of distributing \(10\) identical things among \(4\) persons where each gets zero or more things

\(={}^{n + r - 1}C_r ={}^{13}C_{10} ={}^{13}C_3 = 286\)

When the selection has to contain balls of all colors \(x + y + z + w = 10,\) where \(x, y, z, w\geq 1\)

Let \(a = x - 1, b = y - 1, c = z - 1, d = w -1\)

Thus, \(a + b + c + d = 6\)

\(\therefore\) desired answer \(={}^{4 + 6 - 1}C_6 = 84\)

Number of ways in which each of the \(8\) questions can be allotted \(2\) marks out of \(30\) marks

\(= 1.1.1.1.1.1.1.1 = 1\)

Number of ways in which remaining \(14\) marks can be allotted to \(8\) questions where any question many be allotted zero or more marks \(={}^{n + r - 1}C_r ={}^{21}C_{14} = 116280\)

The candidate must score \(150\) marks.

\(\therefore\) desired answer \(=\) coeff. of \(x^{150}\) in \((1 + x + \ldots + x^{50})^3.(1 + x + \ldots + x^100)\)

\(=\) coeff. of \(x^{150}\) in \(\left(\frac{1 - x^{51}}{1 - x}\right)^3\frac{1 - x^{101}}{1 - x}\)

\(=\) coeff. of \(x^{150}\) in \((1 - 3x^{51} + 3x^{102} - x^{101})(1 - x)^{-4}\) [leaving terms conatining powers of \(x\) greater than \(150\) ]

\(={}^{153}C_{150} - 3.{}^{102}C_{99} + 3.{}^{51}C_48 -{}^{52}C_49\)

\(= 110556\)

Let \(y_1 = x_1 - 1, y_2 = x_2 - 1, \ldots, y_k = x_k - k\)

Then \(y_1, y_2, \ldots, y_k \geq 0\)

Also, as \(x_1 + x_2 + \ldots + x_k = n\)

\(y_1 + y_2 + \ldots +y_k = x_1 + x_2 + \ldots + x_k - (1 + 2 + \ldots + k)\)

\(= n - \frac{k(k + 1)}{2} = m\) (say)

\(\therefore\) Desired answer \(=\) number of non-negative integral solutions of the equation \(y_1 + y_2 + \ldots + y_k = m\)

\(={}^{k + m - 1}C_m\)

Given \(x + y + z + t = 29\) where \(x\geq 1, y\geq 2, z\geq 3, t\geq 0\)

Let \(p = x -1, q = y - 2, r = z - 3\)

\(p + q + r + t = 23\) where \(p, q, r, t\geq 0\)

\(\therefore\) Desired answer \(=\) number of ways in which \(23\) identical things can be distributed among \(4\) persons when each person can get any number of things

\(={}^{n + r - 1}C_r ={}^{4 + 23 - 1}C_{23} = 2600\)

**Case I:**When \(4t = 0,\) i.e. \(t = 0\)In this case, \(x + y + z = 20\)

Number of non-negative integral solutions \(={}^{n + r - 1}C_r = {}^{22}C_{20}\)

**Case II:**When \(t = 1\), number of non-negative integral solutions \(= {3 + 16 - 1}C_{16} ={}^{18}C_{}16\)**Case III:**When \(t = 2\), number of non-negative integral solutions \(={}^{14}C_{12}\)**Case IV:**When \(t = 3\), number of non-negative integral solutions \(={}^{10}C_8\)**Case V:**When \(t = 4\), number of non-negative integral solutions \(={}^6C_4\)**Case VI:**When \(t = 5\), number of non-negative integral solutions \(={}^2C_0\)Thus, desired answer \(= 536\)

Given \(x + y + z + u + t = 20\)

\(x + y + z = 5\)

thus, \(u + t = 15\)

Number of non-negative integral solutions of \(x + y + z = 5\) \(={}^{n + r - 1}C_r ={}^7C_5\)

Number of non-negative integral solutions of \(u + t = 15\) \(={}^{2 + 15 - 1}C_{15}\)

\(\therefore\) Required number \(={}^7C_5.{}^{16}C_15 = 336\)

Let \(w\) be a non-negative integer such that \(3x + y + z + w = 30\)

Let \(a = x - 1, b = y - 1, c = z - 1, d = w,\) then

\(3a + b + c + d = 30,\) where \(a, b, c, d\geq 0\)

Clearly, \(0\leq a\geq 8\). If \(a = k,\) then \(b + c + d = 25 - 3k\)

Number of non-negative integral solutions of above equation \(={}^{n + r - 1}C_k = \frac{3}{2}(3k^2 - 53k + 234)\)

\(\therefore\) Desired answer \(=\frac{3}{2}\sum_{k=0}^8(3k^2 - 53k + 234)\)

\(= 1215\)

Given \(a + b + c + d = 20, a, b, c, d\geq 1\)

Let \(a<b<c<d\)

Let \(x = a, y = b - a, z = c - b, t = d - c\)

\(a = x, b = y + x, c = x + y + z, d = x + y + z + t\)

\(4x + 3y + 2z + t = 20\)

Sum of minimum values of \(4x, 3y, 2z, t = 4 + 3 + 2 + 1 = 10\)

\(\therefore\) Required number \(=\) coeff. of \(x(20 - 10)\) in \((1 - x^4)^{-1}(1 - x^2)^{-1}(1 - x^2)^{-1}(1 - x)^{-1}\)

\(= 23\)

But \(a, b, c, d\) can be arranged in \(4!\) ways.

\(\therefore\) Desired answer \(= 23. 4! = 552\)

Any number between \(1\) and \(1000000\) must be of less than seven digits. Therefore, it must be of the form

\(a_1a_2a_3a_4a_5a_6,\) where \(a_1, a_2, a_3, a_4, a_5, a_6 \in {0, 1, 2,\ldots, 9}\)

Sum of digits \(= 18\)

i.e. \(a_1 + a_2 + a_3 + a_4 + a_5 + a_6 = 18\)

\(\therefore\) Desired answer \(=\) coeff. of \(x^{18}\) in \((1 + x + x^2+ \ldots + x^9)^6\)

\(= 25927\)

Desired answer \(=\) coeff. of \(x^n\) in \(\left[(1 + x + x^2 + \ldots + x^n)^2(1 + x)^n\right]\)

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

Number of ways in which one crew out of \(3\) can be arranged on the steering \(={}^3C_1\)

Since \(2\) particular persons are always to maintain on bow side therefore, \(2\) more persons for the bow side can be selected out of remaining \(6\) persons in \(^6C_2\) ways and \(4\) persons can be selected out of remaining \(4\) in \(^4C_4\) ways.

Now \(4\) persons on bow side and storke side can be arranged among themselves in \(4!\) ways.

\(\therefore\) Desired answer \(={}^3P_1.{}^6C_2.4!.4! = 25920\)

Total no. of letters \(= 11\)

E occurs thrice, N occurs thrice, D occurs twice. Different letters are I, N, D, E, P, T

**Case I:**When three letters are identical and remaining two are identical. Letters selected will bethree E’s and two N’s; number of selections \(= 1\)

three E’s and two D’s; number of selections \(=1\)

three N’s and two D’s; number of selections \(=1\)

three E’s and two E’s; number of selections \(=1\)

**Case II:**When three letters are identical and remaining two are different. Letters selected will bethree E’s and two out of I, N, D, P, T

three N’s and two out of I, E, D, P, T

Number of selections \(=1.{}^5C_2 + 1.{}^5C_2 = 20\)

**Case III:**When two letters are identical and are of one type, two are identical and are of second type and rest one is different. Letters selected will betwo E’s and two N’s and one out of I, D, P, T

two E’s and two D’s and one out of I, N, P, T

two N’s and two D’s and one out of I, E, P, T

Number of selections \(={}^4C_1 +{}^4C_1 +{}^4C_1 = 12\)

**Case IV:**When two letters are identical and remaining three are different. Letters selected will betwo E’s and three out of I, N, D, P,T

two N’s and three out of I, E, D, P, T

two D’s and three out of I, E, N, P, T

Number of selections in this case \(=3.{}^5C_3 = 30\)

**Case V:**When all \(5\) letter are different.Number of selections \(={}^6C_5 = 6\)

\(\therefore\) Desired answer \(= 4 + 20 + 12 + 30 + 6 = 72\)

**1st Part:**Here \(a\) occurs two limes, \(l\) occurs three times and three are three other different letters \(p, r, e\) we have to select \(4\) letters.\(\therefore\) Desire number \(=\) coeff. pf \(x^4\) in \(\left[(1 + x + x^2 + x^3)(1 + x + x^2)(1 + x^3)\right]\)

\(= 22\)

**2nd Part:**Required number \(=\) coeff. of \(x^4\) in \(4!\left(1 + \frac{x}{1!} + \frac{x^2}{2!}\right)\left(1 + \frac{x}{1!} + \frac{x^2}{2!} + \frac{x^3}{3!}\right)\left(1 + \frac{x}{1!}\right)^3\)\(= 286\)

\(\frac{^(n+4)P_4}{(n + 2)!}-\frac{143}{}4.n!\)

\(= \frac{(n+4)(n+3)}{n!} - \frac{143}{4.n!}\)

\(= \frac{1}{n!}\left[\frac{4(n + 4)(n + 3)- 143}{4}\right]\)

\(= \frac{1}{4.n!}\left[4n^2 + 28n - 95\right]\)

which is clearly less than \(0\) for \(n = 1, 2\)

\(\frac{195}{4.n!} - \frac{(n + 3)(n + 2)(n + 1)}{(n + 1)!}\)

\(\frac{1}{n!}\left[\frac{195}{4} - (n + 3)(n + 2)\right]\)

which is clearly greater than \(0\) for \(n = 1, 2, 3, 4\)

\(^{n-2}P_4:{}^{n+2}C_8 = 16:57\)

\(\frac{1}{(n + 2)(n + 1)n(n - 1)} = \frac{1}{21.20.19.18}\)

\(n = 19\)

\(^nP_r ={}^nP_{r + 1}\)

\(\Rightarrow n - r = 1\)

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

\(\Rightarrow r = n - r + 1\)

Solving these two we have \(n = 3, r = 2\)

Rest of the problems have been left as exercies.