Scribd
Upload
10 views3 pages

Combinatorics Notes 4

The document discusses permutations and combinations, specifically focusing on combinations with repetition and derangements. It provides solutions to various problems involving integer solutions to equations and inequalities, as well as the concept of derangements where no integer appears in its original position. Key formulas and examples illustrate the methods for calculating the number of combinations and derangements.

Uploaded by

manoj003dutta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views3 pages

Combinatorics Notes 4

The document discusses permutations and combinations, specifically focusing on combinations with repetition and derangements. It provides solutions to various problems involving integer solutions to equations and inequalities, as well as the concept of derangements where no integer appears in its original position. Key formulas and examples illustrate the methods for calculating the number of combinations and derangements.

Uploaded by

manoj003dutta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

PERMUTATIONS AND COMBINATIONS

COMBINATION WITH REPETITION

When repetition of n kinds of objects is permitted in r-combinations, then the


number of r-combinations is 𝐶(𝑛 + 𝑟 − 1, 𝑟) = 𝐶(𝑛 − 1 + 𝑟, 𝑛 − 1).

Watch the following video to understand this method better:


https://www.youtube.com/watch?v=ZcSSI6VY1kM

Ques 1: Determine the number of integer solutions of the equation 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 32,


where
(a) 𝑥𝑖 ≥ 0, 1 ≤ 𝑖 ≤ 4;
(b) 𝑥𝑖 > 0, 1 ≤ 𝑖 ≤ 4;
(c) 𝑥1 , 𝑥2 ≥ 5 and 𝑥3 , 𝑥4 ≥ 7;
(d) 𝑥1 , 𝑥2 , 𝑥3 > 0 and 0 < 𝑥4 ≤ 25.
Solution:
(a) One solution of the equation is 𝑥1 = 29, 𝑥2 = 1, 𝑥3 = 2 and 𝑥4 = 0.
Another solution is 𝑥1 = 2, 𝑥2 = 29, 𝑥3 = 0 and 𝑥4 = 1. Both of these
solutions are considered different, even though the same integers
0, 1, 2 and 29 are used. The first solution can be interpreted as follows:

We have 32 identical donuts and are distributing them among 4 distinct


students. We have given 29, 1, 2 and 0 donuts to the first, second, third and
fourth student respectively.
Thus, each non-negative solution of the equation corresponds to a selection of 32
identical items from 4 distinct sets, repetition allowed.
Hence, the number of solutions=𝐶(4 + 32 − 1, 32) = 𝐶(35, 32) = 6545.

(b) Now 𝑥𝑖 > 0, 1 ≤ 𝑖 ≤ 4, that is, 𝑥𝑖 ≥ 1, 1 ≤ 𝑖 ≤ 4.

It is like the situation where we put 1 book in each of the 4 shelves, so that now
there are 28 books are remaining to be distributed in the 4 shelves. This way
each book shelf will have at least 1 book, which is strictly greater than 0.

Thus, we put 𝑥𝑖′ = 𝑥𝑖 − 1, so that 𝑥𝑖′ ≥ 0, 1 ≤ 𝑖 ≤ 4.


Then the given equation becomes 𝑥1′ + 𝑥2′ + 𝑥3′ + 𝑥4′ = 28, for which the number
of non-negative solutions is required.
The required number of solutions =𝐶(4 + 28 − 1, 28) = 𝐶(31, 28) = 4495.

(c) Here, since 𝑥1 , 𝑥2 ≥ 5 and 𝑥3 , 𝑥4 ≥ 7; it is like the situation where we put


at least 5 books in the book shelf 𝑥1 and 𝑥2 , and at least 7 books in the
book shelf 𝑥3 and 𝑥4 . So that now there are 8 books are remaining to be
distributed in the 4 shelves.
Thus, we put 𝑥1′ = 𝑥1 − 5, 𝑥2′ = 𝑥2 − 5, 𝑥3′ = 𝑥3 − 7, 𝑥4′ = 𝑥4 − 7, so that 𝑥𝑖′ ≥
0, 1 ≤ 𝑖 ≤ 4. Then the given equation becomes 𝑥1′ + 𝑥2′ + 𝑥3′ + 𝑥4′ = 8, for which
the number of non-negative solutions is required.
The required number of solutions =𝐶(4 + 8 − 1, 8) = 𝐶(11, 8) = 165.

