this is for holding javascript data
Jeremy Ting edited p6.tex
about 10 years ago
Commit id: 296f772cee4308f99092c5185bb36ea23da0167f
deletions | additions
diff --git a/p6.tex b/p6.tex
index efe2732..58a2243 100644
--- a/p6.tex
+++ b/p6.tex
...
We know that $\sum_{i=0}^{n} {{n}\choose{i}} =2^n$
We also know that
the alternation sum of binomial coefficients from (0,n)=0 (which is summation (i=0,n) of (-1)^i $\sum_{i=0}^{n} -1^i *
nCi) {{n}\choose{i}} =0$
If you subtract the second equation from the first you get
2*summation from (i=0,n) of nC(2i+1)=2^n
which implies that summation from (i=0,n) of nC(2i+1)=2^(n-1)