1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
The first six rows of Pascal's triangle
Pascal's Triangle is a triangular array . It is named after French mathematician Blaise Pascal , but it was known in China , Persia , and India long before Pascal was born.[ 1]
Pascal's triangle can be made as follows. On the first row , write only the number 1. Then, to get the numbers of following rows, add the number that can be seen above and to the left (if any) and the number above and to the right (if any) to find the new value. For example, the numbers 1 and 3 in the fourth row are added to make 4 in the fifth row.
Each number in the triangle is the sum of the two directly above it. Yang Hui (Pascal's) triangle, as depicted by the Chinese using rod numerals .The triangle displays the coefficients that occur when the binomial
(
a
+
b
)
{\displaystyle (a+b)}
n
th
{\displaystyle n^{\text{th}}}
(
a
+
b
)
0
=
1
(
a
+
b
)
1
=
1
a
+
1
b
(
a
+
b
)
2
=
1
a
2
+
2
a
b
+
1
b
2
(
a
+
b
)
3
=
1
a
3
+
3
a
2
b
+
3
a
b
2
+
1
b
3
(
a
+
b
)
4
=
1
a
4
+
4
a
3
b
+
6
a
2
b
2
+
4
a
b
3
+
1
b
4
{\displaystyle {\begin{array}{lc}(a+b)^{0}=&{\color {Red}{\boldsymbol {1}}}\\(a+b)^{1}=&{\color {Red}{\boldsymbol {1}}}a+{\color {Red}{\boldsymbol {1}}}b\\(a+b)^{2}=&{\color {Red}{\boldsymbol {1}}}a^{2}+{\color {Red}{\boldsymbol {2}}}ab+{\color {Red}{\boldsymbol {1}}}b^{2}\\(a+b)^{3}=&{\color {Red}{\boldsymbol {1}}}a^{3}+{\color {Red}{\boldsymbol {3}}}a^{2}b+{\color {Red}{\boldsymbol {3}}}ab^{2}+{\color {Red}{\boldsymbol {1}}}b^{3}\\(a+b)^{4}=&{\color {Red}{\boldsymbol {1}}}a^{4}+{\color {Red}{\boldsymbol {4}}}a^{3}b+{\color {Red}{\boldsymbol {6}}}a^{2}b^{2}+{\color {Red}{\boldsymbol {4}}}ab^{3}+{\color {Red}{\boldsymbol {1}}}b^{4}\\\end{array}}}
The same triangle can also be expressed using combinations :
1
=
(
0
0
)
1
=
(
1
0
)
1
=
(
1
1
)
1
=
(
2
0
)
2
=
(
2
1
)
1
=
(
2
2
)
1
=
(
3
0
)
3
=
(
3
1
)
3
=
(
3
2
)
1
=
(
3
3
)
1
=
(
4
0
)
4
=
(
4
1
)
6
=
(
4
2
)
4
=
(
4
3
)
1
=
(
4
4
)
{\displaystyle {\begin{array}{c}{\color {Red}{\boldsymbol {1}}}={\binom {0}{0}}\\{\color {Red}{\boldsymbol {1}}}={\binom {1}{0}}\quad \quad {\color {Red}{\boldsymbol {1}}}={\binom {1}{1}}\\{\color {Red}{\boldsymbol {1}}}={\binom {2}{0}}\quad \quad {\color {Red}{\boldsymbol {2}}}={\binom {2}{1}}\quad \quad {\color {Red}{\boldsymbol {1}}}={\binom {2}{2}}\\{\color {Red}{\boldsymbol {1}}}={\binom {3}{0}}\quad \quad {\color {Red}{\boldsymbol {3}}}={\binom {3}{1}}\quad \quad {\color {Red}{\boldsymbol {3}}}={\binom {3}{2}}\quad \quad \quad \quad {\color {Red}{\boldsymbol {1}}}={\binom {3}{3}}\\{\color {Red}{\boldsymbol {1}}}={\binom {4}{0}}\quad \quad {\color {Red}{\boldsymbol {4}}}={\binom {4}{1}}\quad \quad {\color {Red}{\boldsymbol {6}}}={\binom {4}{2}}\quad \quad {\color {Red}{\boldsymbol {4}}}={\binom {4}{3}}\quad \quad {\color {Red}{\boldsymbol {1}}}={\binom {4}{4}}\\\end{array}}}
where
(
n
k
)
=
(
n
)
(
n
− − -->
1
)
… … -->
(
n
− − -->
k
+
1
)
(
k
)
(
k
− − -->
1
)
… … -->
(
1
)
=
n
!
(
k
!
)
⋅ ⋅ -->
(
n
− − -->
k
)
!
{\displaystyle {\binom {n}{k}}={\frac {(n)(n-1)\ldots (n-k+1)}{(k)(k-1)\ldots (1)}}={\frac {n!}{(k!)\cdot (n-k)!}}}
The triangle has many uses in probability . It can also be used in binomial expansions . For example,
(x + 1)2 = 1x 2 + 2x + 12 . Notice the coefficients are the third row of Pascal's triangle: 1, 2, 1.
In general, when a binomial is raised to a positive integer power we have:
(x + y )n a 0 x n a 1 x n −1y + a 2 x n −2y 2 + … + a n −1xy n −1a n y n where the coefficients a i n + 1 of Pascal's triangle; in other words,
a
i
=
(
n
i
)
.
{\displaystyle a_{i}={n \choose i}.}
Formally speaking, the way of making the Pascal's Triangle uses Pascal's rule , which states that
(
n
k
)
=
(
n
− − -->
1
k
− − -->
1
)
+
(
n
− − -->
1
k
)
{\displaystyle {n \choose k}={n-1 \choose k-1}+{n-1 \choose k}}
for non-negative integers n and k where n ≥ k and with the initial condition
(
n
0
)
=
(
n
n
)
=
1.
{\displaystyle {n \choose 0}={n \choose n}=1.}
Pascal's triangle generalizes readily into higher dimensions . The three-dimensional version is called Pascal's pyramid or Pascal's tetrahedron . A higher-dimensional analogue is generically called a "Pascal's simplex "* . See also pyramid , tetrahedron , and simplex .
The first and last number in each row is always 1.
(
n
0
)
=
(
n
n
)
=
1
{\displaystyle {n \choose 0}={n \choose n}=1}
The second number in each row is the row number. In a binomial expansion, this second number is equal to the power. (This makes the 'first' row, 1, actually the zero row).
(
n
1
)
=
n
{\displaystyle {n \choose 1}=n}
The rows always read the same forward and backward.
(
n
k
)
=
(
n
n
− − -->
k
)
{\displaystyle {n \choose k}={n \choose n-k}}
The sum of the numbers in each row is double the sum of the numbers in the row before. The sum of each row is 2n
The zero row, 1, has a sum of 1.
1
=
2
0
=
1
{\displaystyle 1=2^{0}=1}
The first row, 1,1 has a sum of 2.
1
+
1
=
2
1
=
2
{\displaystyle 1+1=2^{1}=2}
The second row, 1,2,1 has a sum of 4.
1
+
2
+
1
=
2
2
=
4
{\displaystyle 1+2+1=2^{2}=4}
The third row, (1,3,3,1) has a sum of 8.
1
+
3
+
3
+
1
=
2
3
=
8
{\displaystyle 1+3+3+1=2^{3}=8}
The sum of the nth row is
2
n
{\displaystyle 2^{n}}
∑ ∑ -->
i
=
0
n
(
n
i
)
=
2
n
{\displaystyle \sum _{i=0}^{n}{n \choose i}=2^{n}}
References
↑ Willers, Michael (2021). Mathematics: From Algebra to Algorithms, Adventures in Numbers . London, UK: New Burlington Books. p. 130. ISBN 978-1-80242-020-3
Other websites
