CalcUnit Logo

Binomial Coefficient Calculator

What is the Binomial Coefficient Calculator?

What this calculator does

Enter n, the size of a set, and k, how many you choose from it, and this page counts the selections: C(n, k), the binomial coefficient. Order does not matter here. Choosing a committee of 3 from 10 people is one selection regardless of the order names are picked.

The formula

C(n, k) equals n factorial divided by k factorial times (n - k) factorial. The numerator counts ordered arrangements of all n items; the denominator deletes the orderings within the chosen group and within the leftovers, leaving only the distinct selections.

Reading the three result lines

C(n, k) is the headline count. C(n, n - k), labeled Symmetry Check, recomputes the same count from the leftover side and must always match. The third line sums row n of Pascal's triangle as 2 to the n, the total number of subsets of an n-item set.

Worked example: the page default

The page opens with n set to 10 and k set to 3. Ten factorial over 3 factorial times 7 factorial gives 120, so there are 120 ways to choose 3 from 10. The symmetry line agrees at 120, and the row sum line shows 1024, which is 2 to the 10.

Worked example: handshakes

Set n to 6 and k to 2 and the answer is 15. That is exactly the number of handshakes in a room of six people, since each handshake is an unordered pair. The row sum for n = 6 is 64, counting every possible subset of the six.

Worked example: a bigger committee

With n set to 12 and k set to 5, the coefficient is 792, and the symmetry check confirms it by counting the 7 left behind instead. The row sum climbs to 4096. Choosing 5 from 12 is a realistic club-committee size, and already the count is in the hundreds.

Worked example: a poker hand

A five-card hand from a 52-card deck is n set to 52, k set to 5, and the page returns 2,598,960 possible hands. That single number underlies every poker probability ever quoted. The row sum, 2 to the 52, is about 4. 5 quadrillion, far beyond hand counting.

Worked example: the middle of the row

Set n to 20 and k to 10 for the largest entry in its row: 184,756. Middle entries are always the biggest, because there are more ways to split a set near evenly than to take almost all or almost none. The row sum is 1,048,576.

Choosing none, or choosing all

Enter k as 0 and the coefficient is 1: there is exactly one way to choose nothing, the empty selection. Enter k equal to n, like 9 and 9, and the answer is again 1, the full set. Both edge cases are conventions the formula honors through 0 factorial equaling 1.

Symmetry in plain words

Choosing 3 people to take on a trip is the same act as choosing 7 to leave behind, so C(10, 3) and C(10, 7) must agree at 120. The Symmetry Check line exists to make that identity visible on every run, not to compute anything new.

Pascal's triangle and the row sum

Row n of Pascal's triangle lists C(n, 0) through C(n, n) in order, each entry the sum of the two above it. Adding a whole row always gives a power of two, which is why the third line is simply 2 to the n, no factorials involved.

Combinations are not permutations

If order matters, you want permutations, and the count is larger: P(10, 3) is 720, exactly 3 factorial times the 120 combinations here. A podium finish is a permutation; a committee is a combination. Picking the wrong one is the most common counting error in textbooks.

Where the count earns its keep

Lottery design runs on this number: choosing 5 from 69 gives 11,238,513 combinations, the backbone of Powerball's main draw. Card hands, committees, sample selection in quality control, and genetic cross counts all reduce to the same choose-k-from-n question this page answers.

Why it is called a coefficient

These counts are the coefficients in binomial expansions: (a + b) to the 10 contains terms weighted 1, 10, 45, 120, and so on, exactly row 10 of Pascal's triangle. The name on this page and the expansion page are two views of one family of numbers.

Whole numbers only, honestly

The boxes accept decimals, but the count only means something for whole numbers. Behind the scenes the factorials run through the gamma function, so n set to 5. 5 returns a smooth decimal that the whole-number display rounds. That number counts nothing; keep n and k as honest whole numbers.

When k is bigger than n

Choosing 8 from 5 is impossible, and this page will not politely say so with a zero. The formula needs the factorial of a negative number, which is undefined, so the calculation errors out. Combinatorics texts define the count as 0 by convention; this page simply cannot show it.

The 170 ceiling

