# Combinations Calculator (nCr)

## Calculator Use

The Combinations Calculator will find the number of possible combinations that can be obtained by taking a sample of items from a larger set. Basically, it shows how many different possible subsets can be made from the larger set. For this calculator, the order of the items chosen in the subset does not matter.

- Factorial
- There are n! ways of arranging n distinct objects into an ordered sequence, permutations where n = r.
- Combination
- The number of ways to choose a sample of r elements from a set of n distinct objects where order does not matter and replacements are not allowed.
- Permutation
- The number of ways to choose a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed. When n = r this reduces to n!, a simple factorial of n.
- Combination Replacement
- The number of ways to choose a sample of r elements from a set of n distinct objects where order does not matter and replacements are allowed.
- Permutation Replacement
- The number of ways to choose a sample of r elements from a set of n distinct objects where order does matter and replacements are allowed.
- n
- the set or population
- r
- subset of n or sample set

## Combinations Formula:

For n ≥ r ≥ 0.

The formula show us the number of ways a sample of “r” elements can be obtained from a larger set of “n” distinguishable objects where order does not matter and repetitions are not allowed. [1] "The number of ways of picking r unordered outcomes from n possibilities." [2]

Also referred to as r-combination or "n choose r" or the
**binomial coefficient**. In some resources the notation uses k instead of r so you may see these referred to as k-combination or "n choose k."

### Combination Problem 1

**Choose 2 Prizes from a Set of 6 Prizes**

You have won first place in a contest and are allowed to choose 2 prizes from a table that has 6 prizes numbered 1 through 6. How many different combinations of 2 prizes could you possibly choose?

In this example, we are taking a subset of 2 prizes (r) from a larger set of 6 prizes (n). Looking at the formula, we must calculate “6 choose 2.”

C (6,2)= 6!/(2! * (6-2)!) = 6!/(2! * 4!) = **15 Possible Prize Combinations**

The 15 potential combinations are {1,2}, {1,3}, {1,4}, {1,5}, {1,6}, {2,3}, {2,4}, {2,5}, {2,6}, {3,4}, {3,5}, {3,6}, {4,5}, {4,6}, {5,6}

### Combination Problem 2

**Choose 3 Students from a Class of 25**

A teacher is going to choose 3 students from her class to compete in the spelling bee. She wants to figure out how many unique teams of 3 can be created from her class of 25.

In this example, we are taking a subset of 3 students (r) from a larger set of 25 students (n). Looking at the formula, we must calculate “25 choose 3.”

C (25,3)= 25!/(3! * (25-3)!)= **2,300 Possible Teams**

### Combination Problem 3

**Choose 4 Menu Items from a Menu of 18 Items**

A restaurant asks some of its frequent customers to choose their favorite 4 items on the menu. If the menu has 18 items to choose from, how many different answers could the customers give?

Here we take a 4 item subset (r) from the larger 18 item menu (n). Therefore, we must simply find “18 choose 4.”

C (18,4)= 18!/(4! * (18-4)!)= **3,060 Possible Answers**

## Handshake Problem

In a group of n people, how many * different* handshakes are possible?

First, let's find the
* total* handshakes that are possible. That is to say, if each person shook hands once with every other person in the group, what is the total number of handshakes that occur?

A way of considering this is that each person in the group will make a total of n-1 handshakes. Since there are n people, there would be n times (n-1) total handshakes. In other words, the total number of people multiplied by the number of handshakes that each can make will be the total handshakes. A group of 3 would make a total of 3(3-1) = 3 * 2 = 6. Each person registers 2 handshakes with the other 2 people in the group; 3 * 2.

Total Handshakes = n(n-1)

However, this includes each handshake twice (1 with 2, 2 with 1, 1 with 3, 3 with 1, 2 with 3 and 3 with 2) and since the orginal question wants to know how many
* different* handshakes are possible we must divide by 2 to get the correct answer.

Total Different Handshakes = n(n-1)/2

### Handshake Problem as a Combinations Problem

We can also solve this Handshake Problem as a combinations problem as C(n,2).

n (objects) = number of people in the group

r (sample) = 2, the number of people involved in each different handshake

The order of the items chosen in the subset does not matter so for a group of 3 it will count 1 with 2, 1 with 3, and 2 with 3 but ignore 2 with 1, 3 with 1, and 3 with 2 because these last 3 are duplicates of the first 3 respectively.

expanding the factorials,

cancelling and simplifying,

which is the same as the equation above.

## References

[1] Zwillinger, Daniel (Editor-in-Chief).
*CRC Standard Mathematical Tables and Formulae, 31st Edition* New York, NY: CRC Press, p. 206, 2003.

For more information on combinations and binomial coefficients please see Wolfram MathWorld: Combination.

**Cite this content, page or calculator as:**

Furey, Edward "Combinations Calculator (nCr)" at https://www.calculatorsoup.com/calculators/discretemathematics/combinations.php from CalculatorSoup,
*https://www.calculatorsoup.com* - Online Calculators