0% found this document useful (0 votes)
259 views10 pages

Pascal's Triangle Final

Pascal's triangle is a triangular array of the binomial coefficients where each entry is the sum of the two entries above it. It has many interesting properties including symmetry, patterns formed by row sums and prime numbers, and relationships to concepts like the binomial theorem, binomial distribution, fractals, and the Fibonacci sequence. The document provides examples and explanations of these properties and relationships.

Uploaded by

Mridul Ray
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
259 views10 pages

Pascal's Triangle Final

Pascal's triangle is a triangular array of the binomial coefficients where each entry is the sum of the two entries above it. It has many interesting properties including symmetry, patterns formed by row sums and prime numbers, and relationships to concepts like the binomial theorem, binomial distribution, fractals, and the Fibonacci sequence. The document provides examples and explanations of these properties and relationships.

Uploaded by

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

DELHI PUBLIC SCHOOL

DHALIGAON

MATHEMATICS
PROJECT

MADE BY
1.
2.
3.
4.
5.
6.
AIM

OBJECTIVE
ACKNOWLEDGEMENT
It would be my utmost pleasure to express my sincere
thanks to My Mathematics Teachers Mr. Pulin Chandra
Medhi in providing a helping hand in this project. His
valuable guidance, support and supervision all through
this project titled “Pattern and properties of pascal’s
triangle.”, are responsible for attaining its present form. I
would like to extend my thanks to my parents and friends
THEORY
Pascal’s triangle

Pascal’s triangle is vertically symmetrical, such that if we divide the triangle into two equal
parts vertically then we observe that the left part is the mirror image of the right part, which
mean the two parts are symmetrical to each other. Pascal’s triangle is primarily used in
probability to calculate the combination.

The formula used to find the value of any element in a Pascal’s triangle using combination
is as follows:

n​
C​k​n​C​k​ = ​n! /(k! (n−k)!) n! /(k! (n−k)!)

Pascal’s triangle is a never-ending equilateral triangle of numbers that follow a rule of


adding the two numbers above to get the number below. Two of the sides are “all 1's”
and because the triangle is infinite, there is no “bottom side.”

In mathematics, ​Pascal's triangle​ is a triangular array of the binomial coefficients. In


much of the Western world, it is named after the French mathematician Blaise Pascal,
although other mathematicians studied it centuries before him in India, Persia
(Iran), China, Germany, and Italy.
The rows of Pascal's triangle are conventionally enumerated starting with row ​n​ = 0 at
the top (the 0th row). The entries in each row are numbered from the left beginning
with ​k​ = 0 and are usually staggered relative to the numbers in the adjacent rows. The
triangle may be constructed in the following manner: In row 0 (the topmost row), there is
a unique nonzero entry 1. Each entry of each subsequent row is constructed by adding
the number above and to the left with the number above and to the right, treating blank
entries as 0.

History

It is named for Blaise Pascal, a 17th-century French mathematician who used the
triangle in his studies in probability theory. However, it has been studied throughout the
world for thousands of years, particularly in ancient India and medieval China, and
during the Golden Age of Islam and the Renaissance, which began in Italy before
spreading across Europe.

The Binomial Theorem


Binomial is a word used in algebra that roughly means “two things added together.”
The ​binomial theorem​ refers to the pattern of coefficients (numbers that appear in front
of variables) that appear when a binomial is multiplied by itself a certain number of
times. Mathematically, this is written as (x + y)​ n​. Pascal’s triangle can be used to
determine the expanded pattern of coefficients. The first few expanded polynomials are
given below.
Pascal's
n (x + y)​n Expanded Polynomial
Triangle

0 (x + y)​0 1 1

1 (x + y)​1 1x + 1y 1,1

2 (x + y)​2 1x​2​ + 2xy + 1y​2 1,2,1

3 (x + y)​3 1x​3​ + 3x​2​y + 3xy​2​ + 1y​3 1,3,3,1

4 (x + y)​4 1x​4​ + 4x​3​y + 6x​2​y​2​ + 4xy​3​ + 1y​4 1,4,6,4,1

5 (x + y)​5 1x​5​ + 5x​4​y + 10x​3​y​2​ + 10x​2​y​3​ + 5xy​4​ + 1y​5 1,5,10,10,5,1

Using summation notation, the binomial theorem may be succinctly written as:

The Binomial Distribution


For a probabilistic process with two outcomes (like a coin flip) the sequence of
outcomes is governed by what mathematicians and statisticians refer to as
the ​binomial distribution​. This also relates to Pascal’s triangle.
For example for three coin flips, there are 2 × 2 × 2 = 8 possible heads/tails sequences.
When sorted into groups of “how many heads (3, 2, 1, or 0)”, each group is populated
with 1, 3, 3, and 1 sequences, respectively. Notice how this matches the third row of
Pascal’s Triangle. It’s been proven that this trend holds for all numbers of coin flips and
all the triangle’s rows.
Coin Pascal's
Possible sequences of heads (H) or tails (T)
flips Triangle

H 1
1
T 1

HH 1
2 HT TH 2
TT 1

HHH 1
HHT HTH THH 3
3
HTT THT TTH 3
TTT 1

HHHH 1
HHHT HHTH HTHH THHH 4
4 HHTT HTHT HTTH THHT THTH TTHH 6
HTTT THTT TTHT TTTH 4
TTTT 1

Fractals
Colouring the numbers of Pascal’s triangle by their divisibility produces an interesting
variety of fractals. Colouring all the numbers divisible by two (all the even numbers)
produces the Sierpiński triangle. These patterns have appeared in Italian art since the
13th century, according to Wolfram Math World.
PROCEDURE

To build the triangle, start with “1” at the top, then continue placing
numbers below it in a triangular pattern as shown in figure.
PROPERTIES
Symmetry and Borders: The starting and ending element of each and every row in a
Pascal’s triangle is 11. The triangle is symmetrical, that is the numbers present on the left
side is the same as the numbers on the right side.

Sum of Rows: The horizontal sum of elements in any row equals 2​n​2n, where nn stands for
the number of the row.

Hockey Stick Pattern : In a Pascal’s triangle starting from the boundary that is 1 going
through diagonal of any length and ending or we can say the head lies at an element across
the same diagonal but below the end of the selection, then the sum of the numbers from 1
and all the numbers across that diagonal would be equal to the head of the hockey stick.
This pattern forms the shape of the hockey stick.
Prime Number:​ If the first number of any row in a Pascal’s triangle is a prime number
excluding the boundary numbers 11, then each of the row elements are divisible by the first
number. For example, in row 77, the elements read as
follows 1,7,21,35,35,21,7,11,7,21,35,35,21,7,1 excluding the boundary number 11 each all
other elements 7,21,35,35,21,77,21,35,35,21,7 are divisible by the first prime number 77.

Fibonacci Sequence:​ In a Pascal’s triangle if we add the numbers lying on each diagonal,
then the sum forms a Fibonacci sequence. Fibonacci sequence is defined as a number
series where each number is the addition of two of its preceding numbers.
CONCLUSION

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy