# 4. Combinations (Unordered Selections)

A **combination** of *n* objects taken *r* at a time is a selection which does not take into account the arrangement of the objects. That is, the **order is not important**.

### Example 1

Consider the selection of a set of 4 different letters from the English alphabet.

Suppose

- David selected A, E, R, T;
- Karen selected D, E, N, Q; and
- John selected R, E, A, T

Note: David and John selected the same set of letters, even though they selected them in different order. Hence, these 3 people have selected only 2 different sets of 4 letters (not 3 sets!!).

**Question: **How many different sets of 4 letters can be selected from the alphabet?

Answer

We will use permutations from the previous section to see what is going on.

There are `P_4^26` ways of arranging any `4` letters chosen from the alphabet (where the order is important):

`P_4^26` `=(26!)/((26-4)!)` `=(26!)/(22!)` `=358800`

But in this question, the order is **not** important. Any set of `4` letters chosen can be arranged in `4!` ways.

Hence, the number of different sets of `4` letters is

`(P_4^26)/(4!)` `=358800/24` `=14950`

Using the result from the above example and generalising, we have the following expression for **combinations**.

## Number of Combinations

The number of ways (or **combinations**) in which *r* objects can be selected from a set of *n* objects, where repetition is **not** allowed, is denoted by:

`C_r^n=(n!)/(r!(n-r)!`

### Notes

(a) `C_r^n=(P_r^n)/(r!)`

(b) `C_0^n=1`

(c) `C_n^n=1`

(d) `C_r^n=C_(n-r)^n`

Expand each one out from their definitions to understand why they work.

In our example above, the number of different sets of `4` letters which can be chosen from the alphabet is

`C_4^26` `=(26!)/(4!(26-4)!)` `=(26!)/(4!22!)` `=14950`

### Example 2

Find the number of ways in which `3` components can be selected from a batch of `20` different components.

Answer

`C_3^20` `=(20!)/(3!(20-3)!)` `=(20!)/(3!17!)` `=1140`

Please support IntMath!

### Example 3

In how many ways can a group of `4` boys be selected from `10` if

(a) the eldest boy is included in each group?

(b) the eldest boy is excluded?

(c) What proportion of all possible groups contain the eldest boy?

Answer

(a) Choose `3` from `9`, since the eldest boy is fixed:

`C_3^9 ` `= frac{9!}{3!(9-3)!}` `=frac{9!}{3! times 6!}` `= 84`

(b) If the eldest boy is excluded, it is actually choose `4` boys from `9`:

`C_4^9 ` `= frac{9!}{4!(9-4)!}` `=frac{9!}{4! times 5!}` `= 126`

(c) The number of all possible groups is

`C_4^10 = frac{10!}{4! times 6!} = 210`

So the proportion of all possible groups containing the eldest boy is:

`frac{84}{210}=2/5=40%`

### Example 4

A class consists of `15` boys of whom `5` are prefects.

How many committees of `8` can be formed if each consists of

(a) exactly `2` prefects? (b) at least `2` prefects?

Answer

The number of ways of choosing `2` prefects from `5` is `C_2^5 =frac{5!}{2! times 3!} = 10`

The number of ways of choosing `6` non-prefects from `10` is

`C_6^10 =frac{10!}{6! times 4!} = 210`

(a) Number of possible committees with exactly `2` prefects:

`C_2^5 times C_6^10 = 10 times 210 = 2100`

(b) Number of committees with `3` prefects:

`C_3^5 times C_5^10 ` `= frac{5!}{3! times 2!} times frac{10!}{5! times 5!}` `= 2520`

Number of committees with `4` prefects:

`C_4^5 times C_4^10` `= frac{5!}{4! times 1!} times frac{10!}{4! times 6!}` `= 1050`

Number of committees with `5` prefects:

`C_5^5 times C_3^10` `= frac{5!}{5! times 0!} times frac{10!}{3! times 7!}` `= 120`

So the number of committees with at least `2` prefects is:

`2100 + 2520 + 1050 + 120 = 5790`

#### Alternative Solution:

The problem with the method used above is that if we have many (say `20`) to count, it would become very tedious. So we look at another way of doing it.

If we find the number of committees with `0` prefects and `1` prefect, and subtract this from the total number of committees, we will have the number with at least `2`:

Number of committees with `0` prefects:

`C_8^10 =frac{10!}{8! times 2!} = 45`

Number of committees with `1` prefect:

`C_1^5 times C_7^10 = frac{5!}{1! times 4!} times frac{10!}{7! times 3!} = 600`

The total number of committees is:

`C_8^15 =frac{15!}{8!(15 - 8)!} = frac{15!}{8! times 7!} = 6435`

So the number with at least `2` prefects is given by:

`6435 − 45 − 600 = 5790`

Please support IntMath!

### Example 5

Out of `5` mathematicians and `7` engineers, a committee consisting of `2` mathematicians and `3` engineers is to be formed. In how many ways can this be done if

(a) any mathematician and any engineer can be included?

(b) one particular engineer must be in the committee?

(c) two particular mathematicians cannot be in the committee?

Answer

(a) `C_2^5 times C_3^7` ` =frac{5!}{2! times 3!} times frac{7!}{3! times 4!}` ` = 350`

(b) `C_2^5 times C_2^6` ` =frac{5!}{2! times 3!} times frac{6!}{2! times 4!}` ` = 150`

(c) `C_2^3 times C_3^7 ` `=frac{3!}{2! times 1!} times frac{7!}{3! times 4!}` ` = 105`

Get the Daily Math Tweet!

IntMath on Twitter

### Search IntMath, blog and Forum

### Online Math Solver

This math solver can solve a wide range of math problems.

Go to: Online algebra solver

### Math Lessons on DVD

Math videos by MathTutorDVD.com

Easy to understand math lessons on DVD. See samples before you commit.

More info: Math videos

### The IntMath Newsletter

Sign up for the free **IntMath Newsletter**. Get math study tips, information, news and updates each fortnight. Join thousands of satisfied students, teachers and parents!