Scribd
Upload
5 views11 pages

Pascals Triangle

Uploaded by

fajardodvn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views11 pages

Pascals Triangle

Uploaded by

fajardodvn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

PASCAL’S TRIANGLE

1 1 1 1 1 1 1 1 1 1
1 2 3 4 5 6 7 8 9
1 3 6 10 15 21 28 36
1 4 10 20 35 56 84
1 5 15 35 70 126
1 6 21 56 126
1 7 28 84
1 8 36
1 9
1 ( 𝑥+ 𝑦 )
0

1 1 ( 𝑥+ 𝑦 )
1

1 2 1
( 𝑥+ 𝑦 )
2

1 3 3 1 3
( 𝑥+ 𝑦 )
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6
1
1 7 21 35 35 21 7
1
1 8 28 56 70 56 28
8 1
Let n = 0, 1, 2, 3, … be a non-negative integer and let k be an
integer such that 0 k

[]
𝑛
𝑘
=
𝑛!
𝑘! ( 𝑛 −𝑘 ) !
Example 1. What is the fourth row of the Pascal Triangle?
Solution. The entries of the fourth row are

[]
𝑛
𝑘
=
𝑛!
𝑘! ( 𝑛 −𝑘 ) !

[]
4
0
=
4!
0 ! ( 4 − 0) !
=1 =4

=4
[]
4
4
=
4!
4 ! ( 4 − 4) !
=1

=6 The entries of the fourth row are


1, 4, 6, 4, and 1
Example 2. Find the binomial coefficient of
Solution. It is the fourth entry of the eighth row of the Pascal
Triangle, where the 1 at the beginning of the row is counted as
the 0th entry, so
[𝑘] 𝑛
=
𝑛!
𝑘! ( 𝑛 −𝑘 ) !

[]
8
4
=
8!
4 !(8 − 4 )!
[]
8 8.7 .6 .5 .4 !
4
=
4 !(4 ) ! []
8
4
=
1680
24
[4 ] 4 !(8 − 4 )!
8
=
8!

[ ]
[]
8 8.7 .6 .5 8
= =70
4

[4 ] 4 !(4 ) !
8 8! 4 4.3.2
=
Recursion is a rule generates numbers or objects which were
given previously. The rule which generates the entries of the
Pascal Triangle is an important example of recursion.

The Recursion for the Binomial Coefficients

Let n = 0, 1, 2, 3, … be a non-negative integer, and let k


be an integer such that 0 k n. Then the binomial coefficients
satisfy the equations
=1=

=
Recursions are important in computer science for many reasons.
They are used to construct computer codes, and computers can
be easily programmed to run recursions.

If n is a positive integer then n!, n factorial, is the product of the


integers from 1 to n.
n!= 1 . 2 . 3 … . n
We make the convention that 0! = 1
Example 3. Compute the binomial coefficient using Pascal’s
formula

[𝑘]
Solution. 𝑛 = 𝑛!
𝑘! ( 𝑛 −𝑘 ) !

[]
4
2
=
4!
2 ! ( 4 − 2) !

[ 2] 2 !(2 !)
4
=
4!
[ ]
4 =6
2

[ 2] 2 !( 2!)
4
=
4 .3 .2 !
Example 4. Compute the binomial coefficient using Pascal’s
formula

[𝑘]
Solution. 𝑛 = 𝑛!
𝑘! ( 𝑛 −𝑘 ) !

[]
8
5
=
8!
5 ! ( 8 − 5) ! [ ] 8
5
=56

[ 5 ] 5 ! (3 !)
8
=
8!

[ 5 ] ( 3! ) 5!
8
=
8.7.6.5!
Example 5. In 40 numbers (1 to 40), how many 5 numbers can
be selected out of 40 numbers?

[𝑘]
Solution. 𝑛 = 𝑛!
𝑘! ( 𝑛 −𝑘 ) !

[ ]
40
5
=
40 !
5 ! ( 8 −5 ) ! [ ]
40
5
=
40 .39 . 38 . 37 . 36 . 35 !
5 !( 35! )

[ 5 ] 5 !( 40 −5 ! )
40
=
40 !
[ ]
40
5
=
78 , 960 , 960
120

[ 5 ]= 5 !( 35 !)
40 40 ! [ ]
40
5
=658 , 008
1. Evaluate the following: 2. In a lotto of 42 numbers, how

a.
[0
0 ] f.
[5
2] many 6 numbers can we select
out of 42 numbers?

b.
[ 4]
7
g. [ ]
12
6 3. Evaluate using the

c.
[ 3]
5 Pascal’s Triangle.

d.
[ 8 ]
11

e.
[ 5 ]
10

You might also like