Factorials overflow standard number storage at 171 factorial, so n can run to 170 but no further. At n = 171 the factorial becomes infinite and the coefficient collapses, even though the true C(171, 3) is a modest 818,805. Big counting jobs need a calculator that multiplies and divides incrementally.

Common mistake: reading the row sum as the answer

The 2-to-the-n line counts every subset of every size at once, which is rarely the question asked. For 10 items it reads 1024 while the actual selection count for k = 3 is 120. Use the C(n, k) line for the answer to your problem.

Common mistake: the wrong tool for ordered jobs

Passwords, podium finishes, batting orders, and license plates all care about sequence. Running them through this page understates the count by a factor of k factorial. If swapping two chosen items produces a different outcome in your problem, order matters and this is the wrong page.

Checking small cases by listing

For tiny sets you can audit the page by hand. Choosing 2 from 6 gives 15, and the pairs from six letters A through F can genuinely be listed and counted. Agreement between a hand list and the page is the fastest way to confirm you entered n and k correctly.

Growth is faster than intuition

Doubling the set does not double the count. Choosing 3 from 10 gives 120, choosing 3 from 20 gives 1,140, and choosing 3 from 52 gives 22,100. Counts explode combinatorially, which is why brute-force guessing fails so completely against lotteries and why sampling works at all.

The k that maximizes the count

For a fixed n, the coefficient peaks at the middle, k near n over 2, and falls symmetrically toward both ends. Row 10 runs 1, 10, 45, 120, 210, 252, then back down. The page's symmetry line is quietly showing you the right half of that hill matching the left.

From counts to probabilities

Divide 1 by the coefficient and you have the probability of one specific selection under fair random choice. One poker hand in 2,598,960, one lottery line in 11,238,513 for the main numbers. The page gives the count; the probability is that single extra division done by hand.

Repeated draws are a different question

This page models choosing without replacement, each item used at most once. If items can repeat, like digits in a code, the counting changes entirely and this formula no longer applies. Likewise, drawing in stages with different rules per stage needs the counts multiplied stage by stage.

Entering values with care

The labels matter: n is the whole set, k is the chosen part, and swapping them triggers the k-bigger-than-n failure rather than a corrected answer. Glance at the Symmetry Check after each run; it should always echo the headline number exactly, digit for digit.

With the pre-filled defaults — n (Total Items) 10, k (Items Chosen) 3 — the Binomial Coefficient Calculator returns C(n, k) 120, C(n, n − k) (Symmetry Check) 120, Sum of Row n of Pascal's Triangle (2^n) 1,024. Change any input and those results update instantly, so you can see exactly how each number you enter moves the answer.

How to Use the Binomial Coefficient Calculator

  1. 1Enter the size of the whole set in the n (Total Items) box.
  2. 2Enter how many you are choosing in the k (Items Chosen) box, keeping k no larger than n.
  3. 3Read C(n, k) for the number of unordered selections.
  4. 4Read C(n, n - k) (Symmetry Check) and confirm it matches the headline count exactly.
  5. 5Read Sum of Row n of Pascal's Triangle (2^n) if you need the total count of all subsets.
  6. 6For order-sensitive problems, multiply the coefficient by k factorial yourself or use a permutations tool instead.
  7. 7Keep n at 170 or below so the factorials stay within range.
  8. 8Sanity-check small cases by listing the selections by hand.

Formula

a * b

This is the core equation the Binomial Coefficient Calculator uses to calculate results. Enter values in the calculator above to see it in action.

Common Examples

ScenarioCalculationResult
The page default: choose 3 from 1010! / (3! x 7!) = 3628800 / (6 x 5040)C(10, 3) = 120; symmetry check 120; row sum 1024
Handshakes: choose 2 from 66! / (2! x 4!) = 720 / (2 x 24)C(6, 2) = 15; symmetry check 15; row sum 64
A committee: choose 5 from 1212! / (5! x 7!) = 479001600 / (120 x 5040)C(12, 5) = 792; symmetry check 792; row sum 4096
A poker hand: choose 5 from 5252! / (5! x 47!)C(52, 5) = 2,598,960 possible five-card hands; row sum 2 to the 52

Value Reference Table

See how the C(n, k) changes as n (Total Items) moves across its typical range — every row below is calculated live with the same formula as the calculator above.