(d) It is like the situation where there is at least one book on first, second and third
book shelves, and the fourth book shelf must hold at least one book and at most 25
books.
Thus, the number of solutions such that 𝑥1 , 𝑥2 , 𝑥3 > 0 and 0 < 𝑥4 ≤ 25 = (the number of
solutions such that 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 > 0) − (the number of solutions such that 𝑥1 , 𝑥2 , 𝑥3 > 0 and
𝑥4 > 25) = 𝑎 − 𝑏 (say).
From part (b), 𝑎 = 𝐶(31,28) = 4495.
To find 𝑏, we put 𝑥1′ = 𝑥1 − 1, 𝑥2′ = 𝑥2 − 1, 𝑥3′ = 𝑥3 − 1, 𝑥4′ = 𝑥4 − 26, so that 𝑥𝑖′ ≥ 0, 1 ≤ 𝑖 ≤
4. Then the given equation becomes 𝑥1′ + 𝑥2′ + 𝑥3′ + 𝑥4′ = 3, for which the number of non-
negative solutions equals 𝑏 = 𝐶(4 + 3 − 1, 3) = 𝐶(6, 3) = 20.
Therefore, the required number of solutions = 𝑎 − 𝑏 = 4495 − 20 = 4475.

Ques 2: Find the number of non-negative solutions of the inequality 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 <


32.
Solution: We convert the inequality into an equality by introducing an auxiliary variable
𝑥5 > 0. Thus, we get 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 + 𝑥5 = 32, where 𝑥𝑖 ≥ 0, 𝑖 = 1, 2, 3, 4 and 𝑥5 > 0 or
𝑥5 ≥ 1.
Putting 𝑥5′ = 𝑥5 − 1 in the given equation, we get
𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 + 𝑥5′ = 32 − 1 = 31, where each variable is non-negative.

The required number of solutions = 𝐶(5 + 31 − 1, 31) = 𝐶(35, 31) = 52360.

DERANGEMENT

A derangement is a permutation of integers {1, 2, 3, … , 𝑛} where none of the 𝑛


integers appears in its natural place, that is, 1 cannot appear in 1st place, 2 cannot
appear in 2nd place, 3 cannot appear in 3rd place, and so on. The number of
derangements of 𝑛 integers {1, 2, 3, … , 𝑛} is denoted by 𝐷𝑛 .

We see that for 𝑛 = 1, 𝐷1 = 0.


For 𝑛 = 2, the only possible deranged permutation of {1, 2} is {2, 1}. So 𝐷2 = 1.
For 𝑛 = 3, the possible derangements of the integers {1, 2, 3} are {2, 3, 1} and
{3, 1, 2}. All other permutations of {1, 2, 3} have at least one integer in its natural
place. So 𝐷3 = 2.
1 1 1 (−1)𝑛
A general formula for 𝐷𝑛 is 𝐷𝑛 = 𝑛! [1 − 1! + 2! − 3! + ⋯ + ].
𝑛!
1 1 1 1 1 1 1 1 1
In particular, 𝐷4 = 4! [1 − 1! + 2! − 3! + 4!] = 9 and 𝐷5 = 5! [1 − 1! + 2! − 3! + 4! − 5!] = 44.

Ques 3: Let 7 books be distributed to 7 students. Suppose that the books are returned and
re-distributed to the students so that no student gets the same book twice. In how many
ways can this be done?

Solution: The first time the books can be distributed in 7! ways, and the second time it can
be done in 𝐷7 ways. Hence, the total number of ways in which the books can be distributed
1 1 1 1 1 1 1
and then re-distributed is given by 7! × 𝐷7 = (7!)2 [1 − 1! + 2! − 3! + 4! − 5! + 6! − 7!] =
2520−840+210−42+7−1
(7!)2 [ ] = 7! × 1854 = 5040 × 1854 = 93,44,160 ways.
7!

Ques 4: Find the number of derangements of the integers from 1 to 10 inclusive, satisfying
the condition that the set of elements in the first 5 places is:

(a) 1, 2, 3, 4, 5 in some order.


(b) 6, 7, 8, 9, 10 in some order.

Solution:

(a) The integers 1, 2, 3, 4, 5 can be placed into the first 5 places in 𝐷5 ways, the last 5
integers 6, 7, 8, 9, 10 can also be placed in the last 5 places in 𝐷5 ways. Hence, the
answer is 𝐷5 . 𝐷5 = 1936 ways.

(b) Any arrangement of the integers 6, 7, 8, 9, 10 in the first 5 places is a derangement,


so there are 5! ways; the same is true for the integers 1, 2, 3, 4, 5 in the last 5 places.
Hence, there are (5!)2 = 14400 such derangements.

You might also like