# 62. Permutations and Combinations Solutions Part 1

Given, \(^nP_4 = 360 \therefore \frac{n!}{(n - 4)!} = 360\)

or, \(n(n - 1)(n - 2)(n - 3) = 360 = 6\times5\times4\times3\)

\(\therefore n = 6\)

Given, \(^nP_3 = 9240 \therefore \frac{n!}{(n - 3)!} = 9240\)

or, \(n(n - 1)(n - 2) = 9240 = 22\times21\times20\)

\(\therefore n = 22\)

Given, \(^{10}P_r = 720 \therefore \frac{10!}{(10 - r)!} = 720\)

\(10\times9\times8 = 720 \therefore r = 3\)

Given, \(^{2n + 1}P_{n - 1}:^{2n - 1}P_n = 3:5\)

\(\therefore \frac{(2n + 1)!}{(n + 2)!}.\frac{(n - 1)!}{(2n - 1)!} = \frac{3}{5}\)

\(\frac{2n(2n + 1)}{n(n + 1)(n + 2)} = \frac{3}{5}\)

\(3n^2 - 11n - 4 = 0\)

\(\therefore n = 4\)

\(t_n = n.^nP_n = n.n! = [n + 1 - 1]n! = (n + 1)n! - n! = (n + 1)! - n!\)

\(t_1 = 2! - 1!\)

\(t_2 = 3! - 2!\)

…

Adding, we get \(= (n + 1)! - 1! =\) R.H.S

Unit’s position can be filled in \(5\) ways, ten’s position can be filled in \(4\) ways and so on.

\(\therefore\) Total no. of numbers \(= 5\times 4\times 3\times 2\)

\(= 120\)

Hundred’s place can be filled by \(4, 5\) or \(6\) i.e. \(3\) ways. Remaining two places can be filled by \(^5P_2\) ways.

\(\therefore\) Total no. of numbers \(= 3\times ^5P_2\)

\(= 60\)

**Case I:**When the number is of three digits.Hundred’s place can be filled by \(3, 4\) or \(5\) i.e. \(3\) ways. Remaining two places can be filled by \(^5P_2\) ways.

\(\therefore\) Total no. of three digit numbers \(= 60\)

**Case II:**When the number is of four digits.Thousand’s place can be filled by \(1\) or \(2\) i.e. \(2\) ways. Remaining \(3\) positions can be filled by \(^5P_3\) ways i.e. \(120\) ways.

Total no. of numbers that can be formed \(= 60 + 120 = 180\)

**Case I:**When \(0\) occurs at unit’s place.Total no. of numbers \(= 1\times ^6P_3 = 120\)

**Case II:**When \(0\) does not occur at unit’s place.Unit’s place can be filled by \(3\) ways using \(2, 4\) or \(6\)

Thousand’s place can be filled by any of remaining numbers except \(0\) i.e. \(5\) ways.

Remaining \(2\) places can be filled in \(^5P_2\) ways.

\(\therefore\) Total no. of numbers \(= 5\times 3\times ^5P_2\)

\(= 300\)

\(\therefore\) Total no. of such four digit numbers \(= 120 + 300 =420\)

**Case I:**When \(2\) occurs at thousand’s place.Thousand’s place can be filled in one way and hundred’s place can be filled by \(3, 4, 5\) or \(6\). Remaining two places can be filled in \(^5P_2\) ways.

\(\therefore\) Total no. of numbers \(= 1\times 4\times ^5P_2\)

\(= 80\)

**Case II:**When anyone of \(3, 4, 5\) or \(6\) occurs at thousand’s place.Thousand’s place can be filled in \(4\) ways. Rest of three places can be filled in \(^6P_3\) ways.

No. of numbers formed in this case \(= 4\times ^6P_3 = 480\)

Combining both cases we have our desired answer as \(560\).

**Case I:**When number is of five digits.Ten Thousand’s place can be filled in \(4\) ways using \(1, 2, 3\) and \(4\). Rest of \(4\) places can be filled in \(^4P_4\) ways.

No. of numbers formed in this case \(= 4\times ^4P_4 = 96\)

**Case II:**When number is of four digits.Thousand’s place can be filled in \(4\) ways as in previous case. Rest of \(3\) places can be filled in \(^4P_3\) ways.

No. of numbers formed in this case \(= 4\times ^4P_3 = 96\)

**Case III:**When the number is of three digits.Hundred’s place can be filled in \(4\) ways as in previous case. Rest of \(2\) places can be filled in \(^4P_2\) ways.

No. of numbers formed in this case \(= 4\times ^4P_2 = 48\)

**Case IV:**When the number is of two digits.Ten’s place can be filled in \(4\) ways. Rest of places can be filled in \(^4P_1\) ways.

No. of numbers formed in this case \(= 4\times ^4P_1\) ways.

**Case V:**When the number is of one digit.No. of positive numbers found in this case \(= 4\)

