Pascal's Triangle: Formula, Properties, Patterns & Real-World Uses
Pascal's Triangle is one of the most elegant and far-reaching structures in all of mathematics. Named after the French mathematician Blaise Pascal (1623–1662), who described it systematically in his 1665 treatise Traité du triangle arithmétique, the triangle actually appears in mathematical texts from ancient China, India, and Persia centuries earlier. The Chinese mathematician Jia Xian illustrated a version of the triangle around 1050 CE, and the Persian poet-mathematician Omar Khayyam referenced it even earlier — underscoring just how universally the pattern has captured mathematical imagination across cultures and millennia.
The Pascal Triangle Formula
Every entry in Pascal's Triangle is a binomial coefficient. The entry in row n at position k (both counting from zero) is written C(n, k) and equals n! / (k! × (n−k)!). The first row (row 0) contains just the number 1. Each subsequent row is formed by placing 1s on both ends and filling the interior by summing the two entries directly above. This simple rule — C(n, k) = C(n−1, k−1) + C(n−1, k) — is the Pascal recurrence, and it makes the triangle effortless to construct by hand. Our calculator applies this exact recurrence, extended with JavaScript BigInt for arbitrarily large row numbers beyond standard floating-point precision.
Example — Row 5
Row 5: C(5,0)=1 C(5,1)=5 C(5,2)=10 C(5,3)=10 C(5,4)=5 C(5,5)=1
Row sum = 1+5+10+10+5+1 = 32 = 2⁵ ✓
Key Properties of Pascal's Triangle
Symmetry. Every row is a palindrome: C(n, k) = C(n, n−k). The triangle mirrors itself left-to-right, reflecting the symmetry of combinations.
Row Sums. The sum of all entries in row n equals 2ⁿ. This follows directly from the Binomial Theorem: (1+1)ⁿ = Σ C(n,k) = 2ⁿ. It also means the number of subsets of an n-element set is exactly 2ⁿ — a cornerstone of combinatorics.
Hockey Stick Identity. Summing a diagonal strip of entries — C(r,r) + C(r+1,r) + … + C(r+m,r) — always equals C(r+m+1, r+1). The pattern looks like a hockey stick on the triangle's face, with the sum forming the blade and the addends forming the shaft.
Prime Rows. If n is a prime number, then every interior coefficient C(n, k) for 1 ≤ k ≤ n−1 is divisible by n. This powerful divisibility property is used to prove Fermat's Little Theorem in elementary number theory.
Fibonacci Numbers. Summing shallow diagonals of Pascal's Triangle — tilted at 45° — produces the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, 21, … This hidden connection links the triangle to the golden ratio and spiral growth patterns in nature.
Sierpiński Triangle Fractal. Colour every odd entry one colour and every even entry another. As the number of rows grows, the pattern that emerges is Sierpiński's Triangle — a famous self-similar fractal. Try the "Highlight Odd" option in our calculator's triangle display mode to see this emerge for yourself.
Pascal's Triangle and Binomial Expansion
The Binomial Theorem states that (a + b)ⁿ = Σ C(n,k) × aⁿ⁻ᵏ × bᵏ for k from 0 to n. Row n of Pascal's Triangle provides the coefficients of this expansion directly. For example, row 4 gives (a + b)⁴ = a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴. This makes Pascal's Triangle an indispensable reference in algebra, polynomial multiplication, and probability.
Binomial Expansion Example
(x + 1)⁶ → Row 6: 1, 6, 15, 20, 15, 6, 1
= x⁶ + 6x⁵ + 15x⁴ + 20x³ + 15x² + 6x + 1
Pascal's Triangle in Probability
In probability theory, Pascal's Triangle counts the number of ways outcomes can occur in repeated independent trials. For n fair coin flips, the coefficients in row n give the number of ways to get exactly k heads for each k. Normalised by 2ⁿ, these become the binomial probability distribution — the most widely used discrete probability model in statistics, machine learning, and quality control.
Real-World Applications
Beyond pure mathematics, Pascal's Triangle appears in computer graphics (Bézier curves), cryptography (combinatorial counting), genetics (allele combination probabilities), finance (binomial option pricing models), and physics (quantum mechanical transition amplitudes). Whenever you count paths, partitions, or arrangements of discrete objects, Pascal's Triangle and its binomial coefficients are almost always involved.
Use our free Pascal Triangle Calculator above to generate any row instantly, visualise the full triangle with pattern highlighting, or batch-process hundreds of row indices in a single operation. Results can be copied to clipboard or downloaded as a CSV file for use in spreadsheets, research, or teaching materials.