Binomial theorem explained

In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial into a sum involving terms of the form, where the exponents and are nonnegative integers with, and the coefficient of each term is a specific positive integer depending on and . For example, for,$$(x+y)^4\; =\; x^4\; +\; 4\; x^3y\; +\; 6\; x^2\; y^2\; +\; 4\; x\; y^3\; +\; y^4.$$

\tbinom{n}{b} or \tbinom{n}{c} (the two have the same value). These coefficients for varying and can be arranged to form Pascal's triangle. These numbers also occur in combinatorics, where \tbinom{n}{b} gives the number of different combinations (i.e. subsets) of elements that can be chosen from an -element set. Therefore \tbinom{n}{b} is usually pronounced as " choose ".

History

Special cases of the binomial theorem were known since at least the 4th century BC when Greek mathematician Euclid mentioned the special case of the binomial theorem for exponent

n =2 .^[1] Greek mathematician Diophantus cubed various binomials, including x -1 . Indian mathematician Aryabhata's method for finding cube roots, from around 510 CE, suggests that he knew the binomial formula for exponent n =3 .

Binomial coefficients, as combinatorial quantities expressing the number of ways of selecting objects out of without replacement, were of interest to ancient Indian mathematicians. The earliest known reference to this combinatorial problem is the Chandaḥśāstra by the Indian lyricist Pingala (c. 200 BC), which contains a method for its solution.^[2] The commentator Halayudha from the 10th century AD explains this method. By the 6th century AD, the Indian mathematicians probably knew how to express this as a quotient $\backslash frac$,^[3] and a clear statement of this rule can be found in the 12th century text Lilavati by Bhaskara.

The first known formulation of the binomial theorem and the table of binomial coefficients appears in a work by Al-Karaji, quoted by Al-Samaw'al in his "al-Bahir".^{[4] [5] [6]} Al-Karaji described the triangular pattern of the binomial coefficients and also provided a mathematical proof of both the binomial theorem and Pascal's triangle, using an early form of mathematical induction. The Persian poet and mathematician Omar Khayyam was probably familiar with the formula to higher orders, although many of his mathematical works are lost. The binomial expansions of small degrees were known in the 13th century mathematical works of Yang Hui^[7] and also Chu Shih-Chieh. Yang Hui attributes the method to a much earlier 11th century text of Jia Xian, although those writings are now also lost.

In 1544, Michael Stifel introduced the term "binomial coefficient" and showed how to use them to express

( 1+ x) ^{n} in terms of ( 1+ x) ^{n-1} , via "Pascal's triangle".^[8] Blaise Pascal studied the eponymous triangle comprehensively in his Traité du triangle arithmétique.^[9] However, the pattern of numbers was already known to the European mathematicians of the late Renaissance, including Stifel, Niccolò Fontana Tartaglia, and Simon Stevin.

Isaac Newton is generally credited with discovering the generalized binomial theorem, valid for any real exponent, in 1665.^[10] It was discovered independently in 1670 by James Gregory.^[11]

Statement

According to the theorem, the expansion of any nonnegative integer power of the binomial is a sum of the form$$(x+y)^n\; =\; x^n\; y^0\; +\; x^\; y^1\; +\; x^\; y^2\; +\; \backslash cdots\; +\; x^1\; y^\; +\; x^0\; y^n,$$where each

\tbinom nk is a positive integer known as a binomial coefficient, defined as

$$\backslash binom\; nk\; =\; \backslash frac\; =\; \backslash frac.$$

This formula is also referred to as the binomial formula or the binomial identity. Using summation notation, it can be written more concisely as$$(x+y)^n\; =\; \backslash sum\_^n\; x^y^k\; =\; \backslash sum\_^n\; x^y^.$$

The final expression follows from the previous one by the symmetry of and in the first expression, and by comparison it follows that the sequence of binomial coefficients in the formula is symmetrical, $\backslash binom\; nk\; =\; \backslash binom\; n.$

A simple variant of the binomial formula is obtained by substituting for, so that it involves only a single variable. In this form, the formula reads

Examples

Here are the first few cases of the binomial theorem:In general, for the expansion of on the right side in the th row (numbered so that the top row is the 0th row):