Total no. of numbers formed \(= 96 + 96 + 48 + 16 + 4 = 260\)

Total no. of numbers formed \(= ^4P_4 = 24\)

When \(1\) occurs at unit’s place, total no. of numbers formed \(= 1\times ^3P_3 = 6\)

When \(1\) occurs at ten’s place, total no. of numbers formed \(= 1\times ^3P_3 = 6\)

Similarly when \(1\) will occur at hundred’s and thousand’s place and \(6\) numbers will be formed in each case.

\(\therefore\) Sum of the digits at unit’s, ten’s, hundred’s and thousand’s will be each \(6(1 + 2 + 3 + 4) = 60\)

\(\therefore\) Sum of the numbers formed \(= 60\times 1 + 60\times 10 + 60\times 100 + 60\times 1000 = 66660\)

Occurrence of zero at any place will not affect the sum of the digits at that place.

Number of numbers formed having \(1\) at unit’s, ten’s and hundred’s place \(= 12\). In each case thousand’s place can be filled in \(2\) ways using \(2\) and \(3\). Rest of two places can be filled in \(^2P_2\) ways. Thus, total no. of numbers \(= 3\times 2\times ^2P_2 = 12\)

Number of numbers formed when \(1\) is at thousand’s place \(= 1\times ^3P_3 = 6\)

Sum of digits at unit’s, ten’s and hundred’s place will be each \(= 4(1 + 2 + 3) = 24\)

Sum of digits at thousand’s place will be \(= 6(1 + 2 + 3) = 36\)

Thus, sum of all numbers \(= 24\times 1 + 24\times 10 + 24\times 100 + 36\times 1000 = 38664\)

This is similar to last two problems and has been left as an exercise.

Invitation cards can be sent to each of the six friends by any of the three servants in \(3\) ways.

Thus, our answer is \(3^6 = 729\)

Each prize can be given to any of buys in \(7\) different ways. Thus, total no. of ways in which prizes can be distributed \(= 7^3 = 343\).

Each of the \(5\) arms can have any one of the positions in \(4\) ways. But all the five arms can be at position of rest in only \(1\) ways.

Thus, total no. of signals that can be made \(= 4 \times 4\times 4 \times 4\times 4 - 1 = 1023\)

Total no. of possible arrangements \(= 10\times 10\times 10 = 1000\)

But one of these will be successful attempt so total no. of unsuccessful attempts that can be made \(= 1000 - 1 = 999\)

Thousand’s place can be filled in \(3\) ways using \(1, 2\) or \(3\). Rest of the places can be filled in \(5\) ways.

Thus, total no. of numbers \(= 3\times 5\times 5\times 5 = 375\)

Treating people of same nationality as one entity we have \(3!\) ways of seating them in a row.

However, \(8\) Indians can be seated in \(8!\) ways, \(4\) Americans can be seated in \(4!\) ways and \(4\) Englishmen can be seated in \(4!\) ways.

Thus, total no. of ways they can be seated together \(= 3!8!4!4!\)

Treating books of same volume as one book we have \(4 + 1 + 1 + 1\) i.e. \(7\) books which can be arranged in \(7!\) ways.

Following as previous problem total no. of ways in which these books can be put on self \(= 7!8!5!3!\)

Treating all copies of a book as one book we have \(5\) books which can be arranged in \(5!\) ways.

All copies being identical can be arranged only in \(1\) ways.

Thus, total no. of arrangements \(= 5! = 120\)

Total no. of permutations when there is no restriction \(= ^{10}P_{10}\) i.e. \(10!\).

Treating best and worst paper as one we have \(9!\) ways of arranging them. However, best of worst can be arranged in \(2!\) ways, making total no. of ways as \(2!9!\).

Thus, total no. of ways of in which these papers can be arranged \(= 10! - 9!2! = 8.9!\)

Total no. of permutations when there is no restriction \(= ^8P_8\) i.e. \(8!\) ways.

Treating three girls as one we have \(6!\) ways of seating them. However, three girls can be seated in \(3!\) ways among themselves. Thus, total no. of ways \(= 6!3!\)

Hence, required no. of ways of seating \(= 8! - 6!3!\)

Since there is no restriction on I.A. students, let us fix their positions.

x I.A. x I.A. x I.A. x I.A. x I.A. x I.A. x I.A. x

Here, ‘x’ indicated vacant positions which can be filled by I.Sc. students. Total no. of ways of seating I.A. students \(= 7!\) ways.

I.Sc. students can be seated in \(= ^8P_5\) ways as there are \(8\) vacant positions.

Thus, total no. of ways of seating them \(= 7!^8P_5\)

Following last two problems, total no. of seating them \(= 7!^8P_3\)

**Case I:**When a boy sits at the first place, possible arrangements areB G B G B G B G

Thus, no. of ways of seating them \(= 4!4!\)

