-
Cn0+Cn1+⋯+Cnn=2nC_n^0+C_n^1+\cdots+C_n^n=2^nCn0+Cn1+⋯+Cnn=2n
(x+y)n=Cn0xny0+Cn1xn−1y1+⋯+Cnnx0yn(x+y)^n=C_n^0x^ny^0+C_n^1x^{n-1}y^1+\cdots+C_n^nx^0y^n(x+y)n=Cn0xny0+Cn1xn−1y1+⋯+Cnnx0yn, set x=y=1x=y=1x=y=1. -
A combination is a selection of items from a collection, such that the order of selection does not matter: (nk)=n(n−1)⋯(n−k+1)k(k−1)⋯1=n!k!(n−k)!.\binom{n}{k} =\frac{n(n-1)\cdots(n-k+1)}{k(k-1)\cdots1} = \frac{n!}{k!(n-k)!}.(kn)=k(k−1)⋯1n(n−1)⋯(n−k+1)=k!(n−k)!n!.
-
Prove SnS_nSn: n!>2nn!>2^nn!>2n is true for n≥4n\geq4n≥4 using Mathematical Induction.
Proof.
Base case: 4!=24>24=164!=24>2^4=164!=24>24=16, so S4S_4S4 is true.
Induction Hypothesis (I. H.): suppose k!>2kk!>2^kk!>2k is true for some arbitrary k≥4k\geq4k≥4.
Induction Step (need to show (k+1)!>2k+1=2k⋅2=2k+2k(k+1)!>2^{k+1}=2^k\cdot2=2^k +2^k(k+1)!>2k+1=2k⋅2=2k+2k):
(k+1)!=(k+1)⋅k!=k⋅k!+k!>k⋅2k+2k≥4⋅2k+2k>2k+2k=2⋅2k=2k+1(k+1)!=(k+1)\cdot k!=k\cdot k!+k!>k\cdot 2^k+2^k\geq 4\cdot 2^k+2^k>2^k+2^k=2\cdot 2^k=2^{k+1}(k+1)!=(k+1)⋅k!=k⋅k!+k!>k⋅2k+2k≥4⋅2k+2k>2k+2k=2⋅2k=2k+1. This shows Sk+1S_{k+1}Sk+1 is true.
By Principle Mathematical Induction (PMI), SnS_nSn is true for all intergers n≥4n\geq 4n≥4.
扫一扫
评论
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
查看更多评论
添加红包
