Pascal's Triangle

Last Updated : 17 Oct, 2026

Pascal's Triangle is a triangular arrangement of numbers where each number is the sum of the two numbers directly above it in the previous row.

Various patterns can be observed in Pascal's Triangle, some of which are


Structure

  • The triangle starts with a 1 at the top.
  • Each row begins and ends with 1.
  • Any other number in the triangle is the sum of the two numbers immediately above it in the previous row.

Diagonals in Pascal’s Triangle

Each rightward diagonal of Pascal’s Triangle, when considered as a sequence represents the different numbers such as

Pascal’s Triangle Binomial Expansion

We can easily find the coefficient of the binomial expansion using Pascal's Triangle. The elements in the (n + 1)th row of the Pascal triangle represent the coefficient of the expanded expression of the polynomial (x + y)n.

We know that the expansion of (x + y)n is,
(x + y)n = a0xn + a1xn-1y + a2xn-2y2 + … + an-1xyn-1 + anyn

Here, a0, a1, a2, a3, ...., an are the term in the (n+1)th row of Pascal's Triangle

Horizontal Sum of Rows

On close observing Pascal’s Triangle we can conclude that the sum of any row in Pascal’s triangle is equal to a power of 2. The formula for the same is, For any (n + 1)th row in Pascal’s Triangle the sum of all the elements is, 2n

Applying this Formula in the first 4 rows of Pascal’s triangle we get,

1 = 1 = 20
1 + 1 = 2 = 21
1 + 2 + 1 = 4 = 22
1 + 3 + 3 + 1 = 8 = 23

Exponents of 11

Each row of Pascal's Triangle corresponds to a power of 11:

Row n (starting from n = 0) represents 11 n.

Examples:

  1. Row 0: 1 → 110 = 1
  2. Row 1: 1, 1 → 111 = 11
  3. Row 2: 1, 2, 1 → 112 = 121
  4. Row 3: 1, 3, 3, 1 → 113 = 1331

Note: For higher powers of 11, the digits in the triangle rows exceed single digits, causing a carry-over effect. In such cases, the numbers in Pascal's Triangle no longer directly represent 11n. Instead, the pattern can still be reconstructed by summing the digits appropriately.

Fibonacci Sequence in Pascal’s Triangle

We can easily obtain the Fibonacci sequence by simply adding the numbers in the diagonals of Pascal's triangle. This pattern is shown in the image added below,

Fibonacci-Pascal-Relation
Fibonacci & Pascal's triangle relation

Pascal’s Triangle Formula

Pascal Triangle Formula is the formula that is used to find the number to be filled in the mth column and the nth row. As we know the terms in Pascal's triangle are the summation of the terms in the above row. So we require the elements in the (n-1)th row, and (m-1)th and nth columns to get the required number in the mth column and the nth row.

The elements of the nth row of Pascal's triangle are given, nC0, nC1, nC2, ..., nCn. 

The formula for finding any number in Pascal's triangle is:

nCm = n-1Cm-1 + n-1Cm

Where,

  • nCm represents the (m + 1)th element in the nth row., and
  • n is a non-negative integer [0 ≤ m ≤ n]

Pascal’s Triangle in Coin Toss Probability

We use the Pascal triangle to find the various cases of the possible outcomes in probability conditions. This can be understood by the following example, tossing a coin one time we get two outcomes i.e. H and T this is represented by the element in the first row of Pascal's Triangle.

Similarly tossing a coin two times we get three outcomes i.e. {H, H}, {H, T}, {T, H}, and {T, T} this condition is represented by the element in the second row of Pascal's Triangle.

Thus, we can easily tell the possible number of outcomes in tossing a coin experiment by simply observing the respective elements in the Pascal Triangle.

The table below tells us about the cases if a coin is tossed one time, two times, three times, and four times, and its accordance with Pascal's Triangle

Number of Tosses
OR
A row of Pascals Triangle

Possible Outcomes

Elements in Pascal Triangle

1

{H},
{T}

1    1

2

{HH},
{HT}, {TH},
{TT}

1    2    1

3

{HHH},
{HHT}, {HTH}, {THH},
{HTT}, {THT}, {TTH},
{TTT}

1    3    3    1

4

{HHHH},
{HHHT}, {HHTH}, {HTHH}, {THHH}, 
{HHTT}, {HTHT}, {HTTH}, {THHT}, {THTH}, {TTHH}, 
{HTTT}, {THTT}, {TTHT}, {TTTH},
{TTTT}

1    4    6    4    1

Properties

Various Properties of Pascal's Triangle are,

  • Every number in the Pascal triangle is the sum of the number above it.
  • The starting and the end numbers in Pascal's triangle are always 1.
  • The first diagonal in Pascal's Triangle represents the natural number or counting numbers.
  • The sum of elements in each row of Pascal's triangle is given using a power of 2.
  • Elements in each row are the digits of the power of 11.
  • The Pascal triangle is a symmetric triangle.
  • The elements in any row of Pascal's triangle can be used to represent the coefficients of Binomial Expansion.
  • Along the diagonal of Pascal's Triangle, we observe the Fibonacci numbers

Practice Questions on Pascal's Triangles

Comment

Explore