Pascal's Triangle

Pascal's triangle is an array of binomial coefficients in which each interior number is the sum of the two entries above it. Its rows encode binomial expansions and combination counts, and related arrangements were studied in several mathematical traditions centuries before Pascal.

Last updated
16 October 2026
Confidence
High (96%)
Sources
5
Versions
1
This article was researched and drafted with AI assistance and checked by an automated review pass. It is not guaranteed to be accurate — verify important facts against the references below.

Construction and notation

The triangle begins with a single 1. The next rows are 1 1; 1 2 1; 1 3 3 1; and 1 4 6 4 1. Every row begins and ends with 1, and an interior entry is formed by adding the two entries immediately above it. In the common zero-based convention, the entry in position k of row n is the binomial coefficient n choose k, written C(n,k) = n!/[k!(n−k)!], for 0 ≤ k ≤ n. The same numbers may be displayed with the rows centered to make a triangle.

Algebra and counting

The entries in row n are the coefficients in the expansion of (x + y)^n. For example, row 4 gives (x + y)^4 = x^4 + 4x^3y + 6x^2y^2 + 4xy^3 + y^4. The binomial coefficient C(n,k) also counts the ways to choose k items from n distinct items when order does not matter. This links the triangle to combinations and to counting arguments in probability. Adding all entries in a row gives 2^n, because setting x and y to 1 in the binomial expansion counts all subsets of an n-item set.

Patterns within the rows

Each row reads the same from left to right and right to left, reflecting the equality C(n,k) = C(n,n−k). The sums along the shallow diagonals form the Fibonacci sequence, while other diagonals contain familiar figurate-number sequences. These patterns arise from identities among binomial coefficients, not from the triangle's visual arrangement alone. Such relationships make the array a compact way to see connections among algebra, combinatorics and number sequences.

History and names

The familiar English name honors Blaise Pascal, whose study of the array appeared in a work published after his death in 1665. The naming does not mean that Pascal was the first person to know the pattern. Encyclopaedia Britannica describes an 11th-century triangular arrangement of binomial coefficients devised by the Chinese mathematician Jia Xian and its later study by Yang Hui; Persian scholar Omar Khayyam also studied the pattern in the 11th century. Yang Hui's 13th-century mathematical writing includes the triangle, and it is often called Yang Hui's triangle in China. Niccolò Tartaglia published rows of it in Europe in the 16th century. These records show that the array was developed and used across different mathematical traditions before Pascal's treatment.

Key facts

Construction rule
Each interior entry is the sum of the two entries immediately above it; both edges of each row are 1.
Binomial coefficients
The entries in row n are the coefficients of (x + y)^n and count selections of k items from n when order does not matter.
Historical note
The triangle's common name honors Blaise Pascal, but related arrays were studied by earlier mathematicians, including Jia Xian and Yang Hui in China and Omar Khayyam in Persia.

Ask about this article

Answers use only “Pascal's Triangle” and its references, with citations.

References

  1. 1.
    Pascal’s triangle Definition & Facts

    Encyclopaedia Britannica · encyclopedia · reliability: high · retrieved 16 October 2026

    Supports: Definition, binomial-expansion use, combination and probability connections, and historical accounts of earlier Chinese and Persian work.

  2. 2.
    Pascal's Triangle

    Wolfram MathWorld · other · reliability: high · retrieved 16 October 2026

    Supports: Binomial-coefficient construction, recurrence between entries, historical names, row sums and diagonal identities.

  3. 3.
    Binomial Coefficient

    Wolfram MathWorld · other · reliability: high · retrieved 16 October 2026

    Supports: Interpretation of a binomial coefficient as the number of unordered selections and its formula for nonnegative integers.

  4. 4.
    DLMF §1.2(i) Binomial Coefficients

    National Institute of Standards and Technology, Digital Library of Mathematical Functions · other · reliability: high · retrieved 16 October 2026

    Supports: Definitions and standard identities for binomial coefficients.

  5. 5.
    Yang Hui (1238 - 1298) - Biography

    MacTutor History of Mathematics, University of St Andrews · other · reliability: high · retrieved 16 October 2026

    Supports: Biographical evidence for Yang Hui's mathematical texts and his account of the triangle learned from Jia Xian.

References are suggested by the research engine and may be incomplete. Unverified URLs are omitted rather than guessed.

Article history

  1. Version 116 October 2026 · EditorCreated by Zapia