Binomial theorem

From Wikipedia, the free encyclopedia

In mathematics, the binomial theorem is an important formula giving the expansion of powers of sums. Its simplest version says

$(x+y)^n=\sum_{k=0}^n{n \choose k}x^{n-k}y^{k}\quad\quad\quad(1)$

whenever n is any non-negative integer, the numbers

${n \choose k}=\frac{n!}{k!\,(n-k)!}$

are the binomial coefficients, and n! denotes the factorial of n.

This formula and the triangular arrangement of the binomial coefficients are often attributed to Blaise Pascal, who described them in the 17th century. However, it was known to many mathematicians who preceded him. 13th century Chinese mathematician Yang Hui, 11th century Persian mathematician Omar Khayyám, and 3rd century BC Indian mathematician Pingala all derived similar results.^{[citation needed]}

For example, here are the cases where $2 \le n \le 5$ :

$(x + y)^2 = x^2 + 2xy + y^2\,$

$(x + y)^3 = x^3 + 3x^2y + 3xy^2 + y^3\,$

$(x + y)^4 = x^4 + 4x^3y + 6x^2y^2 + 4xy^3 + y^4\,$

$(x + y)^5 = x^5 + 5x^4y + 10x^3y^2 + 10x^2y^3 +5xy^4 + y^5\,$

Formula (1) is valid for all real or complex numbers x and y, and more generally for any elements x and y of a semiring as long as xy = yx.

1 Newton's generalized binomial theorem
2 "Binomial type"
3 Proof
4 Binomial number
5 A quick way to expand binomials
6 Trivia
7 References
8 See also

[edit] Newton's generalized binomial theorem

Isaac Newton generalized the formula to other exponents by considering an infinite series:

${(x+y)^r=\sum_{k=0}^\infty {r \choose k} x^{r-k} y^k \quad\quad\quad(2)}$

where r can be any complex number (in particular r can be any real number, not necessarily positive and not necessarily an integer), and the coefficients are given by

$\begin{align} {r \choose k} &{}= {1 \over k!}\prod_{n=0}^{k-1}(r-n)=\frac{r(r-1)(r-2)\cdots(r-(k-1))}{k!}. \end{align}$

In case k = 0, this is a product of no numbers at all and therefore equal to 1, and in case k = 1 it is equal to r, as the additional factors (r − 1), etc., do not appear.

Another way to express this quantity is

${r \choose k}=\frac{(-1)^k}{k!}(-r)_k,$

which is important when one is working with infinite series and would like to represent them in terms of generalized hypergeometric functions. The notation $(\cdot)_k$ is the Pochhammer symbol. This form is vital in applied mathematics, for example, when evaluating the formulas that model the statistical properties of the phase-front curvature of a light wave as it propagates through optical atmospheric turbulence.

A particularly handy but non-obvious form holds for the reciprocal power:

$\frac{1}{(1-x)^r}=\sum_{k=0}^\infty {r+k-1 \choose k} x^k \equiv \sum_{k=0}^\infty {r+k-1 \choose r-1} x^k.$

For a more extensive account of Newton's generalized binomial theorem, see binomial series.

The sum in (2) converges and the equality is true whenever the real or complex numbers x and y are "close together" in the sense that the absolute value | x/y | is less than one.

The geometric series is a special case of (2) where we choose y = 1 and r = −1.

Formula (2) is also valid for elements x and y of a Banach algebra as long as xy = yx, y is invertible and ||x/y|| < 1.

[edit] "Binomial type"

The binomial theorem can be stated by saying that the polynomial sequence

$\left\{\,x^k:k=0,1,2,\dots\,\right\}\,$

is of binomial type.

[edit] Proof

One way to prove the binomial theorem is with mathematical induction. When n = 0, we have

$(a+b)^0 = 1 = \sum_{k=0}^0 { 0 \choose k } a^{0-k}b^k.$

For the inductive step, assume the theorem holds when the exponent is $m$ . Then for n = m + 1

$(a+b)^{m+1} = a(a+b)^m + b(a+b)^m \,$

$= a \sum_{k=0}^m { m \choose k } a^{m-k} b^k + b \sum_{j=0}^m { m \choose j } a^{m-j} b^j$ by the inductive hypothesis

$= \sum_{k=0}^m { m \choose k } a^{m-k+1} b^k + \sum_{j=0}^m { m \choose j } a^{m-j} b^{j+1}$ by multiplying through by

a

and

b

$= a^{m+1} + \sum_{k=1}^m { m \choose k } a^{m-k+1} b^k + \sum_{j=0}^m { m \choose j } a^{m-j} b^{j+1}$ by pulling out the

