Skip to main content
math

Combination Calculator

Calculate the number of ways to choose r items from n items where order does not matter. Uses the formula C(n,r) = n!/(r!(n-r)!)

Reviewed by Chase FloiedUpdated

This free online combination calculator provides instant results with no signup required. All calculations run directly in your browser — your data is never sent to a server. Enter your values below and see results update in real time as you type. Perfect for everyday calculations, homework, or professional use.

Total number of items in the set.

Number of items to choose from the set.

How to Use This Calculator

1

Enter your input values

Fill in all required input fields for the Combination Calculator. Most fields include unit selectors so you can work in your preferred unit system — metric or imperial, whichever matches your problem.

2

Review your inputs

Double-check that all values are correct and that you have selected the right units for each field. Incorrect units are the most common source of calculation errors and can produce results that are off by factors of 2, 10, or more.

3

Read the results

The Combination Calculator instantly computes the output and displays results with units clearly labeled. All calculations happen in your browser — no loading time and no data sent to a server.

4

Explore parameter sensitivity

Try adjusting individual input values to see how the output changes. This is a quick and effective way to develop intuition about how different parameters influence the result and to identify which inputs have the largest effect.

Formula Reference

Combination Calculator Formula

See calculator inputs for the governing equation

Variables: All variables and their units are labeled in the calculator interface above. Input fields accept values in multiple unit systems — select your preferred unit from the dropdown next to each field.

When to Use This Calculator

  • Use the Combination Calculator when you need a quick mathematical result without writing out all the steps manually, saving time on repetitive calculations.
  • Use it to verify hand calculations on tests or assignments and catch arithmetic mistakes.
  • Use it when teaching or explaining mathematical concepts to others, demonstrating how changing inputs affects the result.
  • Use it to explore the behavior of mathematical functions across a range of inputs.

About This Calculator

The Combination Calculator is a free mathematical calculation tool for students, educators, and professionals who need quick, reliable results. Calculate the number of ways to choose r items from n items where order does not matter. Uses the formula C(n,r) = n!/(r!(n-r)!) The underlying algorithms implement well-established mathematical formulas and numerical methods. Results are computed instantly in the browser. This tool is useful for learning, verification of hand calculations, and rapid exploration of mathematical relationships. All computation happens locally — no data is sent to a server.

About Combination Calculator

The combination calculator computes the number of ways to select r items from a set of n items when the order of selection does not matter. This is one of the most fundamental concepts in combinatorics and probability theory. Combinations appear everywhere: lottery odds, committee formation, poker hand rankings, genetic trait combinations, and sampling plans in quality control. The key distinction from permutations is that in combinations, {A, B, C} and {C, B, A} count as the same selection. The binomial coefficient, often written as 'n choose r', is also the coefficient of x^r in the expansion of (1+x)^n, which is why it appears throughout algebra, calculus, and discrete mathematics.

The Math Behind It

The number of combinations of r items from n items is given by C(n,r) = n! / (r!(n-r)!). This formula can be understood by first counting all ordered arrangements (permutations), which is n!/(n-r)!, and then dividing by r! to remove the redundant orderings within each group. The result is always a positive integer when 0 <= r <= n. Key properties include symmetry (C(n,r) = C(n,n-r)), the recursion C(n,r) = C(n-1,r-1) + C(n-1,r) which generates Pascal's triangle, and the sum identity C(n,0) + C(n,1) + ... + C(n,n) = 2^n. In probability, combinations are used to count favorable outcomes; for example, the probability of being dealt a flush in poker requires counting the number of 5-card combinations from a single suit divided by the total number of 5-card hands. In statistics, combinations underlie the binomial distribution, the hypergeometric distribution, and many sampling techniques. For very large n, Stirling's approximation (n! ~ sqrt(2*pi*n)*(n/e)^n) is used to estimate factorials, and the logarithm of the binomial coefficient can be computed to avoid overflow.

Formula Reference

Combination Formula

C(n, r) = n! / (r! * (n - r)!)

Variables: n = total number of items; r = number of items chosen; ! = factorial

Worked Examples

Example 1: Lottery odds

A lottery requires choosing 6 numbers from 49. How many possible combinations are there?

Step 1:n = 49, r = 6.
Step 2:C(49, 6) = 49! / (6! * 43!).
Step 3:Calculate: 49*48*47*46*45*44 / 720 = 13,983,816.

There are 13,983,816 possible lottery combinations, giving odds of about 1 in 14 million.

Example 2: Committee selection

How many ways can a 4-person committee be formed from a group of 12 people?

Step 1:n = 12, r = 4.
Step 2:C(12, 4) = 12! / (4! * 8!).
Step 3:Calculate: 12*11*10*9 / 24 = 495.

There are 495 possible committees.

Common Mistakes & Tips

  • !Confusing combinations with permutations. If order matters, use the permutation formula instead.
  • !Forgetting that 0! = 1, which means C(n, 0) = C(n, n) = 1.
  • !Using combinations when items can be repeated; for that, use the multiset coefficient C(n+r-1, r).

Related Concepts

Used in These Calculators

Calculators that build on or apply the concepts from this page:

Frequently Asked Questions

When should I use combinations instead of permutations?

Use combinations when the order does not matter (e.g., choosing team members). Use permutations when the order matters (e.g., assigning ranked positions).

What is the largest value of n this calculator can handle?

JavaScript can handle factorials accurately up to about n = 170 before exceeding the maximum floating-point value. For larger values, logarithmic computation or big-integer libraries are needed.

What is Pascal's triangle?

Pascal's triangle is an arrangement of binomial coefficients where each entry equals the sum of the two entries directly above it. Row n contains C(n,0), C(n,1), ..., C(n,n).