20MMAC15 COMBINATORICS

UNIT 1
PERMUATIONS AND COMBINATIONS

Combination formula derivation

 Combination formula derivation
(For distinct objects)

n!
The number of r – combinations of n distinct objects is C(n, r )  r! (n  r )!

Proof:

We know that, P(n, r) = P(r, r) X C(n, r) [ Using result in Example 1.2]

P (n , r )
C(n, r ) 
P (r , r )

n!
C(n, r ) 
r! (n  r )!
 Combination - Result

C(n, r )  C(n, n  r )

Proof:

Since, selecting r objects out of n objects is equivalent to

picking the n-r objects that are not to be selected.

i.e., C(n, r )  C(n, n  r )

 Combination formula derivation
(For distinct objects with repetitions)

When repetitions in the selection of the objects are allowed, the number of
ways of selecting r objects from n distinct objects is C (n + r - 1 , r)

Proof:

Let the n objects be identified by the integers 1, 2, …, n.

Let a specific selection of r objects be identified and arranged in increasing

order. Let it be {i,j, k,…..m}

For example, the selection in which the first object is selected thrice, the
second object is not selected, the third object is selected once, the forth
object is selected once, the fifth object is selected twice, etc. is represented
as {1,1,1,3,4,5,5,….}
 Combination formula derivation
(For distinct objects with repetitions)

To the r integers in such a list we add 0 to first integer, 1 to second

integer,… and r – 1 to the rth integer.

Thus, {i, j, k,….,.m} becomes {i , j +1, k + 2,… ,m + (r – 1)}

For example, the selection {1,1,1,,3,4,5,5,….,} becomes {1,2,3,6,8,10,11,…}

Since each selection will then be identified uniquely as a selection of r

distinct integers from 1, 2, …, n + (r – 1 ) .

Therefore, by selecting r objects out of n + ( r – 1 ) distinct objects =

C(n + r – 1 , r).
Hence proved.
 Combination formula derivation
(For non distinct objects)

When the objects are not all distinct, the number of ways to select one or
more objects from them is equal to (q1 + 1) (q2 + 1) . . . (qt + 1 ) – 1.,
where q1 objects of the first kind, q2 objects of the second type, … , and qt
objects of the tth kind.

Proof:

By the rule of product, we get the result immediately.

There are q1 + 1 ways of choosing the object of the first kind, i.e., choosing
none of them, one of them, two of them, …, or q1 of them.

Similarly, there q2 + 1 ways to choosing objects of the second kind., . . . , and

qt + 1 ways of choosing objects of the tth kind.

The term – 1 corresponds to the “selection” in which no object at all is

chosen and should be discounted.