• the exponents of in the terms are (the last term implicitly contains);
• the exponents of in the terms are (the first term implicitly contains);
• the coefficients form the th row of Pascal's triangle;
• before combining like terms, there are terms in the expansion (not shown);
• after combining like terms, there are terms, and their coefficients sum to .

An example illustrating the last two points: with

1 + 3 + 3 + 1 = 2 ^{3} .

A simple example with a specific positive value of :

A simple example with a specific negative value of :

Geometric explanation

For positive values of and, the binomial theorem with is the geometrically evident fact that a square of side can be cut into a square of side, a square of side, and two rectangles with sides and . With, the theorem states that a cube of side can be cut into a cube of side, a cube of side, three rectangular boxes, and three rectangular boxes.

(x ^{n)'=nx} ^{n-1} : ^[12] if one sets a = x and b = \Delta x, interpreting as an infinitesimal change in, then this picture shows the infinitesimal change in the volume of an -dimensional hypercube, (x + \Delta x) ^{n,} where the coefficient of the linear term (in \Delta x ) is nx ^{n-1} , the area of the faces, each of dimension :$$(x+\backslash Delta\; x)^n\; =\; x^n\; +\; nx^\backslash Delta\; x\; +\; \backslash binomx^(\backslash Delta\; x)^2\; +\; \backslash cdots.$$Substituting this into the definition of the derivative via a difference quotient and taking limits means that the higher order terms, (\Delta x) ^{2} and higher, become negligible, and yields the formula (x ^{n)'=nx} ^{n-1} , interpreted as

"the infinitesimal rate of change in volume of an -cube as side length varies is the area of of its -dimensional faces".If one integrates this picture, which corresponds to applying the fundamental theorem of calculus, one obtains Cavalieri's quadrature formula, the integral

style{\int x ^{n-1} dx = \tfrac{ 1 }{n} x ^{n}} – see proof of Cavalieri's quadrature formula for details.

Binomial coefficients

See main article: Binomial coefficient. The coefficients that appear in the binomial expansion are called binomial coefficients. These are usually written

\tbinom{n}{k}, and pronounced " choose ".

Formulas

The coefficient of is given by the formula$$\backslash binom\; =\; \backslash frac,$$which is defined in terms of the factorial function . Equivalently, this formula can be written$$\backslash binom\; =\; \backslash frac\; =\; \backslash prod\_^k\; \backslash frac\; =\; \backslash prod\_^\; \backslash frac$$with factors in both the numerator and denominator of the fraction. Although this formula involves a fraction, the binomial coefficient

\tbinom{n}{k} is actually an integer.

Combinatorial interpretation

The binomial coefficient

\tbinom nk can be interpreted as the number of ways to choose elements from an -element set. This is related to binomials for the following reason: if we write as a product$$(x+y)(x+y)(x+y)\backslash cdots(x+y),$$then, according to the distributive law, there will be one term in the expansion for each choice of either or from each of the binomials of the product. For example, there will only be one term, corresponding to choosing from each binomial. However, there will be several terms of the form, one for each way of choosing exactly two binomials to contribute a . Therefore, after combining like terms, the coefficient of will be equal to the number of ways to choose exactly elements from an -element set.

Proofs

Combinatorial proof

Expanding yields the sum of the products of the form where each is or . Rearranging factors shows that each product equals for some between and . For a given, the following are proved equal in succession:

• the number of terms equal to in the expansion
• the number of -character strings having in exactly positions
• the number of -element subsets of

\tbinom{n}{k}, either by definition, or by a short combinatorial argument if one is defining \tbinom{n}{k} as \tfrac{n!}{k! (n - k)!}. This proves the binomial theorem.

Example

The coefficient of inequals

\tbinom{ 3 }{ 2 } =3 because there are three strings of length 3 with exactly two 's, namely,$$xyy,\; \backslash ;\; yxy,\; \backslash ;\; yyx,$$corresponding to the three 2-element subsets of, namely,$$\backslash ,\backslash ;\backslash ,\backslash ;\backslash ,$$where each subset specifies the positions of the in a corresponding string.

