Calculate Combinations Instantly
Find the exact value of C(n, k), also called the binomial coefficient or “n choose k”.
What does “n choose k” mean?
“n choose k” counts how many distinct ways you can choose k items from a set of n items when order does not matter. In math notation, this is written as C(n, k) or (n k).
For example, if you have 5 books and want to choose 2 of them, there are exactly 10 unique pairs. That value is C(5,2) = 10.
The combination formula
Here, “!” means factorial. So 5! = 5 × 4 × 3 × 2 × 1 = 120. The formula works for whole numbers with 0 ≤ k ≤ n.
Quick example
Compute C(10,3):
- 10! = 3,628,800
- 3! = 6
- 7! = 5,040
- C(10,3) = 3,628,800 ÷ (6 × 5,040) = 120
Why use an n choose k calculator?
Factorials grow very quickly, and hand calculations become tedious even for moderate values. A calculator is faster, avoids arithmetic mistakes, and lets you explore scenarios instantly.
- Statistics: binomial probabilities and sampling problems
- Data science: feature subset counts
- Games: card hands and lottery odds
- Operations research: selection and scheduling combinations
n choose k vs permutations
It is common to confuse combinations with permutations:
- Combinations (n choose k): order does not matter
- Permutations (nPk): order does matter
For example, selecting Alice then Bob is the same as selecting Bob then Alice in combinations—but different in permutations.
Useful properties of C(n, k)
Symmetry
C(n, k) = C(n, n-k). Choosing k items is equivalent to choosing which n-k items to leave out.
Edge values
- C(n, 0) = 1
- C(n, n) = 1
- C(n, 1) = n
Pascal’s identity
C(n, k) = C(n-1, k-1) + C(n-1, k). This identity builds Pascal’s Triangle and appears throughout probability theory.
Common mistakes to avoid
- Entering decimals or negative values
- Using k > n (not valid for combinations)
- Using combinations when order actually matters
- Doing factorials directly for huge values and running into overflow in basic calculators
FAQ
Can I use very large n and k?
Yes. This tool uses exact integer arithmetic with JavaScript BigInt, so it can return exact whole-number results for large inputs.
What if k equals 0?
The result is always 1. There is exactly one way to choose nothing.
What is 52 choose 5?
It is 2,598,960, the number of unique 5-card poker hands from a 52-card deck.
Final thought
The n choose k calculator is one of those small tools that can save a lot of time in math, probability, and planning work. Plug in your values, verify assumptions quickly, and move on with confidence.