Binomial Coefficient Calculator
Use this binomial coefficient calculator to find \(\binom{n}{k}\), also written as \(nCk\) or read as n choose k. Enter a non-negative integer value for \(n\) and a valid integer value for \(k\), then the calculator will return the exact number of combinations. The result tells you how many ways you can choose \(k\) objects from \(n\) objects when order does not matter.
This page also explains the formula, the step-by-step method, Pascal's triangle connection, binomial theorem meaning, probability use, common mistakes, and worked examples. The main goal is not only to give the answer quickly, but also to help you understand why the value appears in algebra, combinatorics, statistics, and exam questions.
What does the binomial coefficient mean?
The binomial coefficient \(\binom{n}{k}\) counts the number of unordered selections of size \(k\) from a set of \(n\) different items. If you have 8 students and want to choose 3 of them for a team, the order in which you name the students does not create a new team. That is a combination question, so the answer is \(\binom{8}{3}\).
The word binomial appears because the same numbers are the coefficients in the expansion of a binomial expression such as \((a+b)^n\). In the expansion, the coefficient of each term is a value from the row of Pascal's triangle. For example, the coefficients in \((a+b)^5\) are \(1,5,10,10,5,1\), which are \(\binom{5}{0},\binom{5}{1},\binom{5}{2},\binom{5}{3},\binom{5}{4},\binom{5}{5}\).
Main binomial coefficient formula
\[\binom{n}{k}=\frac{n!}{k!(n-k)!}\]
Where \(n\) is the total number of objects, \(k\) is the number chosen, and \(!\) means factorial. The formula is valid when \(n\) and \(k\) are integers with \(0\le k\le n\).
Stable product formula used by the calculator
\[\binom{n}{k}=\prod_{i=1}^{k}\frac{n-k+i}{i}\]
The calculator uses this product form after applying the symmetry rule \(\binom{n}{k}=\binom{n}{n-k}\). That keeps the computation shorter and avoids forming three large factorials before simplifying.
Calculate \(\binom{n}{k}\)
Enter whole numbers only. The calculator accepts \(0\le k\le n\) and gives an exact integer result.
For classroom and website speed, this tool limits \(n\) to 5000.
How to use the binomial coefficient calculator
This calculator is designed for the most common school and college use case: finding the number of combinations. It is useful when a question asks for phrases like choose, select, committee, combination, coefficient, nCr, or n choose k. It is also useful inside the binomial theorem and binomial probability formula.
- Enter the total number of available objects in the field labeled \(n\).
- Enter the number of objects you want to choose in the field labeled \(k\).
- Make sure both values are whole numbers and that \(0\le k\le n\).
- Press the calculate button to get the exact value of \(\binom{n}{k}\).
- Read the interpretation line below the answer to understand what the number means in a counting context.
Important rule: use a binomial coefficient when order does not matter. If the arrangement order matters, you are usually dealing with permutations instead. Choosing Alice, Ben, and Cara for a group is the same group as choosing Cara, Alice, and Ben. But arranging Alice, Ben, and Cara in first, second, and third positions is different from arranging Cara, Alice, and Ben in those positions.
Formula and variable meanings
The binomial coefficient formula is one of the most important formulas in discrete mathematics. It removes repeated arrangements from the total number of ordered selections. The factorial expression is the easiest form to recognize, while the product expression is often better for efficient calculation.
\[\binom{n}{k}=\frac{n!}{k!(n-k)!}\]
- \(n\) = total number of distinct items available.
- \(k\) = number of items selected.
- \(n!\) = factorial of \(n\), meaning \(n(n-1)(n-2)\cdots 2\cdot 1\).
- \(k!\) = number of ways to rearrange the chosen \(k\) objects.
- \((n-k)!\) = factorial of the number of objects not chosen.
The denominator is what turns an ordered count into an unordered count. If you first count all ordered choices, every final group is counted many times because the same objects can be listed in many different orders. Dividing by \(k!\) removes those repeated orderings. The additional \((n-k)!\) factor appears when the formula is derived from the factorial count of all possible arrangements of the full set.
A useful second form is the cancellation form. It is usually the most practical form for hand calculation because many factors cancel before you multiply.
\[\binom{n}{k}=\frac{n(n-1)(n-2)\cdots(n-k+1)}{k!}\]
For example, \(\binom{10}{3}\) can be written as \(\frac{10\cdot 9\cdot 8}{3\cdot 2\cdot 1}\). That is much faster than writing out \(10!\), \(3!\), and \(7!\) separately.
Worked examples
Example 1: Calculate \(\binom{10}{3}\)
Suppose a teacher wants to choose 3 students from a group of 10 students. Since the order of the students does not matter, use the binomial coefficient formula.
\[\binom{10}{3}=\frac{10!}{3!(10-3)!}=\frac{10!}{3!7!}\]
Cancel the repeated \(7!\) factor from the numerator:
\[\binom{10}{3}=\frac{10\cdot 9\cdot 8}{3\cdot 2\cdot 1}=\frac{720}{6}=120\]
So there are \(120\) different groups of 3 students that can be chosen from 10 students.
Example 2: Calculate \(\binom{6}{2}\)
If a club has 6 members and needs to choose 2 representatives, the number of possible pairs is:
\[\binom{6}{2}=\frac{6!}{2!4!}=\frac{6\cdot 5}{2\cdot 1}=15\]
There are \(15\) possible pairs. Notice that choosing member A then member B is the same pair as choosing member B then member A, so order is ignored.
Example 3: Coefficient in a binomial expansion
Find the coefficient of \(a^4b^3\) in \((a+b)^7\). The binomial theorem says:
\[(a+b)^n=\sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k\]
For the term \(a^4b^3\), we have \(n=7\) and \(k=3\), because the exponent of \(b\) is 3. The coefficient is:
\[\binom{7}{3}=\frac{7!}{3!4!}=35\]
So the term is \(35a^4b^3\).
Example 4: Use symmetry to simplify
Calculate \(\binom{20}{18}\). Directly using \(k=18\) would be possible, but the symmetry rule makes the calculation much shorter:
\[\binom{20}{18}=\binom{20}{2}\]
Now calculate:
\[\binom{20}{2}=\frac{20\cdot 19}{2\cdot 1}=190\]
So \(\binom{20}{18}=190\). This makes sense because choosing 18 objects to include is equivalent to choosing 2 objects to leave out.
Example 5: Binomial probability use
In probability, the binomial coefficient counts how many ways a certain number of successes can occur. If a coin is tossed 5 times, the number of ways to get exactly 2 heads is:
\[\binom{5}{2}=10\]
The full binomial probability formula is:
\[P(X=k)=\binom{n}{k}p^k(1-p)^{n-k}\]
If the coin is fair, \(p=0.5\), so:
\[P(X=2)=\binom{5}{2}(0.5)^2(0.5)^3=10(0.5)^5=0.3125\]
The binomial coefficient is not the probability by itself. It is the counting part of the probability formula.
Why the formula works
The reason the formula works is that a selection problem can be temporarily treated as an arrangement problem. Imagine selecting \(k\) items from \(n\) items. If order mattered, the number of ordered selections would be:
\[P(n,k)=\frac{n!}{(n-k)!}\]
This is the permutation formula. It counts every ordering of the chosen items separately. However, a combination does not care about the order of the chosen items. Each group of \(k\) selected items has \(k!\) possible internal arrangements. Therefore, we divide the permutation count by \(k!\):
\[\binom{n}{k}=\frac{P(n,k)}{k!}=\frac{n!}{k!(n-k)!}\]
This explanation is useful because it helps you decide when to use combinations and when to use permutations. If the same selected objects form the same outcome regardless of order, use combinations. If different orders create different outcomes, use permutations. In many exam questions, the most important part is not typing the formula correctly, but identifying whether order matters.
The same number also appears in the binomial theorem because each term in an expansion represents a choice. When expanding \((a+b)^n\), you multiply \(n\) factors:
\[(a+b)(a+b)(a+b)\cdots(a+b)\]
To produce a term containing \(b^k\), you must choose \(k\) of the \(n\) factors to contribute a \(b\). The other \(n-k\) factors contribute \(a\). The number of ways to choose those \(k\) positions is \(\binom{n}{k}\), which becomes the coefficient of \(a^{n-k}b^k\).
Pascal's triangle and symmetry
Pascal's triangle is a visual way to organize binomial coefficients. Row \(n\) contains all values from \(\binom{n}{0}\) to \(\binom{n}{n}\). The first few rows are:
| Row | Binomial coefficients | Expansion connection |
|---|---|---|
| \(n=0\) | 1 | \((a+b)^0=1\) |
| \(n=1\) | 1, 1 | \((a+b)^1=a+b\) |
| \(n=2\) | 1, 2, 1 | \((a+b)^2=a^2+2ab+b^2\) |
| \(n=3\) | 1, 3, 3, 1 | \((a+b)^3=a^3+3a^2b+3ab^2+b^3\) |
| \(n=4\) | 1, 4, 6, 4, 1 | \((a+b)^4=a^4+4a^3b+6a^2b^2+4ab^3+b^4\) |
| \(n=5\) | 1, 5, 10, 10, 5, 1 | \((a+b)^5=a^5+5a^4b+10a^3b^2+10a^2b^3+5ab^4+b^5\) |
Pascal's triangle follows the identity:
\[\binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k}\]
This means each interior number is the sum of the two numbers above it. For example, the 6 in row 4 comes from 3 + 3 in row 3. This identity is more than a pattern. It has a counting interpretation. To choose \(k\) objects from \(n\) objects, focus on one special object. Either the special object is included, leaving \(k-1\) choices from the remaining \(n-1\), or the special object is not included, leaving \(k\) choices from the remaining \(n-1\). These two cases add together.
The symmetry rule is another key identity:
\[\binom{n}{k}=\binom{n}{n-k}\]
This rule explains why Pascal's triangle reads the same from left to right and right to left in each row. It also makes calculation easier. Choosing 2 people to exclude from a group of 20 is equivalent to choosing 18 people to include, so both counts are \(\binom{20}{2}=\binom{20}{18}\).
Common values and quick reference
The table below gives common binomial coefficient values. These appear often in probability, algebra, combinatorics, and binomial theorem questions.
| Expression | Value | Meaning |
|---|---|---|
| \(\binom{5}{2}\) | 10 | Choose 2 objects from 5 objects. |
| \(\binom{6}{3}\) | 20 | Choose 3 objects from 6 objects. |
| \(\binom{7}{3}\) | 35 | Coefficient of \(a^4b^3\) in \((a+b)^7\). |
| \(\binom{8}{4}\) | 70 | Middle coefficient in row 8 of Pascal's triangle. |
| \(\binom{10}{3}\) | 120 | Choose 3 objects from 10 objects. |
| \(\binom{12}{2}\) | 66 | Number of unordered pairs from 12 objects. |
| \(\binom{20}{2}\) | 190 | Number of unordered pairs from 20 objects. |
Binomial coefficient in the binomial theorem
The binomial theorem is one of the most important places where binomial coefficients appear. It gives a structured way to expand powers of two-term expressions. Instead of multiplying \((a+b)\) many times, the theorem gives every term directly:
\[(a+b)^n=\sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k\]
In this formula, \(\binom{n}{k}\) is the coefficient, \(a^{n-k}\) is the power of the first term, and \(b^k\) is the power of the second term. As \(k\) increases from 0 to \(n\), the power of \(a\) decreases while the power of \(b\) increases.
For example, expanding \((x+2)^4\) gives:
\[(x+2)^4=\binom{4}{0}x^4+\binom{4}{1}x^3(2)+\binom{4}{2}x^2(2)^2+\binom{4}{3}x(2)^3+\binom{4}{4}(2)^4\]
Now simplify each coefficient:
\[(x+2)^4=x^4+8x^3+24x^2+32x+16\]
The binomial coefficient calculator helps with the coefficient part. When the expression also contains constants such as \(2\), \(-3\), or fractional terms, you must still multiply the binomial coefficient by the appropriate powers of those constants.
For more direct study notes on this topic, you can connect this calculator with the NUM8ERS binomial theorem guide. That page explains binomial expansion patterns, term selection, and exam-style worked examples.
Binomial coefficient in probability
In probability, binomial coefficients count the number of ways a fixed number of successes can be placed among a fixed number of trials. This is why the value appears in the binomial distribution formula. If \(X\) counts the number of successes in \(n\) independent trials, and the probability of success on each trial is \(p\), then:
\[P(X=k)=\binom{n}{k}p^k(1-p)^{n-k}\]
The part \(p^k(1-p)^{n-k}\) gives the probability of one specific pattern with \(k\) successes and \(n-k\) failures. The part \(\binom{n}{k}\) counts how many different positions those successes could occupy. For example, in 5 coin tosses, exactly 2 heads could occur as HHTTT, HTHTT, HTTHT, and several other patterns. The binomial coefficient counts all those patterns without listing them one by one.
This is why students should not treat the binomial coefficient as a probability. It is a count. The full probability comes after multiplying by the probability of each success and failure pattern. If you are studying binomial distributions, see the NUM8ERS binomial and normal distributions guide and the NUM8ERS probability formulas guide.
Common mistakes when calculating binomial coefficients
1. Using combinations when order matters
The biggest mistake is using \(\binom{n}{k}\) for a problem where order matters. If a question asks for a committee, group, set, or selection, combinations are usually correct. If a question asks for a password, race result, seating order, or ranked arrangement, permutations may be needed instead.
2. Forgetting the condition \(0\le k\le n\)
You cannot choose more objects than are available. For ordinary school-level binomial coefficients, \(\binom{n}{k}\) is defined for non-negative integer \(n\) and integer \(k\) from 0 to \(n\). Some advanced mathematics extends the notation in different ways, but this calculator uses the standard combinatorics definition.
3. Expanding factorials too far
Students often write out large factorials unnecessarily. For \(\binom{30}{2}\), you do not need to write all factors from 30 down to 1. Use cancellation: \(\binom{30}{2}=\frac{30\cdot29}{2}=435\).
4. Ignoring the symmetry rule
Calculating \(\binom{50}{48}\) directly is much longer than recognizing that \(\binom{50}{48}=\binom{50}{2}\). Choosing 48 to include is equivalent to choosing 2 to exclude.
5. Confusing coefficient position in the binomial theorem
In \((a+b)^n\), the coefficient of \(a^{n-k}b^k\) is \(\binom{n}{k}\). Students sometimes match \(k\) with the exponent of \(a\) instead of the exponent of \(b\). Always compare the term with the theorem carefully.
When should you use this calculator?
Use this binomial coefficient calculator when you need an exact value for a combination, coefficient, or counting expression. It is especially helpful for algebra problems involving the binomial theorem, probability problems involving binomial distributions, and counting problems where order does not matter. Because it returns exact integer output, it is better for learning than a decimal approximation in many classroom situations.
Here are common question patterns where the calculator fits:
- How many ways can 4 students be selected from 12 students?
- What is the value of \(\binom{15}{5}\)?
- What is the coefficient of a term in a binomial expansion?
- How many ways can exactly 3 successes occur in 10 binomial trials?
- What number appears in a specific row of Pascal's triangle?
The calculator is not meant to replace understanding. It gives the number quickly, but the examples and explanations on this page show how to decide whether the number is the correct mathematical model for your problem. That decision is essential in exams, because a correct formula applied to the wrong situation still gives the wrong answer.
Deeper interpretation for students
A binomial coefficient is simple to calculate once the formula is known, but its real value is that it connects several different ideas. In algebra, it describes the coefficient pattern in a binomial expansion. In counting, it describes the number of unordered selections. In probability, it describes how many success-failure patterns have the same probability structure. In statistics, it appears whenever a binomial random variable is used to model repeated independent trials. Because the same notation appears in different topics, students often think the symbol has several unrelated meanings. A better way to study it is to remember that each meaning is based on the same selection idea.
For example, the expression \(\binom{9}{4}\) can be read in several correct ways. It can mean the number of ways to choose 4 students from 9 students. It can mean the coefficient of \(a^5b^4\) in \((a+b)^9\). It can mean the number of ways to place 4 successes among 9 binomial trials. It can also mean one entry in row 9 of Pascal's triangle. These are not separate formulas. They are separate contexts for the same count.
This is also why binomial coefficients are always whole numbers in the standard combinatorics setting. The factorial formula contains division, but the final result is an integer because it counts actual possible selections. If you calculate \(\frac{n!}{k!(n-k)!}\) and get a decimal, then something has gone wrong in your arithmetic or your input values are not valid for the ordinary combination meaning. A combination count cannot be 12.5 groups. It must be a whole number.
Another useful interpretation is the complement idea. Choosing \(k\) objects to include is exactly the same as choosing \(n-k\) objects to leave out. This is the meaning behind the symmetry identity \(\binom{n}{k}=\binom{n}{n-k}\). It is not just a shortcut; it is a way to understand the structure of the problem. If a question asks how many ways to choose 18 players from a squad of 20, it may be easier to think about choosing the 2 players who are not selected.
When the numbers are large, the binomial coefficient can become enormous very quickly. This growth is one reason binomial coefficients are important in probability. Even when each exact pattern has a small probability, the number of patterns may be large enough to make a certain outcome reasonably likely. For example, in repeated coin tossing, getting exactly half heads becomes the most common single count near the center, but the individual arrangements are numerous. The binomial coefficient is the part of the formula that counts those arrangements.
For exam work, always write down what the result represents. A final answer such as \(\binom{12}{5}=792\) is more meaningful when followed by a sentence such as: there are 792 ways to choose 5 objects from 12 objects when order is ignored. This habit prevents common errors because it forces you to check whether the answer fits the context. If the context is a ranked list, a seating order, or a code where positions matter, then a binomial coefficient may be the wrong tool.
The calculator on this page is therefore best used in two stages. First, use it to get the exact value quickly. Second, compare the result with the original question: does the result count groups, coefficients, or success patterns? If yes, the binomial coefficient is probably the correct model. If the problem involves sequence, rank, or arrangement, review whether a permutation formula is needed instead.
Related Num8ers resources
Continue studying with related Num8ers pages that connect directly to binomial coefficients, probability, and algebra.
Binomial theorem guide
Use this when you want expansion formulas, coefficient examples, and IB-style practice.
Binomial distribution guide
Use this when the coefficient appears inside a probability calculation.
Probability formulas
Use this for combinations, permutations, conditional probability, and probability rules.
Frequently asked questions
What is a binomial coefficient?
A binomial coefficient is a number written as \(\binom{n}{k}\). It counts the number of ways to choose \(k\) objects from \(n\) objects when order does not matter. It is also the coefficient of a term in the expansion of \((a+b)^n\).
What is the formula for n choose k?
The standard formula is \(\binom{n}{k}=\frac{n!}{k!(n-k)!}\). It works for non-negative integers where \(0\le k\le n\).
Is nCk the same as a binomial coefficient?
Yes. The notations \(nCk\), \(C(n,k)\), and \(\binom{n}{k}\) usually refer to the same value: the number of combinations of \(n\) objects chosen \(k\) at a time.
Why is \(\binom{n}{0}=1\)?
There is exactly one way to choose nothing from a set: choose the empty selection. That is why \(\binom{n}{0}=1\). Similarly, \(\binom{n}{n}=1\) because there is exactly one way to choose all objects.
What is the difference between combinations and permutations?
Combinations ignore order, while permutations care about order. Choosing 3 people for a team is a combination. Ranking 3 people as first, second, and third is a permutation. The binomial coefficient is used for combinations.
How is the binomial coefficient used in probability?
In a binomial probability problem, \(\binom{n}{k}\) counts how many ways \(k\) successes can occur in \(n\) trials. The full formula is \(P(X=k)=\binom{n}{k}p^k(1-p)^{n-k}\).
Can k be greater than n?
In the standard combinations meaning used by this calculator, no. You cannot choose more items than are available, so \(k\) must satisfy \(0\le k\le n\).
Why does the calculator use a product formula?
The product formula gives the same answer as the factorial formula, but it avoids unnecessarily large intermediate factorials. This makes the calculation faster and cleaner, especially for larger values of \(n\).