Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Pascal's Triangle and its patterns and properties"

(→‎Copied From)
(Propose for deletion)
 
Line 9: Line 9:
 
Remember that <math>\binom{n}{r}=\frac{n!}{k!(n-k)!}.</math>
 
Remember that <math>\binom{n}{r}=\frac{n!}{k!(n-k)!}.</math>
  
−
== Proving it ==
+
== Proof ==
 
If <math>k > n</math> then <math>\binom{n}{k} = 0 = \binom{n - 1}{k - 1} + \binom{n - 1}{k}</math> and so the result is pretty clear.
 
If <math>k > n</math> then <math>\binom{n}{k} = 0 = \binom{n - 1}{k - 1} + \binom{n - 1}{k}</math> and so the result is pretty clear.
−
So assume <math>k \leq n</math>. Then
+
So assume <math>k \leq n</math>. Then
  
 
<cmath>\begin{eqnarray*}\binom{n-1}{k-1}+\binom{n-1}{k}&=&\frac{(n-1)!}{(k-1)!(n-k)!}+\frac{(n-1)!}{k!(n-k-1)!}\\
 
<cmath>\begin{eqnarray*}\binom{n-1}{k-1}+\binom{n-1}{k}&=&\frac{(n-1)!}{(k-1)!(n-k)!}+\frac{(n-1)!}{k!(n-k-1)!}\\
Line 18: Line 18:
 
&=&\frac{n!}{k!(n-k)!}\\
 
&=&\frac{n!}{k!(n-k)!}\\
 
&=&\binom{n}{k}. \qquad\qquad\square\end{eqnarray*}</cmath>
 
&=&\binom{n}{k}. \qquad\qquad\square\end{eqnarray*}</cmath>
−
There we go. We proved it!
+
We proved it!
  
 
== Why is it needed? ==
 
== Why is it needed? ==
−
It's mostly just a cool thing to know. However, if you want to know how to use it in real life go to https://artofproblemsolving.com/videos/counting/chapter12/141. Or really any of the counting and probability videos.
+
It's mostly just a cool thing to know. However, if you want to know how to use it see [{{SERVER}}/videos/counting/chapter12/141 here.]
  
 
= Introduction to Pascal's Triangle =
 
= Introduction to Pascal's Triangle =
Line 31: Line 31:
 
                                       1 3 3 1
 
                                       1 3 3 1
 
                                       1 4 6 4 1
 
                                       1 4 6 4 1
−
And on and on...
+
And so on...
  
 
== Combinations ==
 
== Combinations ==
−
=== Combinations ===
+
 
 
Pascal's Triangle is really combinations. It looks something like this if it is depicted as combinations:
 
Pascal's Triangle is really combinations. It looks something like this if it is depicted as combinations:
  
Line 61: Line 61:
 
<math>(x+y)^2=1x^3+3x^2y+3y^2x+1^3</math>
 
<math>(x+y)^2=1x^3+3x^2y+3y^2x+1^3</math>
  
−
If you take away the x's and y's you get:
+
If you take away the x's and y's you get Pasca's Triangle:
  
 
           1
 
           1
Line 67: Line 67:
 
         1 2 1
 
         1 2 1
 
       1 3 3 1     
 
       1 3 3 1     
−
It's ''Pascal's Triangle''!
 
  
 
=== Proof ===
 
=== Proof ===
Line 161: Line 160:
 
== AoPS Wiki ==
 
== AoPS Wiki ==
  
