# Meaning of combination is selection of objects

**Selection of objects without repetition:-**

The number of selections (combinations or groups) that can be formed form n different objects taken r(0 < r < n) at a time is ^{n}C_{r} = n!/(r!(n-r))!.

Explanation: Let the total number of selection (or groups) = x. Each group contains r objects, which can be arranged in r! ways. Hence number of arrangements of r objects = x Ã— (r!).

But the number of arrangements = ^{n}p_{r}

=> x Ã— (r!) = ^{n}p_{r} => x = => x = n!/(r!(n-r)!) = ^{n}C_{r}.

**Selection of objects with repetition :-**

The number of combination of n distinct objects taken r at a time when each may occur once, twice, thrice, ...... upto r times, in any combination = ^{n+r-1}C_{r}.

Explanation: Let eh n objects a1, a2, a3, ...... an. In a particular group of r objects, let

a_{1} occur x_{1} times,

a_{2} occur x_{2} times,

a_{3} occur x_{3} times,

.................................

.................................

a_{n} occur x_{n} times,

such that x_{1} + x_{2} + x_{3} + ......... + x_{n} = r ......... (1)

0 < x_{i} < r i Îµ {1, 2, 3, ......, n}.

Now the total number of selections of r objects, out of n

= number of non-negative integral solution of equation (1)

= ^{n+r-1}C_{n-1} = ^{n+r-1}C_{r}.

**Note:**

**Details of finding the number of integral solutions of equation (1) are given on page 12 (Multinomial theorem).**

Let 15 toys be distributed among 3 children subject to the condition that any child can take any number of toys. Find the required number of ways to do this if

(i) toys are distinct, (ii) if toys are identical

(i) Toys are distinct

Here we have 3 children and we want the 15 toys to go to the 3 children with repletion. In other words it is same as selecting and arranging children 15 times out of 3 children with the condition that any children can be selected any no. of time which can be done in 315 ways (n = 3, r = 15).

(ii) Toys are identical

Here we only have to select children 15 times out of 3 children with the condition that any children can be selected any number of times which can be done in

^{3+5-1}C_{15} = ^{17}C_{2} way (n = 3, r = 5).