Math 2.0

statement theorem

Binomial theorem

Statement

Let RR be a commutative ring, let x,y∈Rx, y \in R, and let nn be a natural number. Then (x+y)n=∑k=0n(nk)xkyn−k.(x + y)^n = \sum_{k=0}^{n} \binom{n}{k} x^k y^{n-k}. Here (nk)\binom{n}{k} is the binomial coefficient, and the integer (nk)\binom{n}{k} acts on RR by repeated addition.

Remarks

For n=2n = 2 it gives (x+y)2=x2+2xy+y2(x + y)^2 = x^2 + 2xy + y^2. For n=3n = 3 it gives x3+3x2y+3xy2+y3x^3 + 3x^2 y + 3x y^2 + y^3. The formula stays true in a noncommutative ring when xy=yxxy = yx. With x=y=1x = y = 1 it gives the sum of binomial coefficients. With x=−1x = -1 and y=1y = 1 it gives the alternating sum. The multinomial theorem extends it to sums of more than two terms.

Explanations

L1 human

When you expand (x+y)n(x + y)^n, each term comes from choosing xx or yy in each of the nn factors. The term xkyn−kx^k y^{n-k} appears once for each choice of the kk factors that give xx, so its coefficient is (nk)\binom{n}{k}.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

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

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Binomial coefficient definition
  2. Binomial theorem statement

Sources

  1. Web https://en.wikipedia.org/wiki/Binomial_theorem, Statement