Generate, explore, and discover patterns in Pascal's Triangle
Generate Pascal's Triangle up to a specified number of rows
Maximum 30 rows for display
Calculate C(n,k) = n! / (k! × (n-k)!)
Get any specific row of Pascal's Triangle
Row 0 = [1], Row 1 = [1,1], Row 2 = [1,2,1], ...
Discover hidden patterns in Pascal's Triangle
The second diagonal contains all natural numbers: 1, 2, 3, 4, 5, ...
The third diagonal: 1, 3, 6, 10, 15, ... (sums 1+2+3+...)
Sum shallow diagonals: 1, 1, 2, 3, 5, 8, 13, ...
Row sums: 1, 2, 4, 8, 16, 32, ... (2ⁿ)
First rows read as numbers: 1, 11, 121, 1331, 14641, ...
Color odd numbers to reveal a fractal pattern
Formulas, properties, and theoretical background
Sum of row n equals 2ⁿ
Σ C(n,k) = 2ⁿ
(a+b)ⁿ = Σ C(n,k) × aⁿ⁻ᵏ × bᵏ
Sum along a diagonal equals the element below
Blaise Pascal (1623-1662), French mathematician
Yang Hui's Triangle (China, 13th century)
Tartaglia's Triangle (Italy)
Ancient India (Pingala, 2nd century BCE) - used in prosody
An infinite triangular array of binomial coefficients.
Element at row n, position k equals C(n,k).
Essential tool in mathematics and science.