🤝 Combinations

Calculate nCr: The number of ways to choose r items from a set of n items without repetition, where order does not matter.

C(
,
)

The Comprehensive Guide to Combinations Calculator (nCr)

What is a Combinations Calculator (nCr)?

The Combinations Calculator determines the total number of unique ways exactly r items can be selected from a larger pool of n total items, specifically under the rule that order does not matter.

For example, if you are choosing a team of 3 people from a department of 10, choosing "Alice, Bob, and Charlie" is mathematically identical to choosing "Charlie, Alice, and Bob." That is a combination.

The Mathematical Formula

nCr = n! / [r!(n-r)!]

Selecting r items from n without regarding order.

Calculation Example

Imagine a local pizza shop offers 8 different toppings (n), and you want to order a pizza with exactly 3 toppings (r). Assuming you cannot order double pepperoni (no repetition), how many unique pizzas can you build?

  • The Setup: C(8, 3) = 8! / [3! × (8 - 3)!]
  • Simplifying: 8! / (3! × 5!) = (8 × 7 × 6) / (3 × 2 × 1)
  • The Math: 336 / 6
  • The Result: There are exactly 56 unique combination pizzas you could possibly order.

Strategic Use Cases

  • Lottery Odds: Calculating the exact probability of winning the Powerball or Mega Millions based on choosing 5 numbers out of a drum of 69 options.
  • Tournament Bracket Creation: Calculating how many total games need to be played in a "round-robin" sports tournament where every team must play every other team exactly once.
  • Menu & Product Design: Determining how many unique combo meals a restaurant can market based on offering a choice of 2 sides out of 10 options.

Frequently Asked Questions

What is the difference between Combinations and Permutations?

It all comes down to order. A Combination is like a fruit salad: apples, grapes, and bananas is the exact same salad as bananas, grapes, and apples. A Permutation is like a combination lock: 1-2-3 is completely different from 3-2-1.

Why does the number shrink so fast compared to factorials?

Because we divide out the redundant orders. If you pick 5 cards from a 52 card deck, there are millions of ways to pull those 5 cards one by one (Permutations). But since we don't care about the order you pulled them, we divide by 5! (120) to remove the duplicates, making Combinations much smaller.

What does C(n, n) equal?

Exactly 1. If you have 10 employees and you need to select a team of 10 people, there is only 1 possible combination: you just take everybody.

Related Strategic Tools