Summarize this article:
538 LearnersLast updated on November 24, 2025

Combinations, also called ‘selection’, is a method we use to select items from a given set of items where the order of selection does not matter. Combinations are different from arrangements or permutations, where the order of selection does matter.
Combinations are selections made by choosing some or all objects from a set, without considering the order of selection. The number of combinations of n different objects taken r at a time is denoted by \(^nC_r\) and is calculated using the formula:
\(^nC_r = \frac{n!}{r!(n-r)!}\), where 0 ≤ r ≤ n
This is known as the general combination formula.
Let's see an example:
A fruit basket contains five different fruits: Apple, Banana, Cherry, Mango, and Orange. In how many ways can you select two fruits from the basket?
Solution:
\(^5C_2 = \frac{5!}{2!(5-2)!} = \frac{5!}{2! \, 3!} = \frac{5 \times 4 \times 3!}{2 \times 1 \times 3!} = \frac{5 \times 4}{2 \times 1} = 10\)
There are 10 different ways to select two fruits from 5.
Now that we know what combinations are, let us learn about the formula that we use to easily find the number of possible combinations of objects.
The formula to calculate the number of combinations is:
C(n,r) = n! / r!(n-r)!
Where:
Let us take an example,
If there are 5 different fruits, and you want to pick 2, the number of ways you can select is
C(n,r) = \( \frac{n!}{r!(n - r)!} = C(5,2) = \frac{5!}{2!(5 - 2)!} \)
⇒ C(5,2) = \( \frac{5!}{2! \, 3!} = \frac{(5 \times 4 \times 3 \times 2 \times 1)}{(2 \times 1)(3 \times 2 \times 1)} \) = 10
So there are 10 different ways to choose 2 fruits from a total number of 5 fruits.
When learning about combinations, it is important to know whether the order matters or not. To understand this distinction we need to understand the difference between permutations and combinations as it can be quite confusing to know when to use permutations or combinations.
| Permutation | Combination |
| A permutation is an arrangement of objects in a specific order. Here, the order of the objects matters. | Combination is a selection of objects in any order. In combinations, the order of the objects does not matter. |
| P(n,r) = n! / (n-r)! | C(n,r) = n! / r!(n-r)! |
| We use permutations in ranking, seating arrangements or even creating our passwords. | Combinations are used in lotteries, forming a team. |
| Example: If there are 10 contestants and 3 are chosen for 1st, 2nd, and 3rd place ranking: P(10,3) = 10! / (10-3)! =720 |
Example: Selecting any 3 winners from 10 contestants without any ranking: C(10,3) = 10! / 3!(10-3)! = 120 |
Suppose we have a set of 6 letters: {A, B, C, D, E, F}. How many ways can we select a group of 3 letters from this set?
If we first consider arrangements (permutations) of 3 letters from the six letters, the number would be:
\(^6P_3\)
Now, consider the permutations that contain the letters A, B, and C. There are 3!=6 possible arrangements:
ABC, ACB, BAC, BCA, CAB, CBA
However, for combinations, the order does not matter. All six of these arrangements correspond to a single combination {A, B, C}.
So, to find the total number of combinations of 3 letters from 6, we divide the total permutations by
3! (the number of ways to arrange three letters):
\(^6C_3 = \frac{^6P_3}{3!} = \frac{6 \times 5 \times 4}{3 \times 2 \times 1} = 20\)
This is also read as “6 choose 3.”
Understanding the key points of the combination formula helps explain exceptional cases, such as choosing all, choosing none, and symmetry. These basics make calculations easier and prevent common mistakes.
The combination formula is:
\(^nC_r = \frac{n!}{r!(n-r)!}\) ,where 0 ≤ r ≤ n
The important cases:
1. Where r = n:
\(^nC_n = \frac{n!}{n!(n-n)!} = \frac{n!}{n! \cdot 0!} = 1\)
2. When r = 0:
\(^nC_0 = \frac{n!}{0!(n-0)!} = \frac{n!}{0! \cdot n!} = 1\)
This shows that the combination formula is valid even when r = 0.
3. Symmetry property:
\(^nC_{(n-r)} = \frac{n!}{(n-r)!\,(n-(n-r))!} = \frac{n!}{(n-r)!\,r!} = {}^nC_r\)
This means that selecting r objects from n objects is equivalent to rejecting n−r objects.
Combinations are a difficult topic to understand and solve problems related to it. In this section, we will discuss some tips and tricks to master combinations.
When learning about combinations, students might often make mistakes. So here are a few common mistakes and how to avoid them:
Combinations are used widely in our daily lives. Here are a few real-world applications of combinations.
Lottery draws: One of the most common uses of combinations, in lotteries a set of numbers is selected. The order in which it is drawn does not matter, this makes it a combination.
Forming sports teams: When selecting players for a team, the order in which they are chosen does not matter, what matters is who is selected.
Card games: When drawing cards for a game, the order of the cards does not matter. What matters is the cards you have. This makes it a combination.
Food and meal choices: Restaurants use combinations to create meal deals or ingredient mixes where order doesn’t matter.
Genetic research: In genetics, combinations are used to study how traits are passed on by analyzing different gene pairings without considering order.
How many ways can you choose 4 books out of 8?
There are 70 combinations to choose 4 books out of 8.
C(n,r) = \(\frac{n!}{r!(n-r)!}\)
C(8,4) = \(\frac{8!}{4!(8-4)!} = \frac{8!}{4! \times 4!} = \frac{40320}{24 \times 24} = 70\)
How many combinations are there if we choose 0 items from 15?
1
C(15,0) = 1 because choosing nothing from a set is always one way (the empty set), and by definition, 0! = 1.
Out of 12 applicants, a manager needs to form a team of 4 employees. How many different teams can be formed?
There are 495 combinations to form a team of 4.
\(C(n,r) = \frac{n!}{r!(n-r)!}\)
C(12,4) = \(\frac{12!}{4!(12-4)!} = \frac{12!}{4! \times 8!} = 495\).
In the word Brave there are 5 distinct letters, how many unique combinations of 3 letters can be selected?
10
Since the order does not matter when selecting letters, we will use the combination formula.
C(n,r) = \(\frac{n!}{r!(n-r)!}\)
C(5,3) = \(\frac{5!}{3!(5-3)!} = \frac{5!}{3! \times 2!} = \frac{20}{2} = 10\)
A chef wants to create a new dish by choosing 4 spices from a collection of 15. How many different spice blends are possible?
1365 combinations.
C(n,r) =\(\frac{n!}{r!(n-r)!}\)
C(15,4) = \(\frac{15!}{4!(15-4)!} = \frac{15!}{4! \times 11!} = 1365\)
Jaipreet Kour Wazir is a data wizard with over 5 years of expertise in simplifying complex data concepts. From crunching numbers to crafting insightful visualizations, she turns raw data into compelling stories. Her journey from analytics to education ref
: She compares datasets to puzzle games—the more you play with them, the clearer the picture becomes!






