Revision as of 15:18, 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}$ .

It is useful is many word problems (That means, yes, you can use it in real life) and it is just a cool thing to know. More at https://artofproblemsolving.com/videos/mathcounts/mc2010/419.

@@ Line 45: / Line 45: @@
 It is useful is many word problems (That means, yes, you can use it in real life) and it is just a cool thing to know.
 More at https://artofproblemsolving.com/videos/mathcounts/mc2010/419.
+== Proof ==
+=== Long proof ===
+=== Short proof ===
+=== Which proof do you like better ===