Mathematics
Counting, Permutations, Combinations, and the Binomial Theorem
Quick fact
The Binomial Theorem was known to mathematicians in ancient India, and in 1654 Blaise Pascal's work on the triangle (named after him) formalized the connection between combinations and binomial expansion.
Why this is interesting
You have 3 shirts and 2 pairs of pants. How many outfits can you create? That's easy—but what if you have to arrange 5 books on a shelf, or choose a committee from 20 people? The answers hide a pattern that also helps expand (x+y)^n without multiplying it out. Curious?
Read the full explanation
Understanding Counting, Permutations, Combinations, and the Binomial Theorem
Let's start with the basics. The Fundamental Counting Principle says: if there are m ways to do one thing and n ways to do another, then there are m×n ways to do both. For example, with 3 shirts and 2 pants, you have 3×2 = 6 outfits. Now, permutations count arrangements where order matters. If you have 5 books and want to arrange them on a shelf, the first spot has 5 choices, then 4, then 3, then 2, then 1—so 5×4×3×2×1 = 120 ways. This is 5! (5 factorial). More generally, the number of ways to arrange r items from n distinct items is written as nPr = n! / (n-r)!. For example, from 3 letters A,B,C, the 2-letter permutations are AB, BA, AC, CA, BC, CB—six in total, which matches 3P2 = 3!/(1)! = 6. Combinations count selections where order does not matter. If you choose 2 books from 5 to take on a trip, the order doesn't matter—the pair {book1, book2} is the same as {book2, book1}. To get combinations, we divide permutations by the number of ways to order the chosen items. This gives nCr = n! / (r! (n-r)!). For 5 books choose 2, that's 5!/(2!3!) = 10. Notice that in permutations, each combination appears r! times. Now, the Binomial Theorem connects these counting ideas to algebra. It tells us how to expand (x + y)^n. For example, (x+y)^2 = x^2 + 2xy + y^2. The coefficients 1,2,1 are exactly the combination numbers: 2C0, 2C1, 2C2. In general, (x+y)^n = sum{k=0}^{n} (nCk) x^(n-k) y^k. So the coefficient of each term is the number of ways to choose which k of the n factors contribute a 'y' (or an 'x'). This is why Pascal's Triangle—where each number is the sum of the two above—gives these coefficients, because of the identity nCr = (n-1)C(r-1) + (n-1)Cr.
A deeper explanation
The underlying principle is that counting problems reduce to sequences of choices, and the product rule lets us multiply the number of choices at each step. When order matters, we count permutations; when it doesn't, we divide by the number of equivalent orderings, yielding combinations. The binomial coefficient nCk is literally the number of ways to choose k items from n, and the Binomial Theorem is a direct application: when you multiply (x+y) by itself n times, each term corresponds to a choice of either x or y from each factor. The coefficient counts how many ways you can get a particular power of x and y. This connection is powerful: it links combinatorics to polynomial algebra and probability. For example, the probability of getting exactly k heads in n coin flips is nCk/2^n, because each sequence of flips is equally likely, and nCk counts the number of sequences with k heads. Understanding this mechanism allows you to compute probabilities, analyze algorithms, and even derive identities like the sum of binomial coefficients equals 2^n, which reflects that there are 2^n subsets of an n-element set.