# Find the number of combinations

Suppose we are selecting a few items from a large number of distinct items and you are trying to find out how many different ways this can be done. You are trying to find the **number of combinations**.

Suppose you want to buy 2 cars from a set of 4 distinct choices. Suppose the set is {Honda, Toyota, Mercedes, BMW}

How many ways can you select two cars from this set?

Here are the different ways to do this.

(Honda, Toyota) (Honda, Mercedes) (Honda, BMW) (Toyota, Mercedes) (Toyota, BMW) (Mercedes, BMW)

Each of the possible selections in this list is called a **combination. **Therefore, the number of combinations is 6.

It is important to notice that the order in which the selections are made is not important when dealing with combinations.

For instance, the combination (Honda, Mercedes) is the same as (Mercedes, Honda). Both of these arrangement represent 1 combination.

**Combination notation**

Combinations give the number of ways r items can be selected from n items.

The notation that we use to denote the number of combinations is C(n, r), or _{n}C_{r}

n is the total number of items

r is the number of items selected from the total numbers of items

_{n}C_{r, }C(n, r), or is read as “the number of combinations of n items selected r at a time.”

**Number of combinations formula**

=

Let us revisit our previous example about selecting 2 cars from a set of 4 choices. Use the formula above to find the number of combinations

In this case, n = 4 and r = 2

= = = = = = = = = 6