Pascal's Triangle is defined such that the number in row and column is . For this reason, convention holds that both row numbers and column numbers start with 0. Thus, the apex of the triangle is row 0, and the first number in each row is column 0. As an example, the number in row 4, column 2 is . Pascal's Triangle thus can serve as a "look-up table" for binomial expansion values. Also, many of the characteristics of Pascal's Triangle are derived from combinatorial identities; for example, because , the sum of the values on row of Pascal's Triangle is .
Sum of previous values
One of the best known features of Pascal's Triangle is derived from the combinatorics identity . Thus, any number in the interior of Pascal's Triangle will be the sum of the two numbers appearing above it. For example, . This property allows the easy creation of the first few rows of Pascal's Triangle without having to calculate out each binomial expansion.
The Fibonacci numbers appear in Pascal's Triangle along the "shallow diagonals." That is, , where is the Fibonacci sequence. For example, . A "shallow diagonal" is plotted in the diagram.
The Hockey-Stick Identity states: . Its name is due to the "hockey-stick" which appears when the numbers are plotted on Pascal's Triangle, as shown in the representation of the theorem below (where and ).
Consider writing the row number in base two as . The number in the th column of the th row in Pascal's Triangle is odd if and only if can be expressed as the sum of some . For example, . Thus, the only 4 odd numbers in the 9th row will be in the th, st, th, and th columns. Additionally, marking each of these odd numbers in Pascal's Triangle creates a Sierpinski triangle.
This is a special case of Kummer's Theorem, which states that given a prime p and integers m,n, the highest power of p dividing is the number of carries in adding and n in base p.
Patterns and Properties of the Pascal's Triangle
The zeroth row has a sum of . The first row has a sum of . The row has a sum of , which means there are ways to get to that row from the zeroth row.
Proof: To find the number of ways to get to the row of Pascal's Triangle, let's start with the zeroth row. There are ways to get to the next row because there are numbers in the first row. Now to get to the second row, we realize that starting from any number on the first row, we have two options to go to in the second row. This means we need to multiply the number of ways to get to the first row by , which gives us . This pattern continues, so the number of ways to get to the row of Pascal's Triangle is .