Ekuation

operation

Pascal\'s Triangle Generator

Generate and explore Pascal\'s triangle up to row n, with connection to C(n,k).

Back to Combinatorics Calculator

Die Gesamtzahl der verschiedenen Elemente in der Menge

Die Anzahl der aus der Gesamtmenge gewählten oder angeordneten Elemente

Formel
C(n,r)=n!r!(nr)!C(n,\,r) = \dfrac{n!}{r!\cdot(n-r)!}

Beispiel ausprobieren

Wähle ein Szenario, um zu sehen, wie der Rechner funktioniert, und passe dann die Werte an

Row 6 of Pascal's Triangle

Generate row 6 to see the coefficients of (a+b)⁶.

Wichtige Werte: n = 6 · Row 6: 1, 6, 15, 20, 15, 6, 1

Diagonal Pattern — Triangular Numbers

The third diagonal of Pascal's triangle gives triangular numbers: 1, 3, 6, 10, 15...

Wichtige Werte: n = 10 · C(10,2) = 45

Dokumentation

What Is Pascal's Triangle?

Pascal's triangle is a triangular array of numbers where each entry is the sum of the two entries directly above it. Row nn, position kk holds the binomial coefficient (nk)\binom{n}{k}. The triangle starts with row 0 at the top (a single 1), and each subsequent row has one more entry than the previous.

        1
       1 1
      1 2 1
     1 3 3 1
    1 4 6 4 1
   1 5 10 10 5 1

In this calculator, the interactive Pascal's triangle renders up to row 30. Click any cell to set nn and rr and compute the corresponding binomial coefficient.


Key Patterns in Pascal's Triangle

Row Sums

The sum of all entries in row nn equals 2n2^n—the total number of subsets of an nn-element set:

k=0n(nk)=2n\sum_{k=0}^{n} \binom{n}{k} = 2^n

Symmetry

Each row is a palindrome. This reflects the identity:

(nk)=(nnk)\binom{n}{k} = \binom{n}{n-k}

Choosing kk items to include is the same as choosing nkn-k items to exclude.

Diagonals

DiagonalSequenceFormula
1st1, 1, 1, 1, …(n0)=1\binom{n}{0} = 1
2nd1, 2, 3, 4, …(n1)=n\binom{n}{1} = n
3rd1, 3, 6, 10, …(n2)=n(n1)2\binom{n}{2} = \frac{n(n-1)}{2}
4th1, 4, 10, 20, …(n3)=n(n1)(n2)6\binom{n}{3} = \frac{n(n-1)(n-2)}{6}

Hockey Stick Pattern

If you take any diagonal of consecutive entries and sum them, the result equals the entry one row down and one position to the side:

i=0r(n+ii)=(n+r+1r)\sum_{i=0}^{r} \binom{n+i}{i} = \binom{n+r+1}{r}

This is called the "hockey stick" identity because the pattern of summed entries plus the result forms a hockey stick shape in the triangle.


Connection to the Binomial Theorem

Row nn of Pascal's triangle gives exactly the coefficients of the expansion of (a+b)n(a + b)^n:

(a+b)n=k=0n(nk)ankbk(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k

For example, row 4 is [1, 4, 6, 4, 1], giving:

(a+b)4=a4+4a3b+6a2b2+4ab3+b4(a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4

This makes Pascal's triangle an indispensable tool for expanding binomial expressions without tedious multiplication.


Applications

  • Probability: The binomial distribution uses row entries directly. The probability of getting exactly kk heads in nn fair coin flips is (nk)2n\frac{\binom{n}{k}}{2^n}.
  • Combinatorics: Every entry (nk)\binom{n}{k} answers the question "how many ways can I choose kk items from nn?"
  • Number theory: The triangle encodes divisibility patterns. Row pp (where pp is prime) has all interior entries divisible by pp.
  • Fractal geometry: Coloring odd entries in Pascal's triangle produces the Sierpiński triangle, a self-similar fractal.

Historical note: Although named after Blaise Pascal (who published his Traité du Triangle Arithmétique in 1653), the triangle was known centuries earlier. Chinese mathematician Jia Xian described it around 1050, and it appears in a 1303 work by Zhu Shijie. In China it is still called Yang Hui's triangle.


Frequently Asked Questions

What is Pascal's triangle?

Pascal's triangle is a triangular array of numbers where each entry is the sum of the two entries directly above it. Row nn, position kk holds the binomial coefficient (nk)\binom{n}{k}. It starts with a single 1 at the top (row 0) and each subsequent row has one more entry.

How is Pascal's triangle constructed?

Start with a 1 at the top. Each subsequent row begins and ends with 1. Every interior entry is the sum of the two entries directly above it: (nk)=(n1k1)+(n1k)\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}. For example, the 6 in row 4 comes from adding the 3 and 3 above it in row 3.

What patterns are hidden in Pascal's triangle?

Key patterns include: each row sums to 2n2^n (total subsets of an n-element set), rows are symmetric (palindromes), diagonals contain natural numbers, triangular numbers, and tetrahedral numbers, and the hockey stick identity allows summing consecutive diagonal entries. Coloring odd entries reveals the Sierpinski triangle fractal.

How does Pascal's triangle connect to the binomial theorem?

Row nn of Pascal's triangle gives the coefficients of the expansion of (a+b)n(a + b)^n. For example, row 4 is [1, 4, 6, 4, 1], giving (a+b)4=a4+4a3b+6a2b2+4ab3+b4(a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4. This makes the triangle indispensable for expanding binomial expressions.

How is Pascal's triangle used in probability?

The binomial distribution uses entries directly. The probability of exactly kk heads in nn fair coin flips is (nk)2n\frac{\binom{n}{k}}{2^n}. For example, getting exactly 2 heads in 4 flips has probability (42)24=616=37.5%\frac{\binom{4}{2}}{2^4} = \frac{6}{16} = 37.5\%.

Related operation Variants

Explore more operation options

More Math Calculators

Explore the category

Rechnersuche

Rechner suchen und finden