Further identities in Pascal’s triangle
Prove identities by equating coefficients of x^r on both sides of an identity such as (1 + x)^n (1 + x)^n = (1 + x)^2n, including the sum of squares of a row, and compare methods of proof.
Equating coefficients
Prove that $\left({}^nC_0\right)^2 + \left({}^nC_1\right)^2 + \cdots + \left({}^nC_n\right)^2 = {}^{2n}C_n$.
Use $(1 + x)^3(1 + x)^4 = (1 + x)^7$ to show ${}^3C_0\,{}^4C_2 + {}^3C_1\,{}^4C_1 + {}^3C_2\,{}^4C_0 = {}^7C_2$.
Choosing a method
| The identity has | Try |
|---|---|
| a single sum of ${}^nC_k$ times powers | substitute a value of $x$ (5E) |
| a factor $k$ in each term | differentiate, then substitute (5E) |
| products of two coefficients | equate coefficients in a product of expansions |
| a natural story about choosing | a counting argument |
Evaluate $1^2 + 3^2 + 3^2 + 1^2$, the squares of row $3$.
${}^6C_3 = 20$.
Evaluate $\sum_{k=0}^{4}\left({}^4C_k\right)^2$.
${}^8C_4$.
Evaluate ${}^3C_0\,{}^4C_2 + {}^3C_1\,{}^4C_1 + {}^3C_2\,{}^4C_0$.
${}^7C_2$.
To prove $\sum \left({}^nC_k\right)^2 = {}^{2n}C_n$, equate the coefficients of $x^n$ in:
See Example 1.
Which fact turns ${}^nC_k\,{}^nC_{n-k}$ into $\left({}^nC_k\right)^2$?
Each row reads the same backwards.
The best first attempt at proving $\sum k\,{}^nC_k = n\,2^{n-1}$ is:
The factor $k$ comes from differentiating $x^k$.
In how many ways can $5$ people be chosen from $5$ boys and $5$ girls?
${}^{10}C_5 = \sum \left({}^5C_k\right)^2$.
In how many of those ways are exactly $2$ girls chosen?
${}^5C_2 \times {}^5C_3 = 10 \times 10$.
Find the coefficient of $x^2$ in $(1 + x)^2(1 + x)^2$.
${}^4C_2$, or $1 \cdot 1 + 2 \cdot 2 + 1 \cdot 1$.
New numbers every time. Keep going until you get five in a row.
Coaching Centre