Inductive proof

Induction yields another proof of the binomial theorem. When, both sides equal, since and

\tbinom{ 0 }{ 0 } =1 . Now suppose that the equality holds for a given ; we will prove it for . For, let denote the coefficient of in the polynomial . By the inductive hypothesis, is a polynomial in and such that is \tbinom{n}{k} if, and otherwise. The identity$$(x+y)^\; =\; x(x+y)^n\; +\; y(x+y)^n$$shows that is also a polynomial in and, and$$[(x+y)^\{n+1\}]\_\; =\; [(x+y)^n]\_\; +\; [(x+y)^n]\_,$$since if, then and . Now, the right hand side is$$\backslash binom\; +\; \backslash binom\; =\; \backslash binom,$$by Pascal's identity.^[13] On the other hand, if, then and, so we get . Thus$$(x+y)^\; =\; \backslash sum\_^\; \backslash binom\; x^\; y^k,$$which is the inductive hypothesis with substituted for and so completes the inductive step.

Generalizations

Newton's generalized binomial theorem

See main article: Binomial series. Around 1665, Isaac Newton generalized the binomial theorem to allow real exponents other than nonnegative integers. (The same generalization also applies to complex exponents.) In this generalization, the finite sum is replaced by an infinite series. In order to do this, one needs to give meaning to binomial coefficients with an arbitrary upper index, which cannot be done using the usual formula with factorials. However, for an arbitrary number, one can define$$=\backslash frac\; =\backslash frac,$$where

( ⋅ ) _{k} is the Pochhammer symbol, here standing for a falling factorial. This agrees with the usual definitions when is a nonnegative integer. Then, if and are real numbers with,^[14] and is any complex number, one has

When is a nonnegative integer, the binomial coefficients for are zero, so this equation reduces to the usual binomial theorem, and there are at most nonzero terms. For other values of, the series typically has infinitely many nonzero terms.

For example, gives the following series for the square root:$$\backslash sqrt\; =\; 1\; +\; \backslash fracx\; -\; \backslash fracx^2\; +\; \backslash fracx^3\; -\; \backslash fracx^4\; +\; \backslash fracx^5\; -\; \backslash cdots.$$

Taking, the generalized binomial series gives the geometric series formula, valid for :$$(1+x)^\; =\; \backslash frac\; =\; 1\; -\; x\; +\; x^2\; -\; x^3\; +\; x^4\; -\; x^5\; +\; \backslash cdots.$$

More generally, with, we have for :^[15] $$\backslash frac\; =\; \backslash sum\_^\backslash infty\; x^k\; =\; \backslash sum\_^\backslash infty\; (-1)^k\; x^k.$$

So, for instance, when,$$\backslash frac\; =\; 1\; -\; \backslash fracx\; +\; \backslash fracx^2\; -\; \backslash fracx^3\; +\; \backslash fracx^4\; -\; \backslash fracx^5\; +\; \backslash cdots.$$

Replacing with yields:$$\backslash frac\; =\; \backslash sum\_^\backslash infty\; (-1)^k\; (-x)^k\; =\; \backslash sum\_^\backslash infty\; x^k.$$

So, for instance, when, we have for :$$\backslash frac\; =\; 1\; +\; \backslash fracx\; +\; \backslash fracx^2\; +\; \backslash fracx^3\; +\; \backslash fracx^4\; +\; \backslash fracx^5\; +\; \backslash cdots.$$

Further generalizations

The generalized binomial theorem can be extended to the case where and are complex numbers. For this version, one should again assume and define the powers of and using a holomorphic branch of log defined on an open disk of radius centered at . The generalized binomial theorem is valid also for elements and of a Banach algebra as long as, and is invertible, and .

A version of the binomial theorem is valid for the following Pochhammer symbol-like family of polynomials: for a given real constant, define

x ^{(0)} = 1 and$$x^\; =\; \backslash prod\_^[x+(k-1)c]$$for n > 0 . Then^[16] $$(a\; +\; b)^\; =\; \backslash sum\_^\backslash binoma^b^.$$The case recovers the usual binomial theorem.

More generally, a sequence