−
- [[Pascal's Identity]]
+
* [[Pascal's Identity]]
−
 
+
* [[Pascal's Triangle]]
−
- [[Pascal's Triangle]]
+
* [[Combinatorics]]
−
 
+
* [[Hockey-Stick Identity]]
−
- [[Combinatorics]]
 
−
 
 
−
- [[Hockey-Stick Identity]]
 
  
 
== Videos ==
 
== Videos ==
  
−
- https://artofproblemsolving.com/videos/counting/chapter12/141
+
* https://artofproblemsolving.com/videos/counting/chapter12/141
−
 
+
* https://artofproblemsolving.com/videos/mathcounts/mc2012/374
−
- https://artofproblemsolving.com/videos/mathcounts/mc2012/374
+
* https://artofproblemsolving.com/videos/counting/chapter14/123
−
 
+
* https://artofproblemsolving.com/videos/counting/chapter13/143
−
- https://artofproblemsolving.com/videos/counting/chapter14/123
+
* https://artofproblemsolving.com/videos/mathcounts/mc2010/419
−
 
 
−
- https://artofproblemsolving.com/videos/counting/chapter13/143
 
−
 
 
−
- https://artofproblemsolving.com/videos/mathcounts/mc2010/419
 
−
 
 
−
= Copied From =
 
−
- 50 percent original made by Colball otherwise known as Colin Friesen
 
−
 
 
−
- Pascal's Identity
 
−
 
 
−
- Hockey-Stick Identity
 
−
 
−
- Pascal's Triangle
 
  
−
These are all on AoPS wiki. Look them up.
+
{{delete|duplicate of [[Pascal's triangle]]

Latest revision as of 13:03, 19 February 2025

Pascal's Identity

Identity

Pascal's Identity states that

${n \choose k}={n-1\choose k-1}+{n-1\choose k}$

for any positive integers $k$ and $n$. Here, $\binom{n}{k}$ is the binomial coefficient $\binom{n}{k} = nCk = C_k^n$.

Remember that $\binom{n}{r}=\frac{n!}{k!(n-k)!}.$

Proof

If $k > n$ then $\binom{n}{k} = 0 = \binom{n - 1}{k - 1} + \binom{n - 1}{k}$ and so the result is pretty clear. So assume $k \leq n$. Then

\begin{eqnarray*}\binom{n-1}{k-1}+\binom{n-1}{k}&=&\frac{(n-1)!}{(k-1)!(n-k)!}+\frac{(n-1)!}{k!(n-k-1)!}\\ &=&(n-1)!\left(\frac{k}{k!(n-k)!}+\frac{n-k}{k!(n-k)!}\right)\\ &=&(n-1)!\cdot \frac{n}{k!(n-k)!}\\ &=&\frac{n!}{k!(n-k)!}\\ &=&\binom{n}{k}. \qquad\qquad\square\end{eqnarray*} We proved it!

Why is it needed?

It's mostly just a cool thing to know. However, if you want to know how to use it see here.

Introduction to Pascal's Triangle

How to build it

Pascal's Triangle is a triangular array of numbers in which you start with two infinite diagonals of ones and each of the rest of the numbers is the sum of the two numbers above it. It looks something like this: 

                                         1
                                        1 1
                                       1 2 1
                                      1 3 3 1
                                     1 4 6 4 1

And so on...

Combinations

Pascal's Triangle is really combinations. It looks something like this if it is depicted as combinations: 

                             $\binom{0}{0}$                        
                $\binom{1}{0}$                  $\binom{1}{1}$
   $\binom{2}{0}$                     $\binom{2}{1}$                $\binom{2}{2}$

And on and on...

Proof

If you look at the way we build the triangle, each number is the sum of the two numbers above it. Assuming that these combinations are true then each combination in the sum of the two combinations above it. In an equation, it would look something like this: ${n \choose k}={n-1\choose k-1}+{n-1\choose k}$. Its Pascals Identity! Therefore each row looks something like this:

$\binom{n}{0} \binom{n}{1} \binom{n}{2} ... \binom{n}{n}$

Patterns and Properties

In addition to combinations, Pascal's Triangle has many more patterns and properties. See below. Be ready to be amazed.

Binomial Theorem

Let's multiply out some binomials. Try it yourself and it will not be fun: $(x+y)^0=1$

$(x+y)^1=1x+1y$

$(x+y)^2=1x^2+2xy+1y^2$

$(x+y)^2=1x^3+3x^2y+3y^2x+1^3$

If you take away the x's and y's you get Pasca's Triangle: 

         1
        1 1
       1 2 1
      1 3 3 1

Proof

There are a number of different ways to prove the Binomial Theorem, for example by a straightforward application of mathematical induction. The Binomial Theorem also has a nice combinatorial proof:

We can write $(a+b)^n=\underbrace{ (a+b)\cdot(a+b)\cdot(a+b)\cdot\cdots\cdot(a+b) }_{n}$. Repeatedly using the distributive property, we see that for a term $a^m b^{n-m}$, we must choose $m$ of the $n$ terms to contribute an $a$ to the term, and then each of the other $n-m$ terms of the product must contribute a $b$. Thus, the coefficient of $a^m b^{n-m}$ is the number of ways to choose $m$ objects from a set of size $n$, or $\binom{n}{m}$. Extending this to all possible values of $m$ from $0$ to $n$, we see that $(a+b)^n = \sum_{m=0}^{n}{\binom{n}{m}}\cdot a^m\cdot b^{n-m}$, as claimed.

Similarly, the coefficients of $(x+y)^n$ will be the entries of the $n^\text{th}$ row of Pascal's Triangle. This is explained further in the Counting and Probability textbook [AoPS]

In real life

It is really only used for multipling out binomials. More usage at https://artofproblemsolving.com/videos/counting/chapter14/126.

Powers of 2

Theorem

Theorem

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

Why do we need it?

It is useful in 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

Subset proof

Say you have a word with n letters. How many subsets does it have in terms of n? Here is how you answer it: You ask the first letter Are you in or are you out? Same to the second letter. Same to the third. Same to the n. Each of the letters has two choices: In and Out. The would be $(2)(2)(2)(2)$...n times. $2^n$.

Alternate proof

If you look at the way we built the triangle you see that each number is row n-1 is added on twice in row n. This means that each row doubles. That means you get powers of two.

Triangle Numbers

Theorem

If you look at the numbers in the third diagonal you see that they are triangle numbers.

Proof

Now we can make an equation: $\binom{n}{2}=1+2+3+...+(n-1) \Rightarrow \binom{n}{2}=\frac{n(n+1)}{2} \Rightarrow \frac{n!}{2!(n-2)!}=\frac{n(n+1)}{2} \Rightarrow \frac{n(n+1)}{2}=\frac{n(n+1)}{2}$

Hockey stick

For $n,r\in\mathbb{N}, n>r,\sum^n_{i=r}{i\choose r}={n+1\choose r+1}$.


[asy] int chew(int n,int r){ int res=1; for(int i=0;i<r;++i){ res=quotient(res*(n-i),i+1); } return res; } for(int n=0;n<9;++n){ for(int i=0;i<=n;++i){ if((i==2 && n<8)||(i==3 && n==8)){ if(n==8){label(string(chew(n,i)),(11+n/2-i,-n),p=red+2.5);} else{label(string(chew(n,i)),(11+n/2-i,-n),p=blue+2);} } else{ label(string(chew(n,i)),(11+n/2-i,-n)); } } } [/asy]

This identity is known as the hockey-stick identity because, on Pascal's triangle, when the addends represented in the summation and the sum itself is highlighted, a hockey-stick shape is revealed.


Proof

Inductive Proof

This identity can be proven by induction on $n$.

Base Case Let $n=r$.

$\sum^n_{i=r}{i\choose r}=\sum^r_{i=r}{i\choose r}={r\choose r}=1={r+1\choose r+1}$.

Inductive Step Suppose, for some $k\in\mathbb{N}, k>r$, $\sum^k_{i=r}{i\choose r}={k+1\choose r+1}$. Then $\sum^{k+1}_{i=r}{i\choose r}=\left(\sum^k_{i=r}{i\choose r}\right)+{k+1\choose r}={k+1\choose r+1}+{k+1\choose r}={k+2\choose r+1}$.

Algebraic Proof

It can also be proven algebraically with Pascal's Identity, ${n \choose k}={n-1\choose k-1}+{n-1\choose k}$. Note that

${r \choose r}+{r+1 \choose r}+{r+2 \choose r}+\cdots+{r+a \choose r}$ $={r+1 \choose r+1}+{r+1 \choose r}+{r+2 \choose r}+\cdots+{r+a \choose r}$ $={r+2 \choose r+1}+{r+2 \choose r}+\cdots+{r+a \choose r}=\cdots={r+a \choose r+1}+{r+a \choose r}={r+a+1 \choose r+1}$, which is equivalent to the desired result.

Combinatorial Proof 1

Imagine that we are distributing $n$ indistinguishable candies to $k$ distinguishable children. By a direct application of Balls and Urns, there are ${n+k-1\choose k-1}$ ways to do this. Alternatively, we can first give $0\le i\le n$ candies to the oldest child so that we are essentially giving $n-i$ candies to $k-1$ kids and again, with Balls and Urns, ${n+k-1\choose k-1}=\sum_{i=0}^n{n+k-2-i\choose k-2}$, which simplifies to the desired result.

Combinatorial Proof 2

We can form a committee of size $k+1$ from a group of $n+1$ people in ${{n+1}\choose{k+1}}$ ways. Now we hand out the numbers $1,2,3,\dots,n-k+1$ to $n-k+1$ of the $n+1$ people. We can divide this into $n-k+1$ disjoint cases. In general, in case $x$, $1\le x\le n-k+1$, person $x$ is on the committee and persons $1,2,3,\dots, x-1$ are not on the committee. This can be done in $\binom{n-x+1}{k}$ ways. Now we can sum the values of these $n-k+1$ disjoint cases, getting \[{{n+1}\choose {k+1}} ={{n}\choose{k}}+{{n-1}\choose{k}}+{{n-2}\choose{k}}+\hdots+{{k+1}\choose{k}}+{{k}\choose{k}}.\]

See Also

AoPS Wiki

Videos

{{delete|duplicate of Pascal's triangle

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Pascal%27s_Triangle_and_its_patterns_and_properties&oldid=243220"