ABSTRACT
The infinite collection of integers known as Pascal’s triangle contains an enormous number of patterns. Let’s construct a few rows of this triangle and take a look at some of the patterns we see. First, place a 1 at the top to start the triangle. Then let every other number in the triangle be the sum of the two numbers diagonally above it to the left and right, with the understanding that blank spaces are counted as zeroes. If we do this for several rows, we get the triangle in Figure 1.1. Rows 0 through 6 of Pascal’s triangle https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781351215824/cd461a07-713f-408e-a472-f82f6bbf751f/content/fig1_1.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/>
