Free Combination Calculator
Enter n and r, then click Calculate
Exploring the Combination Calculator (nCr Calculator)
The Combination Calculator—often labeled as the nCr Calculator or n Choose k Calculator—instantly computes the number of combinations (denoted ) from a collection of distinct items. Beyond simple counting, this tool can also enumerate every possible combination or permutation for sets of up to 10 elements (or up to 300 combinations/permutations). Users should be aware that the generated list can become very long; the calculator will notify you if the output approaches its practical limit.
What Is a Combination?
In mathematics, a combination is a way of selecting items from a larger set where the order of selection does not matter. This concept is frequently expressed as “n choose k” (nCr). For instance, picking 5 players from a team of 12 to form a committee is a combination; the sequence in which they are chosen is irrelevant. The number of possible combinations is given by the binomial coefficient.
The Combination Formula
For choosing elements out of distinct objects (without repetition), the number of combinations is:
Here, (n factorial) is the product of all positive integers from 1 up to . Factorials grow extremely quickly, so the calculator handles large values automatically.
Practical Example: Suppose a bag contains 12 uniquely colored balls. How many different sets of 5 balls can be drawn? Using the formula:
Thus, there are 792 distinct combinations of 5 balls from the set of 12.
Key Properties of Combinations
- Single item: When , — exactly as many ways as there are objects.
- All items: When , — only one way to select everything.
- Symmetry: . Choosing 5 out of 12 is equivalent to excluding 7 out of 12.
These properties can be verified immediately using the calculator.
Combinations vs. Permutations
The essential difference is whether the order of the selected items matters.
| Type | Order matters? | Example with 3 letters {A,B,C} |
|---|---|---|
| Combination | No | Only one set: {A,B,C} |
| Permutation | Yes | 6 sequences: ABC, ACB, BAC, BCA, CAB, CBA |
The formula for permutations of items taken from distinct objects is:
The relationship between the two is:
Illustration with Cards: From a deck of 9 cards numbered 1–9, you draw three cards to form a 3-digit number. The number of possible numbers (permutations) is . If order is ignored (just the set of digits), the number of combinations is . Each combination can be arranged in different orders, confirming the relationship.
Selections with Repetition
When items can be chosen more than once (sampling with replacement), the formulas change:
- Combinations with repetition:
- Permutations with repetition:
For example, with 4 colored balls and 3 draws where each ball is returned after being drawn, there are multisets (combinations with repetition) and ordered sequences (permutations with repetition). The calculator covers both scenarios.
Combinations in Probability
Combinations frequently appear in probability calculations, especially in games of chance. Consider a bag with 4 balls: one red and three green. When drawing 3 balls without replacement, the probability that the red ball is among them is:
If you repeat this trial many times, the observed proportion will approach 75% according to the law of large numbers. The calculator helps find the required combination counts quickly.
A Brief Note on Linear Combinations
The term “linear combination” appears in algebra and physics but refers to a different idea: multiplying each term by a constant and adding the results. For instance, any 3D vector can be expressed as a linear combination of the unit vectors . Hyperbolic functions can be built from exponentials: . While not directly related to the combinatorial selections above, it is a fundamental technique in many scientific fields.
FAQ
1. What is the difference between a combination and a permutation?
In a combination, the order of the selected items does not matter; different sequences are considered the same set. In a permutation, order matters, so each different sequence is counted separately. For example, choosing 3 letters from {A,B,C}: there is 1 combination ({A,B,C}) but 6 permutations (ABC, ACB, BAC, BCA, CAB, CBA).
2. How do I calculate the number of combinations with repetition?
The formula for combinations with repetition (sampling with replacement) is C'(n,r) = (n+r-1)! / (r! * (n-1)!). For example, with 4 colors and 3 draws where each ball is returned, there are (4+3-1)!/(3!*3!) = 20 possible multisets.
3. What is the combination formula for choosing r items from n without repetition?
The formula is C(n,r) = n! / (r! * (n-r)!). It gives the number of ways to select r distinct objects from a set of n distinct objects where order does not matter.
4. How many combinations are there when choosing 5 items from 12?
The number of combinations is C(12,5) = 792. You can verify this using the formula n!/(r!(n-r)!) or the calculator.
5. Can the combination calculator generate all possible combinations for any set?
Yes, but with a limit: the calculator can generate every combination or permutation for sets up to 10 elements (or up to 300 combinations/permutations). If the list would exceed this limit, the tool will inform you.
How to Use
- Enter the total number of objects (n) in the first input field.
- Enter the sample size (r) - the number of objects to select.
- Click Calculate to see the number of combinations C(n, r) with optional permutation display.