Skip to content
← All questions

How do you calculate the number of combinations without repetition?

For selection without repetition, the number of combinations is calculated using the binomial coefficient formula (nr)=n!/[r!(n−r)!]\binom{n}{r}=n!/[r!(n-r)!]. This formula counts the number of ways to choose rr distinct elements from a set of nn elements where order does not matter.

Conditions

  • The selection is made without repetition.
  • The elements are distinct.
  • Order does not matter in the selection.

Reasoning, step by step

  1. Identify the total number of elements nn and the number of elements to select rr.
  2. Calculate the factorial of nn, rr, and n−rn-r.
  3. Apply the formula (nr)=n!/[r!(n−r)!]\binom{n}{r}=n!/[r!(n-r)!] to find the number of combinations.

Example

For selection without repetition, (nr)=n!/[r!(n−r)!]\binom{n}{r}=n!/[r!(n-r)!].

Common misconceptions

  • Using the permutation formula P(n,r)P(n,r) instead of the combination formula.
  • Forgetting to divide by r!r! to account for the irrelevance of order.

Watch the explanation

Connected concepts

Explore next

Related questions

Find a method

↗
Understand why

↗

Answers are generated from source material and independently checked. Consult the original video or creator if something is unclear.