Update 文章 “使用归纳法证明二项式定理”
All checks were successful
Build and Deploy Qingshuige / build-deploy (push) Successful in 1m30s
All checks were successful
Build and Deploy Qingshuige / build-deploy (push) Successful in 1m30s
This commit is contained in:
@@ -23,7 +23,7 @@ $$
|
||||
|
||||
$$
|
||||
\begin{aligned}
|
||||
& \frac{n!}{(k-1)!(n-k+1)!} + \frac{n!}{k!(n-k)!} \\
|
||||
& \frac{n!}{(k-1)!(n-k+1)!} + \frac{n!}{k!(n-k)!} \\\\
|
||||
&= \frac{n!k}{k!(n-k+1)!} + \frac{n!(n-k+1)}{k!(n-k+1)!} \\
|
||||
&= \frac{n!k+n!(n-k+1)}{k!(n-k+1)!} \\
|
||||
&= \frac{n!(n+1)}{k!(n-k+1)!} \\
|
||||
@@ -44,7 +44,7 @@ $$(a+b)^0 = 1 = \sum_{k=0}^{0}\binom{0}{k}a^{0-k}b^k = a^0b^0.$$
|
||||
|
||||
$$
|
||||
\begin{aligned}
|
||||
&= (a+b)^{n+1} \\
|
||||
& (a+b)^{n+1} \\
|
||||
&= (a+b)(a+b)^n \\
|
||||
&= (a+b) \sum_{k=0}^{n} \binom{n}{k} a^{n-k}b^k \\
|
||||
&= \sum_{k=0}^{n} \binom{n}{k} (a^{n+1-k}b^k + a^{n-k}b^{k+1}) \\
|
||||
|
||||
Reference in New Issue
Block a user