c(n, k) is the number of ways to choose k objects from n distinct objects when order does not matter. In combinatorics, it is the binomial coefficient and is written as \(\binom{n}{k}\).
c(n, k) is the binomial coefficient in Combinatorics, and it counts how many ways you can choose k items from a set of n distinct items when order does not matter. If you are picking a committee, a hand of cards, or a group of toppings, c(n, k) is the move that tells you how many subsets of size k you have.
The standard formula is . The factorials are there to start with all possible arrangements of the n items, then remove the extra ordering. That is the whole point: if you first count permutations, you are counting the same selection many times, once for each ordering of the chosen k items and once for the leftover n-k items.
A good way to read it is as a subset count. For example, counts the number of 2-element subsets from a 5-element set. The answer is 10, because the pairs {A,B}, {A,C}, and so on each count once, no matter which letter you name first. That is why c(n, k) belongs in the combinations part of the course, not permutations.
There are a few built-in patterns you use a lot. First, symmetry: , because choosing k items to keep is the same as choosing n-k items to leave out. Second, the edge values are simple: and , since there is exactly one way to choose nothing or choose everything.
You will also see c(n, k) in Pascal’s triangle, where each entry is the sum of the two above it. The triangle is basically a visual map of binomial coefficients. That link matters because it ties a counting object to an algebra pattern, especially in the Binomial Theorem and in coefficient work.
A common mistake is to use c(n, k) when order actually matters. If the problem asks for arrangements, rankings, or passwords, you are probably in permutation territory instead. If it says choose, select, form a group, or make a subset, c(n, k) is usually the right tool.
c(n, k) shows up everywhere Combinatorics asks you to count selections cleanly instead of listing them one by one. It is the bridge between simple counting and more advanced ideas like binomial expansions, partitions, and counting with structure.
In counting problems, c(n, k) lets you compress a long argument into one precise expression. Instead of writing out every possible group of size k, you can count it directly and then use that number in a probability or algebra setup. That saves time and also keeps your reasoning accurate when the numbers get big.
It also gives you a language for coefficients. In the expansion of , the coefficient of is c(n, k). That means the same object that counts subsets also explains why the coefficients in the Binomial Theorem have the pattern they do. In other words, c(n, k) is not just a formula, it is the counting reason behind the algebra.
Later topics use it as a building block. Combinations with repetition modify the same idea when repeated types are allowed, and multinomial coefficients extend the logic to more than two groups. Even when you move into Stirling numbers or counting partitions, the habit of translating a problem into “how many ways to choose or group?” starts with binomial coefficients.
Keep studying COMBINATORICS Unit 8
Visual cheatsheet
view galleryFactorial
The formula for c(n, k) is built from factorials, so you need factorial notation to evaluate binomial coefficients correctly. Factorials also explain why the formula starts with all arrangements before dividing out the ordering you do not want. If you are shaky on factorials, c(n, k) will feel like a shortcut instead of a count.
Binomial Theorem
Binomial coefficients are the numbers that appear in the expansion of . The coefficient of each term comes from c(n, k), so this term is the counting side of a major algebra result. Once you know c(n, k), the pattern in binomial expansions makes much more sense.
Combinations with Repetition
Regular c(n, k) counts choices without repeats, but combinations with repetition change the setup when repeated selections are allowed. The formulas look related because they come from the same choosing idea, but the counting situation is different. If the problem allows repeats, plain c(n, k) is usually not enough on its own.
Pascal's triangle
Each entry in Pascal's triangle is a binomial coefficient, so c(n, k) appears visually as a row-and-column pattern. The triangle also shows the symmetry and recursion behind the coefficients, which can help you spot values faster than recalculating from the formula every time. It is a counting table and an algebra map at the same time.
A problem set question will usually ask you to compute a value of c(n, k), simplify it, or use it inside a counting setup. You might also see a prompt that asks for the coefficient of a term in a binomial expansion, and you would translate that directly into c(n, k). In a probability problem, you may count favorable outcomes with c(n, k) and divide by the total number of outcomes.
The main move is deciding whether order matters. If the task is “choose 3 people from 10,” you use c(10, 3). If the task is “rank 3 people from 10,” you do not. A lot of partial credit in combinatorics comes from setting up the counting model correctly, even before arithmetic is finished.
c(n, k) counts selections where order does not matter, while permutations count arrangements where order does matter. If AB and BA are the same outcome, you are in combinations. If AB and BA are different outcomes, c(n, k) is the wrong tool.
c(n, k) counts how many ways to choose k items from n distinct items when order does not matter.
The formula is , which starts with arrangements and removes the extra ordering.
A useful shortcut is symmetry: , so choosing k items is the same as leaving out n-k items.
You will see c(n, k) in Pascal’s triangle, the Binomial Theorem, and many counting and probability problems.
If the problem cares about order, c(n, k) is not the right count.
c(n, k) is the number of ways to choose k objects from a set of n distinct objects when order does not matter. It is the binomial coefficient and is usually written as . In combinatorics, it comes up whenever you are counting subsets, groups, or selections.
Use . The factorials let you count all arrangements first, then divide out the order you do not care about. For example, .
No. c(n, k) counts combinations, where order does not matter. Permutations count arrangements, where order does matter. If switching the order changes the outcome, you need a permutation, not a binomial coefficient.
It appears in the Binomial Theorem. The coefficients in the expansion of are binomial coefficients, so c(n, k) tells you the numbers in front of the terms. That is why the same counting idea shows up in both combinatorics and algebra.