The Binomial Theorem

The Binomial Theorem

Here is a truly basic result from combinatorics kindergarten.

Example

There are times when we are interested not in the full expansion of a power of a binomial, but just the coefficient on one of the terms. The gives that the coefficient of \(x^5y^8\) in \((2x-3y)^{13}\) is \(\binom{13}{5}2^{5}(-3)^8\).

Practice (1)

Try each one on paper first. Reveal the answer to check; verified ones can be opened in the solver for every step.

1. Explain how you can use to give yet another proof of the identity \[\begin{aligned}\end{aligned}\].

Symbols used here

\binom{n}{k}

binomial coefficient, "n choose k"
Number of k-element subsets of n things: n!/(k!(n−k)!).

i

imaginary unit
i² = −1.

n!

factorial
n × (n−1) × … × 1; the number of orderings of n things. 0! = 1.

\sum_{k=1}^{n} a_k

summation
Add a_k for k = 1 up to n.

\prod_{k=1}^{n} a_k

product
Multiply a_k for k = 1 up to n.

\emptyset,\ |A|

empty set, cardinality
The set with no elements; the number of elements of A.

Questions people ask

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges) — not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

자신만의 길을 찾아보세요

⌨ Type ✎ Draw

수학 문제

해결

x²√÷×π( )=∫d/dxlim[ ]sinlogeˣ

Parts of this page are adapted from Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Condensed and re-explained here; errors are ours.

에 더 Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion–exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs