|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Pascal's Triangle
Pascal's Triangle
Pascal's Triangle is a triangle in which each row has one more entry than
the preceding row, each row begins and ends with "1," and the interior elements
are found by adding the adjacent elements in the preceding row. The triangle is
symmetrical.
Figure 1.1: Pascal's Triangle
We can find any element of any row using the combination function. The rth element
of Row n is given by:
C(n, r - 1) =
For example, the 3rd entry in Row 6 (r = 3, n = 6) is
C(6, 3 - 1) = C(6, 2) = ![]() = 15.
Examples
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Contact Us | Privacy Policy | Terms and Conditions | About
©2006 SparkNotes LLC, All Rights Reserved.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||