k = 0

term

$= a^{m+1} + \sum_{k=1}^m { m \choose k } a^{m-k+1} b^k + \sum_{k=1}^{m+1} { m \choose k-1 }a^{m-k+1}b^{k}$ by letting

j = k - 1

$= a^{m+1} + \sum_{k=1}^m { m \choose k } a^{m-k+1}b^k + \sum_{k=1}^{m} { m \choose k-1 }a^{m+1-k}b^{k} + b^{m+1}$ by pulling out the

k = m + 1

term from the right hand side

$= a^{m+1} + b^{m+1} + \sum_{k=1}^m \left[ { m \choose k } + { m \choose k-1 } \right] a^{m+1-k}b^k$ by combining the sums

$= a^{m+1} + b^{m+1} + \sum_{k=1}^m { m+1 \choose k } a^{m+1-k}b^k$ from Pascal's rule

$= \sum_{k=0}^{m+1} { m+1 \choose k } a^{m+1-k}b^k$ by adding in the

m + 1

terms.

as desired.

[edit] Binomial number

A binomial number is a number in the form of $x^n \pm y^n$ . These binomial numbers can be factored algebraically.

$x^n\pm y^n=(x\pm y)(x^{n-1} \mp x^{n-2}y + \cdots \mp xy^{n-2} + y^{n-1})$

Examples:

x 2 - y 2 = (x - y)(x + y)

x 3 - y 3 = (x - y)(x 2 + x y + y 2)

x 3 + y 3 = (x + y)(x 2 - x y + y 2)

x 8 - y 8 = (x - y)(x + y)(x 2 + y 2)(x 4 + y 4)

[edit] A quick way to expand binomials

To quickly expand binomials of the form

(x + y) n

The first term is

x n

(this follows directly from the generalized binomial theorem) and the coefficient of each subsequent term is the current coefficient multiplied by the current exponent of x, divided by the current term number. Exponents of x decrease each term, while exponents of y increase each term (from 0 in the first term) until the exponent of x is 0.

Example:

$(x+y)^{10}\,$

The first term is

$x^{10}.\,$

To find the coefficient of the second term, multiply 1 (the current coefficient) by 10 (the current exponent of x), and divide by the current term number (1, since this is the first term) to get 10. The exponent of x decrements, and the exponent of y increments. The next term is therefore

$10x^9y.\,$

Similarly, the next coefficient is 10×9/2, which gives 45. After that, it is (10×9×8)/(3×2×1). This continues until (10×9×8×7×6)/(5×4×3×2×1), after which, the coefficients are symmetrical. The whole thing is

$x^{10}+10x^9y+45x^8y^2+120x^7y^3+210x^6y^4+252x^5y^5+210x^4y^6+120x^3y^7+45x^2y^8+10xy^9+y^{10}.\,$

Notice that the coefficients are perfectly symmetrical. This will happen when the coefficients of x and y within the parentheses of the original expression are the same. Recognizing this can save even more time.

If the original expression instead was

$(2x+y)^{10},\,$

then the resulting expansion would be the same, except with (2x) in place of x in every place. The factor of 2 must get raised to the power of x in each term. The same holds true if either x or y is raised to a power inside the parentheses of the original expression.

[edit] Trivia

In the Sherlock Holmes books, the villain Professor Moriarty is the author of A Treatise on the Binomial Theorem.

The binomial theorem is mentioned in the Gilbert and Sullivan song "I am the Very Model of a Modern Major General".

The binomial theorem appears in at least three different works by Monty Python - Coal Mine in Llandarogh Carmarthen, The Tale of Happy Valley, and The Meaning of Life.

The binomial theorem is mentioned in the TV series NUMB3RS in episode #217 ("Mind Games") in Season 2.

The generalized binomial theorem is engraved on Isaac Newton's tomb in Westminster Abbey.

[edit] References

Amulya Kumar Bag. Binomial Theorem in Ancient India. Indian J.History Sci.,1:68-74,1966.

[edit] See also

This article incorporates material from inductive proof of binomial theorem on PlanetMath, which is licensed under the GFDL.

Retrieved from "http://en.wikipedia.org../../../b/i/n/Binomial_theorem.html"

Binomial theorem

From Wikipedia, the free encyclopedia

Contents

[edit] Newton's generalized binomial theorem

[edit] "Binomial type"

[edit] Proof

[edit] Binomial number

[edit] A quick way to expand binomials

[edit] Trivia

[edit] References

[edit] See also

Views

Navigation

interaction

Search

In other languages