\{p _{n\}} ^{inf ty} ^{n =0} of polynomials is said to be of binomial type if\deg p _{n} = n for all n ,p _{0(0)} = 1 , andp _{n(x+y)} = \sum ^{n} _{k =0} \binom{n}{k} p _{k(x)} p _{n-k} (y) for all x , y , and n .An operator Q on the space of polynomials is said to be the basis operator of the sequence \{p _{n\}} ^{inf ty} ^{n =0} if Qp _{0} = 0 and Q p _{n} = n p _{n-1} for all n \geqslant 1 . A sequence \{p _{n\}} ^{inf ty} ^{n =0} is binomial if and only if its basis operator is a Delta operator.^[17] Writing E ^{a} for the shift by a operator, the Delta operators corresponding to the above "Pochhammer" families of polynomials are the backward difference I - E ^{-c} for c> 0 , the ordinary derivative for c =0 , and the forward difference E ^{-c} - I for c< 0 .

Multinomial theorem

See main article: Multinomial theorem. The binomial theorem can be generalized to include powers of sums with more than two terms. The general version is

$$(x\_1\; +\; x\_2\; +\; \backslash cdots\; +\; x\_m)^n\; =\; \backslash sum\_\; \backslash binom\; x\_1^\; x\_2^\; \backslash cdots\; x\_m^,$$

where the summation is taken over all sequences of nonnegative integer indices through such that the sum of all is . (For each term in the expansion, the exponents must add up to ). The coefficients

\tbinom{n}{k _{1, … ,k} _{m}} are known as multinomial coefficients, and can be computed by the formula$$\backslash binom\; =\; \backslash frac.$$

Combinatorially, the multinomial coefficient

\tbinom{n}{k _{1, … ,k} _{m}} counts the number of different ways to partition an -element set into disjoint subsets of sizes .

Multi-binomial theorem

When working in more dimensions, it is often useful to deal with products of binomial expressions. By the binomial theorem this is equal to$$(x\_1+y\_1)^\backslash dotsm(x\_d+y\_d)^\; =\; \backslash sum\_^\backslash dotsm\backslash sum\_^\; \backslash binom\; x\_1^y\_1^\; \backslash dotsc\; \backslash binom\; x\_d^y\_d^.$$

This may be written more concisely, by multi-index notation, as$$(x+y)^\backslash alpha\; =\; \backslash sum\_\; \backslash binom\; x^\backslash nu\; y^.$$

General Leibniz rule

See main article: General Leibniz rule.

The general Leibniz rule gives the th derivative of a product of two functions in a form similar to that of the binomial theorem:^[18] $$(fg)^(x)\; =\; \backslash sum\_^n\; \backslash binom\; f^(x)\; g^(x).$$

Here, the superscript indicates the th derivative of a function,

f ^{(n)} (x) = \tfrac{d ^{n}{dx} ^{n}f(x)} . If one sets and, cancelling the common factor of from each term gives the ordinary binomial theorem.^[19]

Applications

Multiple-angle identities

For the complex numbers the binomial theorem can be combined with de Moivre's formula to yield multiple-angle formulas for the sine and cosine. According to De Moivre's formula,$$\backslash cos\backslash left(nx\backslash right)+i\backslash sin\backslash left(nx\backslash right)\; =\; \backslash left(\backslash cos\; x+i\backslash sin\; x\backslash right)^n.$$

Using the binomial theorem, the expression on the right can be expanded, and then the real and imaginary parts can be taken to yield formulas for and . For example, since$$\backslash left(\backslash cos\; x\; +\; i\backslash sin\; x\backslash right)^2\; =\; \backslash cos^2\; x\; +\; 2i\; \backslash cos\; x\; \backslash sin\; x\; -\; \backslash sin^2\; x=\; (\backslash cos^2\; x-\backslash sin^2\; x)\; +\; i(2\backslash cos\; x\backslash sin\; x),$$But De Moivre's formula identifies the left side with

