Math 2.0

Combinatorics Basic counting Object

Pascal's triangle

Description

Pascal's triangle is the triangular array of the binomial coefficients. Its rows are numbered n=0,1,2,…n = 0, 1, 2, \dots from the top. Row nn has n+1n + 1 entries, (n0),(n1),…,(nn)\binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n}, from left to right.

The first five rows are these. 111121133114641\begin{array}{ccccccccc} & & & & 1 & & & & \\ & & & 1 & & 1 & & & \\ & & 1 & & 2 & & 1 & & \\ & 1 & & 3 & & 3 & & 1 & \\ 1 & & 4 & & 6 & & 4 & & 1 \end{array}

Each row starts and ends with 11. Each other entry is the sum of the two entries next to it in the row above, by Pascal's rule.

Remarks

Row nn lists the coefficients of (x+y)n(x + y)^n, by the binomial theorem. The sum of row nn is 2n2^n. This is the sum of binomial coefficients. Each row is symmetric, by the symmetry of binomial coefficients.

Further reading

  1. Web https://en.wikipedia.org/wiki/Pascal's_triangle, Formula
About this page
Tag05DME4TZ3K
URIm2://05DME4TZ3K
Kindobject
WritingW1 stated
MSC05A10
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • section Invariants: a table of the main invariants (0 of 1)
  • edge instance_of out (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.