ThisCalculator

Technology

Combination Rule Calculator: How to Use It

Updated · Standard formula, shown below

Combinations (nCr) 120 ways
Total items (n)
10 items
You entered
Chosen items (r)
3 items
You entered

Combination Rule Calculator: How to Use It

This calculator works out the number of ways to choose a subset of items from a larger set when order does not matter. You enter the total number of items (n) and how many you are choosing (r), and it returns the combination count using the standard formula nCr = n! / (r! × (n−r)!). It also shows the result step by step so you can verify the math.

Formula

The combination formula counts the number of distinct groups of size r that can be formed from n distinct items, disregarding order. It is written as:

nCr = n! / (r! × (n − r)!)

  • n – total number of distinct items (a positive integer).
  • r – number of items chosen in each group (an integer from 0 to n).
  • n! (n factorial) – product of all positive integers from 1 to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120.
  • nCr – the number of combinations, also read as “n choose r.â€�

The factorial in the denominator removes the duplicate arrangements that would be counted if order mattered (which would be permutations). For instance, choosing {A, B, C} is the same group as {C, B, A} – the formula divides by r! to eliminate those repeats.

Worked Example

Using the default values from the calculator above (n = 10, r = 3):

  1. Write the formula: 10C3 = 10! / (3! × (10 − 3)!)
  2. Compute the factorials: 10! = 3,628,800; 3! = 6; 7! = 5,040.
  3. Multiply the denominator: 6 × 5,040 = 30,240.
  4. Divide: 3,628,800 ÷ 30,240 = 120.

So 10C3 = 120. That means there are 120 different ways to pick 3 items from a set of 10 when the order of picking does not matter. This matches the calculator’s output.

When to Use Combinations vs. Permutations

The most common mistake is using combinations when order matters. Ask yourself: does the arrangement of the chosen items make a different outcome? If yes, use permutations (nPr = n! / (n−r)!). If no, use combinations.

  • Combination example: Choosing 3 members from a 10-person committee to serve on a subcommittee – the group {Alice, Bob, Carol} is the same as {Carol, Alice, Bob}.
  • Permutation example: Selecting 3 people from 10 to be president, secretary, and treasurer – assigning Alice as president and Bob as secretary is different from the reverse.
  • With repetition: If items can be chosen more than once (e.g., rolling dice), the formula changes to (n + r − 1)Cr. This calculator assumes no repetition.

How to Read the Result

The output is a whole number that tells you how many distinct subsets exist. It is always an integer and grows very quickly. For example, 10C5 = 252, but 20C10 = 184,756. The number is largest when r is about half of n.

You can use the result to answer probability questions: if you randomly pick 3 items from 10, the chance of getting one specific group is 1/120 ≈ 0.833%. The combination count forms the denominator in many probability calculations.

Common Mistakes and Limitations

  • Mixing up n and r: nCr equals nC(n−r), so 10C3 = 10C7 = 120. But entering r > n gives a factorial of a negative number, which is undefined. The calculator will show an error – check your inputs.
  • Using the wrong formula for repetition: If you are selecting with replacement (e.g., choosing 3 flavors from 5 where you can pick the same flavor twice), you need the multiset formula, not this one.
  • Rounding errors: For large n (above 170), factorials exceed the range of standard calculators, and the result may overflow. Use a calculator that handles big integers or logs for such cases.
  • Assuming order matters: Re-read the problem. If the order of selection matters, use permutations.

Real-World Applications

Combinations appear in many everyday situations:

  • Lotteries: The odds of winning a 6/49 lottery are 1 in 49C6 = 13,983,816.
  • Card games: The number of possible 5-card poker hands from a 52-card deck is 52C5 = 2,598,960.
  • Team selection: Choosing a starting lineup from a roster, where positions are interchangeable.
  • Sampling: How many different samples of size r can be drawn from a population of n.
  • Binomial coefficients: The coefficients in the expansion of (a + b)^n are exactly nCr values. For example, (a + b)^3 = a^3 + 3a^2b + 3ab^2 + b^3, where 3C0=1, 3C1=3, 3C2=3, 3C3=1.

Frequently Asked Questions

What does nCr mean on a calculator?

nCr is the combination function on most scientific calculators. It calculates the number of ways to choose r items from n items without regard to order. For example, to compute 10C3, you press 10, then the nCr button, then 3, and get 120.

Can r be larger than n?

No. Mathematically, nCr is defined only for 0 ≤ r ≤ n. If r > n, the formula involves a negative factorial, which is undefined. In practical terms, you cannot choose more items than are available. The calculator will return an error if you try.

What is the difference between combinations and permutations?

Combinations ignore order; permutations consider order. For example, from {A, B, C}, the combinations of size 2 are {A,B}, {A,C}, {B,C} – three of them. The permutations of size 2 are AB, BA, AC, CA, BC, CB – six of them. Use nPr when the arrangement matters, nCr when it does not.

How do I calculate combinations with repetition?

When items can be chosen more than once, the formula is (n + r − 1)Cr. For instance, choosing 3 scoops of ice cream from 5 flavors where repeats are allowed gives 7C3 = 35 combinations. This calculator does not handle repetition; use the extended formula separately.

Why does the result grow so fast?

Because each additional item multiplies the number of possible subsets. The function nCr is exponential in n for fixed r. For example, 10C5 = 252, but 20C5 = 15,504. This rapid growth is why combinations are used in probability to represent huge sample spaces.

What if I have a very large n, like 1000?

Factorials of 1000 are astronomically large (about 4 × 10^2567) and exceed the capacity of ordinary calculators. You can use logarithms: log(nCr) = log(n!) − log(r!) − log((n−r)!). Many programming languages and statistical software have built-in functions for large combinations. For most practical purposes, a standard calculator works fine for n up to 170.

Related

Formula used
in n | Total items (n) | items | 10 | 0
in r | Chosen items (r) | items | 3 | 0
out comb | Combinations (nCr) | ways | fact(n) / (fact(r) * fact(n - r)) | 0

Each line is one input (in, sel, list) or one result (out: label, unit, formula, decimals). How the calculators work

Method: the standard formula for this calculation, rounded as each result states. See how the calculators work or report an error.