(\cos x + i\sin x) ^{2} = \cos( 2 x) + i\sin( 2 x) , so$$\backslash cos(2x)\; =\; \backslash cos^2\; x\; -\; \backslash sin^2\; x\; \backslash quad\backslash text\backslash quad\backslash sin(2x)\; =\; 2\; \backslash cos\; x\; \backslash sin\; x,$$which are the usual double-angle identities. Similarly, since$$\backslash left(\backslash cos\; x\; +\; i\backslash sin\; x\backslash right)^3\; =\; \backslash cos^3\; x\; +\; 3i\; \backslash cos^2\; x\; \backslash sin\; x\; -\; 3\; \backslash cos\; x\; \backslash sin^2\; x\; -\; i\; \backslash sin^3\; x,$$De Moivre's formula yields$$\backslash cos(3x)\; =\; \backslash cos^3\; x\; -\; 3\; \backslash cos\; x\; \backslash sin^2\; x\; \backslash quad\backslash text\backslash quad\; \backslash sin(3x)\; =\; 3\backslash cos^2\; x\; \backslash sin\; x\; -\; \backslash sin^3\; x.$$In general,$$\backslash cos(nx)\; =\; \backslash sum\_\; (-1)^\; \backslash cos^\; x\; \backslash sin^k\; x$$and$$\backslash sin(nx)\; =\; \backslash sum\_\; (-1)^\; \backslash cos^\; x\; \backslash sin^k\; x.$$There are also similar formulas using Chebyshev polynomials.

Series for e

The number is often defined by the formula$$e\; =\; \backslash lim\_\; \backslash left(1\; +\; \backslash frac\backslash right)^n.$$

Applying the binomial theorem to this expression yields the usual infinite series for . In particular:$$\backslash left(1\; +\; \backslash frac\backslash right)^n\; =\; 1\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash cdots\; +\; \backslash frac.$$

The th term of this sum is$$\backslash frac\; =\; \backslash frac\backslash cdot\backslash frac$$

As, the rational expression on the right approaches, and therefore$$\backslash lim\_\; \backslash frac\; =\; \backslash frac.$$

This indicates that can be written as a series:$$e=\backslash sum\_^\backslash infty\backslash frac=\backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash cdots.$$

Indeed, since each term of the binomial expansion is an increasing function of, it follows from the monotone convergence theorem for series that the sum of this infinite series is equal to .

Probability

The binomial theorem is closely related to the probability mass function of the negative binomial distribution. The probability of a (countable) collection of independent Bernoulli trials

\{X _{t\}} _{t\in} with probability of success p\in [ 0 , 1 ] all not happening isP\left( c ap _{t\in} X ^{C\right)} _{t} = ( 1- p) ^{|S|} = \sum ^{|S|} _{n =0} {|S| \choose n} ( - p) ^{n.} An upper bound for this quantity is e ^{-p|S|} . ^[20]

In abstract algebra

The binomial theorem is valid more generally for two elements and in a ring, or even a semiring, provided that . For example, it holds for two matrices, provided that those matrices commute; this is useful in computing powers of a matrix.^[21]

The binomial theorem can be stated by saying that the polynomial sequence is of binomial type.

In popular culture

• The binomial theorem is mentioned in the Major-General's Song in the comic opera The Pirates of Penzance.
• Professor Moriarty is described by Sherlock Holmes as having written a treatise on the binomial theorem.
• The Portuguese poet Fernando Pessoa, using the heteronym Álvaro de Campos, wrote that "Newton's Binomial is as beautiful as the Venus de Milo. The truth is that few people notice it."^[22]
• In the 2014 film The Imitation Game, Alan Turing makes reference to Isaac Newton's work on the binomial theorem during his first meeting with Commander Denniston at Bletchley Park.

See also

• Binomial approximation
• Binomial distribution
• Binomial inverse theorem
• Stirling's approximation
• Tannery's theorem
• Polynomials calculating sums of powers of arithmetic progressions
• q-binomial theorem

Further reading

• Bag. Amulya Kumar. 1966. Binomial theorem in ancient India. Indian J. History Sci. 1. 1. 68–74.
• Book: Graham. Ronald. Donald . Knuth. Oren. Patashnik. Concrete Mathematics. limited. Addison Wesley. 1994. 2nd. 153–256. (5) Binomial Coefficients. 978-0-201-55802-9. 17649857.

