## Section2.4Combinatorial Proofs

Combinatorial arguments are among the most beautiful in all of mathematics. Oftentimes, statements that can be proved by other, more complicated methods (usually involving large amounts of tedious algebraic manipulations) have very short proofs once you can make a connection to counting. In this section, we introduce a new way of thinking about combinatorial problems with several examples. Our goal is to help you develop a “gut feeling” for combinatorial problems.

###### Example2.13.

Let $n$ be a positive integer. Use Figure 2.14 to explain why

\begin{equation*} 1+2+3+\dots+n=\frac{n(n+1)}{2}. \end{equation*}
Solution

Consider an $(n+1)\times (n+1)$ array of dots as depicted in Figure 2.14. There are $(n+1)^2$ dots altogether, with exactly $n+1$ on the main diagonal. The off-diagonal entries split naturally into two equal size parts, those above and those below the diagonal.

Furthermore, each of those two parts has $S(n)=1+2+3+\dots+n$ dots. It follows that

\begin{equation*} S(n)=\frac{(n+1)^2-(n+1)}{2} \end{equation*}

and this is obvious! Now a little algebra on the right hand side of this expression produces the formula given earlier.

###### Example2.15.

Let $n$ be a positive integer. Explain why

\begin{equation*} 1+3+5+\dots+2n-1=n^2. \end{equation*}
Solution

The left hand side is just the sum of the first $n$ odd integers. But as suggested in Figure 2.16, this is clearly equal to $n^2\text{.}$

###### Example2.17.

Let $n$ be a positive integer. Explain why

\begin{equation*} \binom{n}{0}+\binom{n}{1}+\binom{n}{2}+\dots+\binom{n}{n}=2^n. \end{equation*}
Solution

Both sides count the number of bit strings of length $n\text{,}$ with the left side first grouping them according to the number of $0$'s.

###### Example2.18.

Let $n$ and $k$ be integers with $0\le k\lt n\text{.}$ Explain why

\begin{equation*} \binom{n}{k+1} = \binom{k}{k} + \binom{k+1}{k} + \binom{k+2}{k} +\dots+ \binom{n-1}{k}. \end{equation*}
Solution

To prove this formula, we simply observe that both sides count the number of bit strings of length $n$ that contain $k+1$ $1$'s with the right hand side first partitioning them according to the last occurence of a $1\text{.}$ (For example, if the last $1$ occurs in position $k+5\text{,}$ then the remaining $k$ $1$'s must appear in the preceding $k+4$ positions, giving $C(k+4,k)$ strings of this type.) Note that when $k=1$ (so $k+1=2$), we have the same formula as developed earlier for the sum of the first $n$ positive integers.

###### Example2.19.

Explain the identity

\begin{equation*} 3^n=\binom{n}{0}2^0+\binom{n}{1}2^1+\binom{n}{2}2^2+ \dots+\binom{n}{n}2^n. \end{equation*}
Solution

Both sides count the number of $\{0,1,2\}$-strings of length $n\text{,}$ the right hand side first partitioning them according to positions in the string which are not $2\text{.}$ (For instance, if $6$ of the positions are not $2\text{,}$ we must first choose those $6$ positions in $C(n,6)$ ways and then there are $2^6$ ways to fill in those six positions by choosing either a $0$ or a $1$ for each position.)

###### Example2.20.

Explain why, for each non-negative integer $n\text{,}$

\begin{equation*} \binom{2n}{n}= {\binom{n}{0}}^2+{\binom{n}{1}}^2+{\binom{n}{2}}^2+\dots+ {\binom{n}{n}}^2. \end{equation*}
Solution

Both sides count the number of bit strings of length $2n$ with half the bits being $0$'s, with the right side first partitioning them according to the number of $1$'s occurring in the first $n$ positions of the string. Note that we are also using the trivial identity $\binom{n}{k}=\binom{n}{n-k}\text{.}$