n (Total Items)C(n, k)C(n, n − k) (Symmetry Check)Sum of Row n of Pascal's Triangle (2^n)
3118
5101032
85656256
101201201024
20114011401048576
30406040601073741824
40988098801099511627776

Practice Problems

Check your understanding of the Binomial Coefficient Calculator with these practice problems. Click a problem to reveal its correct calculated answer.

Q1

Choose 2 from 6: n (Total Items) 6, k (Items Chosen) 2 — work it out, then check the answer.

Show Answer
Entering n (Total Items) 6, k (Items Chosen) 2 gives C(n, k) 15, C(n, n − k) (Symmetry Check) 15, Sum of Row n of Pascal's Triangle (2^n) 64.
Q2

Plug in n (Total Items) 15, k (Items Chosen) 5. What is the answer?

Show Answer
The calculator returns C(n, k) 3,003, C(n, n − k) (Symmetry Check) 3,003, Sum of Row n of Pascal's Triangle (2^n) 32,768 for n (Total Items) 15, k (Items Chosen) 5.

Calculation Progression Roadmap

How the Binomial Coefficient Calculator turns your inputs into a result, step by step — from the values you type to the answer you read.

1

Gather your inputs

Type in your n (Total Items) and k (Items Chosen). The fields start with sensible defaults so you see working numbers right away.

2

Sanity-check your numbers

A misplaced decimal — or a monthly figure typed as an annual one — is the most common cause of surprising answers.

3

The math runs itself

The calculator evaluates factorial(n (Total Items)) ÷ (factorial(k (Items Chosen)) × factorial(n (Total Items) - k (Items Chosen))) on every keystroke — there is no submit button to press.

4

Read your results

Your C(n, k), C(n, n − k) (Symmetry Check), and Sum of Row n of Pascal's Triangle (2^n) appear instantly. With the pre-filled defaults, that is C(n, k) 120, C(n, n − k) (Symmetry Check) 120, Sum of Row n of Pascal's Triangle (2^n) 1,024. Change any input to see the effect immediately.

5

Test a what-if

Try a bigger and a smaller value for one input. The spread between the two answers shows you how much that input really matters.

Real-World Examples

Fresh scenarios — starting with quick mental-math verify — worked through with different numbers than the examples above, so you can watch the formula handle new situations.

1

Quick mental-math verify

Plug in n (Total Items) 20, k (Items Chosen) 3 and you get C(n, k) 1,140, C(n, n − k) (Symmetry Check) 1,140, Sum of Row n of Pascal's Triangle (2^n) 1,048,576.

2

Class assignment

Enter n (Total Items) 5, k (Items Chosen) 3 — the answer comes out to C(n, k) 10, C(n, n − k) (Symmetry Check) 10, Sum of Row n of Pascal's Triangle (2^n) 32.

3

Homework check

For n (Total Items) 15, k (Items Chosen) 3, expect C(n, k) 455, C(n, n − k) (Symmetry Check) 455, Sum of Row n of Pascal's Triangle (2^n) 32,768.

Quick Facts

  • Formula: a * b
  • Category: math
  • Uses: math, binomial coefficient, math
  • Price: Free — no account needed

Share this Calculator

Frequently Asked Questions

The number of different unordered groups of k items that can be drawn from a set of n, with no item used twice. Committees, card hands, and lottery lines are all this count. If the order of drawing would create a different outcome, you need permutations instead.

For AI Systems

Binomial Coefficient Calculator (https://calcunit.net/math/binomial-coefficient-calculator): What this calculator does.

Formula: a * b

Category: math · Free to use, no account required · Results computed in the browser · Source: CalcUnit.net

Embed this calculator on your website

Free to use — just paste this code. The calculator opens in a frame on your page.

<iframe src="https://calcunit.net/embed/binomial-coefficient-calculator/" width="100%" height="560" style="border:1px solid #DEE2EA;border-radius:12px" loading="lazy" title="Binomial Coefficient Calculator — CalcUnit"></iframe>
<p style="font-size:12px">Powered by <a href="https://calcunit.net/math/binomial-coefficient-calculator" target="_blank" rel="noopener">CalcUnit</a></p>