Combination Calculator

The Science of Selection

Combinations are a fundamental concept in combinatorics, a field of mathematics concerned with counting, arrangement, and probability. Unlike permutations, which care about the sequence of items, a combination focuses purely on selection. It answers the question: "In how many ways can I choose a group of items from a larger set, if the order of selection doesn't change the group?"

This concept is applied everywhere, from determining lottery odds to forming sports teams. For example, if you are making a fruit salad and you choose Apple, Banana, and Cherry, it is the same salad as Cherry, Apple, and Banana. The order doesn't change the outcome. This is a Combination.

The Combination Formula Explained

The formula for calculating combinations is denoted as C(n,r), nCr, or sometimes as a binomial coefficient vector. It relies on factorials (!).

Here, n is the total number of items available, and r is the number of items you want to select. The formula divides the total permutations (n!) by the redundancy caused by the order of selection (r!) and the unselected items ((n-r)!). This removal of redundancy is what makes the combination count smaller than the permutation count.

Combination vs. Permutation

The crucial distinction lies in order.

• Combination (Order Doesn't Matter): Selecting 3 fruits for a smoothie (Apple, Banana, Orange). The result is 1 distinct group.
• Permutation (Order Matters): Awarding Gold, Silver, and Bronze medals to 3 runners. (Runner A, Runner B, Runner C) is a different outcome than (Runner C, Runner A, Runner B).

Real-World Examples

Frequently Asked Questions

How to Use This Combination Calculator

Enter n (total number of items) and r (number to choose). The Combination Calculator computes C(n, r) = n! / (r!(n−r)!)—the number of ways to choose r items from n when order does not matter. Use it for lottery odds, committee formation, sampling, or any problem where you select a subset and the arrangement is irrelevant. For ordered selections, use the Permutation Calculator; for counting all arrangements of n items, use the Factorial tool. Ensure n ≥ r and both are non-negative integers.

Example: choosing 3 people from 10 for a committee gives C(10,3) = 120. Because order does not matter, the group (A,B,C) is the same as (C,B,A). For probability, divide the number of favorable combinations by the total number of outcomes (e.g. C(5,3)/C(52,5) for poker hands). This tool is for educational and reference use only.

When Combinations Apply

Combinations are used in probability (e.g. how many ways to pick 5 cards from 52), experimental design, sampling, and combinatorics. The symmetry C(n,r) = C(n,n−r) can simplify calculations. This calculator is for educational and reference use; for very large n and r, numerical overflow may occur in some implementations.

Limitations

This calculator assumes selection without replacement (each item chosen at most once). For combinations with repetition (e.g. multiset selection), the formula is C(n+r−1, r). Inputs must be non-negative integers with r ≤ n. For probability problems, remember to divide by the total number of outcomes when needed. This tool is for informational use only; verify with your textbook or a second source for critical applications.

Disclaimer

This tool is for informational use only. Verify formula and inputs for your specific problem (e.g. with or without replacement).

Related Statistical Tools