**Case II:**When a girl sits at the first place, possible arrangements areG B G B G B G B

Again, no. of arrangements \(= 4!4!\)

Thus, total no. of arrangements \(= 4!4! + 4!4! = 1152\)

The only possible arrangement is B G B G B G B but boys can be arranged in \(4!\) ways and girls can be arranged in \(3!\) ways.

Thus, total no. of possible seating arrangements \(= 4!3! = 144\)

There are \(12\) letters in the word civilization out of which \(4\) letters are i.

Thus, total no. of arrangements \(= \frac{12!}{4!}\)

But one word is civilization itself. Thus, total no. of rearrangements are \(= \frac{12!}{4!} - 1\)

Total no. of letters are \(10\) out of which \(4\) are vowels with ‘i’ occurring twice. Treating all vowels as one we have seven letters.

Total no. of arrangements of these seven letters \(= 7!\)

However, \(4\) vowels with 2 ‘i’ can be arranged in \(\frac{4!}{2!}\) ways among themselves.

Thus, total no. of ways \(= 7!\frac{4!}{2!}\)

Total no. of letters \(= 8\); total no. of vowels \(= 3\) and ‘r’ occurs twice.

Total no. of words with no restriction \(= \frac{8!}{2!}\)

Considering three vowels as one total no. of words \(= \frac{6!}{2!}\)

But three vowels can be arranged in \(3!\) ways.

Thus, no. of words when vowels are together \(3!\frac{6!}{2!}\)

Total no. of words when vowels are not together \(= \frac{8!}{2!} - 3!\frac{6!}{2!}\)

Total no. of letters are \(7\) with ‘e’ repeating once.

Total no. of words that can be formed \(= \frac{7!}{2!}\)

With o’s position fixed at end we have \(6\) letters with ‘e’ occurring twice.

Thus, no. of words where ‘o’ occurs at last place \(= \frac{6!}{2!}\)

There are \(5\) vowels and \(5\) consonants. Among vowels ‘a’ and ‘i’ occur twice.

With relative positions fixed total no. of ways of arranging consonants \(= 5!\)

Total no. of ways of arranging vowels \(= \frac{5!}{2!2!}\)

Thus, total of no. of words \(= \frac{5!5!}{2!2!}\)

Possible places for vowels are second, fourth and sixth position.

Thus, no. of ways of arranging vowels \(= ^3P_2\)

Total no. of arranging consonants are \(= 4!\)

Therefore, desired no. of words \(= ^3P_2.4! = 144\)

Possible arrangement can be V C V C V with three vowels, two consonants and no two vowels coming together.

Thus, desired no. of words \(= 3!.2! = 12\)

Numbers greater than a million have \(7\) digits. We have seven digits with \(2\) occurring twice and \(3\) occurring thrice.

Total no. of numbers \(= \frac{7!}{3!2!}\)

But these also include numbers where \(0\) is at first position making them smaller than a million.

No. of numbers with \(0\) at first place \(= \frac{6!}{3!2!}\)

\(\therefore\) Desired no. of numbers \(= \frac{7!}{3!2!} - \frac{6!}{3!2!} = 360\)

For circular permutations \(n\) objects can be arranged in \((n - 1)!\) ways.

When there is no restriction \(9\) persons can be arranged in \(8!\) ways.

Treating all British as one person we have six persons which can be seated in \(5!\) ways.

But four British can be seated in \(4!\) ways among themselves. Thus total no. of seating arrangement \(= 5!4!\)

Total no. of arrangements with no restriction \(=8!\)

Total no.of arrangements with all British seating together \(=5!4!\)

Therefore, total no. of seating arrangements when all four British are not together \(= 8! - 5!4!\)

\(5\) Indians can be seated in \(4!\) ways around the table.

Now there will be five empty positions so that no two British sit together. Thus, no. of ways of seating British \(= ^5P_4\)

Desired number \(= 4!. ^5P_4\)

\(5\) Indians can be seated in \(4!\) ways. Now, 5 British can be arranged in \(^5P_5\) i.e. \(5!\) ways on \(5\) positions.

Thus, desired number \(= 4!5!\)

Treating two delegated as one we have \(19\) delegates which can seated in \(18!\) ways.

But the two delegated themselves can be arranged in \(2!\) ways. Thus, total no. of numbers \(= 18!2!\)

Since in a necklace clockwise or anticlockwise arrangement does not make a difference, total no. of necklaces which can be formed with \(n\) beads \(= \frac{(n - 1)!}{2}\)

\(^nP_4 = 12\times ^nP_2\)

\(n.(n - 1).(n - 2).(n - 3) = 12.n.(n - 1)\)

\((n - 2)(n - 3) = 12\)

\(n^2 - 5n - 6 = 0\)

\((n - 6)(n + 1) = 0\)

Thus, \(n = 6\) as \(n\) cannot be negative.

Rest of the problems are left as exercises.