Revision as of 15:12, 16 June 2019

Review

Pascal's Triangle is a triangular array of numbers where each number is the sum of the two numbers above it. It Looks something like this:

And on and on...

Pascal's Triangle can also be written like this

And on and on... Remember that $\binom{n}{r}=\frac{n!}{k!(n-k)!}$ where $n \ge r$ .

                1     =1
               1+1    =2
              1+2+1   =4
             1+3+3+1  =8
            1+4+6+4+1 =16

These are powers of two. Let's prove it true. (Note: There are dozens of more patterns but it would have nothing to do with powers of two).

It states that $\binom{n}{0}+\binom{n}{1}+...+{n}{n}$ .

@@ Line 37: / Line 37: @@
 == Theorem ==
-=== Theorem ===
+It states that <math>\binom{n}{0}+\binom{n}{1}+...+{n}{n}</math>.
-The theorem is this: <math>\binom{n}{0}+\binom{n}{1}+\binom{n}{2}+...+\binom{n}{n}</math>.
-=== Why do we need it? ===
-You would need for counting the number of subsets in a word, The number of ways people could volunteer for something and many other things. It's also a cool thing to know about that your friends don't.
-== Proof ==