The nCr formula counts how many ways to choose r items from n distinct items when the order of the chosen items does not matter. It is the standard formula for combinations in counting and probability.
For the five-card poker hand, the answer is exactly $\binom{52}{5} = 2{,}598{,}960$. Order does not matter — the same five cards in any sequence form the same hand — so combinations, not permutations, give the count.
The nCr Formula
$$ \boxed{,\binom{n}{r} ;=; {}^{n}C_{r} ;=; \frac{n!}{r!,(n-r)!},} $$
Three equivalent notations are in common use: $\binom{n}{r}$ (modern, preferred in textbooks), ${}^{n}C_{r}$ (traditional, common in Indian and UK curricula), and $C(n, r)$ (used in some computer-science texts). They mean the same thing.
Variable Key
Symbol | Meaning |
|---|---|
| The total number of distinct items available to choose from. Must be a non-negative integer. |
| The number of items being chosen. Must satisfy |
|
|
$\binom{n}{r}$ | Read as "n choose r" — the number of distinct combinations. |
When To Use The nCr Formula
Use nCr whenever the question is "how many ways can I pick r items from n items if rearranging the picks does not count as a new pick?" Three quick tests confirm a combination problem.
Order is irrelevant. Choosing students A, B, C for a committee is the same committee as choosing C, B, A.
No item is reused. Each of the
nitems can be picked at most once.All n items are distinct. Two identical items are not treated as different choices.
If any test fails, a different counting tool applies — permutations (nPr) when order matters, or repetition-with-replacement formulas when items can repeat.
Worked Examples of nCr Formula
Example 1: A class of 10 students must elect a 3-member committee. How many committees are possible?
n = 10, r = 3
Substitute into the formula: $\displaystyle \binom{10}{3} = \frac{10!}{3!,(10-3)!} = \frac{10!}{3!,7!}$
Cancel the 7!: $\displaystyle \binom{10}{3} = \frac{10 \times 9 \times 8}{3!} = \frac{720}{6}$
Final answer: 120 committees.
Example 2: From a deck of 52 cards, how many distinct 5-card hands can be dealt?
n = 52, r = 5
Substitute into the formula: $\displaystyle \binom{52}{5} = \frac{52!}{5!,47!}$
Cancel the 47!: $\displaystyle \binom{52}{5} = \frac{52 \times 51 \times 50 \times 49 \times 48}{5!}$
Compute the numerator: $52 \times 51 \times 50 \times 49 \times 48 = 311{,}875{,}200$
Divide by 5! = 120: $\displaystyle \binom{52}{5} = \frac{311{,}875{,}200}{120}$
Final answer: 2,598,960 hands.
Where The nCr Formula Comes From
A short derivation makes the formula memorable in a way memorisation never does. The argument moves from permutations to combinations in a single step.
The number of ways to arrange r items chosen from n distinct items is the permutation count: $\displaystyle {}^{n}P_{r} = \frac{n!}{(n-r)!}$
Each unordered group of r items can be arranged in r! different orders. So every single combination has been counted exactly r! times in the permutation count.
To convert permutations to combinations, divide by that overcount: $\displaystyle \binom{n}{r} = \frac{{}^{n}P_{r}}{r!} = \frac{n!}{r!,(n-r)!}$
This is the nCr formula. The r! in the denominator is not a piece of magical algebra — it is the exact number of ways the same r chosen items can be reshuffled, which combinations are not allowed to count as different.
Why Combinations Exist - The WHY
Combinations were not invented to make exams harder. They were invented because counting "the number of distinct outcomes" is the foundation of probability, and probability is how humans reason under uncertainty.
Genetics depends on it. When two parents each contribute a chromosome from a pair, the number of distinct genetic combinations a single child can inherit runs into the trillions. Counting those combinations is what makes the hereditary risk calculations published by the U.S. National Library of Medicine possible.
Cryptography depends on it. A 256-bit AES key has $\binom{256}{128}$ possible weight-128 patterns — a number large enough that brute-force attacks are infeasible on current hardware.
Lottery odds depend on it. A standard 6-from-49 draw has $\binom{49}{6} = 13{,}983{,}816$ possible tickets. The probability of winning the jackpot with one ticket is the reciprocal of that — roughly 1 in 14 million.
The thread across all three is the same: the question "how many ways can this happen?" has to be answered before any probability or risk can be assigned to it. The nCr formula is the answer-engine for that question whenever order does not matter.
nCr Beyond The Textbook
The same formula travels across fields that look unrelated.
Biology: counting the number of distinct DNA microarrays a researcher can generate by selecting genes from a pool.
Cryptography: counting the number of weight-
rbinary patterns in error-correcting codes used by satellites and storage systems.Quality control: counting the number of distinct sample groups when auditing a production batch.
Epidemiology: counting the number of distinct contact pairs in a population to model disease spread.
One formula. Four sciences. Mathematics is the common language across fields that look unrelated.
Mathematicians and history behind the nCr formula
The mathematician who counted before the alphabet had names
Mathematician: Al-Khalīl ibn Aḥmad al-Farāhīdī
Date and place: 8th century, Basra (modern-day Iraq)
The story: Al-Khalīl was a linguist who wanted to catalogue every possible word in Arabic. To do that, he had to count how many distinct letter combinations could be formed from a given set of letters. He worked out the rules for combinations and permutations roughly a thousand years before they appeared in European mathematics. His motivation was not abstract — he was building the first Arabic dictionary, the Kitāb al-ʿAyn, and needed the count to know how many words his lexicon would have to define.
Why it matters: Combinatorics did not begin as a branch of mathematics. It began as a tool for an 8th-century lexicographer who refused to assume anything about language without first counting the possibilities.
Two other figures left their fingerprints on the formula as we know it today.
Bhāskara II (12th century, India) — derived combination identities in the Līlāvatī, treating them alongside arithmetic and word problems for general readers.
Blaise Pascal (17th century, France) — gave us Pascal's triangle and the recursive identity $\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}$, which is still the fastest way to compute small
nCrvalues without factorials.
Common Mistakes When Applying The nCr Formula
1. Confusing nCr with nPr. Treating order as if it matters
Where it slips in: The problem says "how many ways to choose" — which is nCr — but the student instinctively reaches for nPr because they remember "arrangements." The numerical answer comes out exactly r! times too large.
Don't do this: Use nPr whenever the word "choose" appears.
The correct way: If swapping two of the chosen items produces what the problem treats as the same outcome, use nCr. If swapping produces a different outcome, use nPr. For a 3-member committee from 10 students, swapping members does not change the committee, so nCr is correct: $\binom{10}{3} = 120$, not $^{10}P_3 = 720$.
2. Forgetting that 0! equals 1. Treating zero-factorial as undefined or zero
Where it slips in: The student computes $\binom{n}{0}$ or $\binom{n}{n}$ and stalls because the denominator contains 0!, which they believe is zero or undefined.
Don't do this: Treat 0! = 0 or skip the calculation.
The correct way: By convention, 0! = 1. So $\binom{n}{0} = \binom{n}{n} = 1$ — there is exactly one way to choose nothing, and exactly one way to choose everything.
3. Mishandling repeated items. Applying nCr when items are not distinct
Where it slips in: A bag contains 4 red balls and 3 blue balls, and the question asks for the number of ways to draw 2 balls. The student plugs n = 7, r = 2 into nCr and reports 21.
Don't do this: Apply nCr directly when some items are identical.
The correct way: nCr requires n distinct items. When some are identical, count by type rather than by item: the distinct outcomes are {2 red}, {2 blue}, {1 red and 1 blue} — three outcomes, not 21. The 21-figure counts physical pairs of balls; the question asks for distinct colour outcomes.
A real-world version of mistake 1
In 1969, the U.S. ran a draft lottery for the Vietnam War by drawing 366 capsules — one per birthday — to set the order of induction. Analysts later showed the capsules had not been mixed thoroughly, and dates from later months kept getting drawn earlier than chance allowed.
Permutation–combination counting was the tool that proved the bias: the observed pattern would occur in fewer than 1 in 1,000 truly random draws. The case is now a standard teaching example on randomisation and selection bias — a reminder that confusing "order matters" with "order is fair" can carry real consequences.
Was this article helpful?
Your feedback helps us write better content
