Skip to content

二项式定理 ​

对于 a, b∈Ra,\, b \in \mathbb{R} 和 n∈N∗n \in \mathbb{N}^*,有

(a+b)n=∑i=0n(ni)an−ibi\left(a + b\right)^n = \sum_{i = 0}^n \binom{n}{i} a^{n - i} b^i

证明
  1. 当 n=1n = 1 时,显然结论成立
  2. 当 n=kn = k 时,假设结论成立,有

(a+b)k=∑i=0k(ki)ak−ibi\left(a + b\right)^k = \sum_{i = 0}^k \binom{k}{i} a^{k - i} b^i

当 n=k+1n = k + 1 时,有

(a+b)k+1=(a+b)k(a+b)=(∑i=0k(ki)ak−ibi)(a+b)=∑i=0k(ki)ak−i+1bi+∑i=0k(ki)ak−ibi+1=∑i=1k+1(ki−1)ak−i+1bi−1+∑i=0k(ki)ak−ibi+1=ak+1+∑i=1k(ki−1)ak−i+1bi+∑i=1k(ki)ak−i+1bi+bk+1=ak+1+∑i=1k((ki−1)+(ki))ak−i+1bi+bk+1=ak+1+∑i=1k(k+1i)ak−i+1bi+bk+1=∑i=0k+1(k+1i)ak+1−ibi\begin{aligned} \left(a + b\right)^{k + 1} &= \left(a + b\right)^k \left(a + b\right) \\ &= \left(\sum_{i = 0}^k \binom{k}{i} a^{k - i} b^i\right) \left(a + b\right) \\ &= \sum_{i = 0}^k \binom{k}{i} a^{k - i + 1} b^i + \sum_{i = 0}^k \binom{k}{i} a^{k - i} b^{i + 1} \\ &= \sum_{i = 1}^{k + 1} \binom{k}{i - 1} a^{k - i + 1} b^{i - 1} + \sum_{i = 0}^k \binom{k}{i} a^{k - i} b^{i + 1} \\ &= a^{k+1} + \sum_{i = 1}^k \binom{k}{i - 1} a^{k - i + 1} b^i + \sum_{i = 1}^k \binom{k}{i} a^{k - i + 1} b^i + b^{k + 1} \\ &= a^{k+1} + \sum_{i = 1}^k \left(\binom{k}{i - 1} + \binom{k}{i}\right) a^{k - i + 1} b^i + b^{k + 1} \\ &= a^{k+1} + \sum_{i = 1}^k \binom{k + 1}{i} a^{k - i + 1} b^i + b^{k + 1} \\ &= \sum_{i = 0}^{k + 1} \binom{k + 1}{i} a^{k + 1 - i} b^i \end{aligned}

结论仍成立,综合 (1) 和 (2),结论成立。