External links

• • Binomial Theorem by Stephen Wolfram, and "Binomial Theorem (Step-by-Step)" by Bruce Colletti and Jeff Bryant, Wolfram Demonstrations Project, 2007.

Notes and References

1. The Story of the Binomial Theorem. J. L.. Coolidge. The American Mathematical Monthly. 56. 3. 1949. 147–157. 10.2307/2305028. 2305028.
2. Book: A history of Chinese mathematics. Jean-Claude Martzloff. S.S. Wilson. J. Gernet. J. Dhombres. Springer. 1987.
3. Biggs. N. L.. The roots of combinatorics. Historia Math.. 6. 1979. 2. 109–136. 10.1016/0315-0860(79)90074-0. free.
4. Yadegari . Mohammad . 1980 . The Binomial Theorem: A Widespread Concept in Medieval Islamic Mathematics . Historia Mathematica . 7 . 4 . 401–406 . 10.1016/0315-0860(80)90004-X . free .
5. Stillwell . John . 2015 . Taming the unknown. A history of algebra ... by Victor J. Katz and Karen Hunger Parshall . Book review . Bulletin of the American Mathematical Society . 52 . 4 . 725–731 . 727 . However, algebra advanced in other respects. Around 1000, al-Karaji stated the binomial theorem . 10.1090/S0273-0979-2015-01491-6 . free.
6. Book: Rashed, Roshdi . The Development of Arabic Mathematics: Between Arithmetic and Algebra . 1994 . Kluwer . 0-7923-2565-6 . 63.
7. Web site: Landau . James A. . Historia Matematica Mailing List Archive: Re: [HM] Pascal's Triangle ]. Archives of Historia Matematica . mailing list email . 2007-04-13 . 1999-05-08 . 2021-02-24 . https://web.archive.org/web/20210224081637/http://archives.math.utk.edu/hypermail/historia/may99/0073.html . dead .
8. Book: Kline, Morris. History of mathematical thought. Morris Kline. 273. Oxford University Press. 1972.
9. Book: Katz, Victor. A History of Mathematics: An Introduction. Addison-Wesley. 2009. 978-0-321-38700-4. 491. 14.3: Elementary Probability.
10. Book: Bourbaki, N.. Elements of the History of Mathematics Paperback. 18 November 1998. J. Meldrum . John D. P. Meldrum. 978-3-540-64767-6. registration.
11. Book: Stillwell . John . Mathematics and its history . 2010 . Springer . 978-1-4419-6052-8 . 186 . third.
12. Barth . Nils R.. Computing Cavalieri's Quadrature Formula by a Symmetry of the n-Cube . 10.2307/4145193 . 4145193 . The American Mathematical Monthly. 0002-9890. 111. 9. 811–813 . 2004.
13. http://proofs.wiki/Binomial_theorem Binomial theorem
14. This is to guarantee convergence. Depending on, the series may also converge sometimes when .
15. Web site: Negative Binomial Series. Wolfram MathWorld. Weisstein. Eric W..
16. Problem 352. Dan. Sokolowsky. Basil C.. Rennie. Crux Mathematicorum. 5. 2. February 1979 . 55–56.
17. Book: Aigner . Martin . Combinatorial Theory . limited . Reprint of the 1979 Edition . 1997 . Springer . 3-540-61787-6 . 105.
18. Book: Olver, Peter J. . 2000 . Applications of Lie Groups to Differential Equations . Springer . 318–319 . 9780387950006 .
19. Book: Spivey . Michael Z. . The Art of Proving Binomial Identities . 2019 . CRC Press . 978-1351215800 . 71.
20. Book: Data Compression. Cover. Thomas M.. Thomas. Joy A.. 2001-01-01. John Wiley & Sons, Inc.. 9780471200611. 320. en. 10.1002/0471200611.ch5.
21. Artin, Algebra, 2nd edition, Pearson, 2018, equation (4.7.11).
22. Web site: Arquivo Pessoa: Obra Édita - O binómio de Newton é tão belo como a Vénus de Milo.. arquivopessoa.net.