مبرهنة ذات الحدين

${\begin{array}{c}1\\1\quad 1\\1\quad 2\quad 1\\1\quad 3\quad 3\quad 1\\1\quad 4\quad 6\quad 4\quad 1\\1\quad 5\quad 10\quad 10\quad 5\quad 1\\1\quad 6\quad 15\quad 20\quad 15\quad 6\quad 1\\1\quad 7\quad 21\quad 35\quad 35\quad 21\quad 7\quad 1\end{array}}$

The binomial coefficient ${\tbinom {n}{k}}$ appears as the kth entry in the nth row of Pascal's triangle (counting starts at 0, i.e.: the top row is the 0th row). Each entry is the sum of the two above it.

في الجبر الابتدائي، مبرهنة ذات الحدين Binomial theorem أو ثنائي نيوتن هي صيغة وضعها نيوتن لإيجاد نشر لثنائي مرفوع بقوة صحيحة ما. و يطلق على هذه الصيغة صيغة ثنائي نيوتن، أو ببساطة صيغة الثنائي. According to the theorem, it is possible to expand the polynomial (x + y)ⁿ into a sum involving terms of the form ax^by^c, where the exponents b and c are nonnegative integers with b + c = n, and the coefficient a of each term is a specific positive integer depending on n and b. For example, for n = 4,

$$(x+y)^{4}=x^{4}+4x^{3}y+6x^{2}y^{2}+4xy^{3}+y^{4}.$$

The coefficient a in the term of ax^by^c is known as the binomial coefficient ${\tbinom {n}{b}}$ or ${\tbinom {n}{c}}$ (the two have the same value). These coefficients for varying n and b can be arranged to form Pascal's triangle. These numbers also occur in combinatorics, where ${\tbinom {n}{b}}$ gives the number of different combinations of b elements that can be chosen from an n-element set. Therefore ${\tbinom {n}{b}}$ is often pronounced as "n choose b".

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

 التاريخ

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 2. Greek mathematican Diophantus cubed various binomials, including $n-1$. Indian mathematican Aryabhata's method for finding cube roots, from around 510 CE, suggests that he knew the binomial formula for exponent 3.

Binomial coefficients, as combinatorial quantities expressing the number of ways of selecting k objects out of n 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.^:230 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 ${\textstyle {\frac {n!}{(n-k)!k!}}}$, and a clear statement of this rule can be found in the 12th century text Lilavati by Bhaskara.

The first formulation of the binomial theorem and the table of binomial coefficients, to our knowledge, can be found in a work by Al-Karaji, quoted by Al-Samaw'al in his "al-Bahir". 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 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.^:142

In 1544, Michael Stifel introduced the term "binomial coefficient" and showed how to use them to express $(1+a)^{n}$ in terms of $(1+a)^{n-1}$, via "Pascal's triangle". Blaise Pascal studied the eponymous triangle comprehensively in his Traité du triangle arithmétique. 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 rational exponent, in 1665. It was discovered independently in 1670 by James Gregory.

 الصيغة

فلنعتبر ثنائيا متكونا من عنصرين x و y معرفين على مجموعة حيث xy=yx، و عددا صحيحا طبييعا n،

$(x+y)^{n}=\sum _{k=0}^{n}{n \choose k}x^{n-k}y^{k}$

حيث الأعداد ${n \choose k}$ (و التي تكتب أحيانا $C_{n}^{k}$) هي الضوارب الثنائية.

هذا المجموع يعتمد على الضوارب الثنائية الموجودة على أحد سطور مثلث باسكال.

تغيير y بـ - y داخل الصيغة، يعطي الصيغة :

$(x-y)^{n}=\sum _{k=0}^{n}(-1)^{k}{n \choose k}x^{n-k}y^{k}$

مثال :

$n=2~,\qquad (x+y)^{2}=x^{2}+2xy+y^{2}\,$

$n=3~,\qquad (x-y)^{3}=x^{3}-3x^{2}y+3xy^{2}-y^{3}\,$

$n=4~,\qquad (x+y)^{4}=x^{4}+4x^{3}y+6x^{2}y^{2}+4xy^{3}+y^{4}\,$

 التبيان

فلتكن x، y عناصر من مجموعة حيث xy=yx و n عددا طبيعيا صحيحا.

$(x+y)^{n}=\sum _{k=0}^{n}{n \choose k}x^{n-k}y^{k}$

فلنبين هذه الصيغة بالـ "الطريقة التراجعية" :

 البداية

$n=0~,\qquad (x+y)^{0}=1={0 \choose 0}x^{0}y^{0}$

$n=1~,\qquad (x+y)^{1}=x+y={1 \choose 0}x^{1}y^{0}+{1 \choose 1}x^{0}y^{1}$

 صحة العنصر التالي

فليكن n عددا صحيحا طبيعيا أكبر أو مساو لـ 1, فلنبين أن العلاقات صحيحة لـ n + 1 إذا كانت صحيحة لـ n:

حسب الافتراض الاول :

$(x+y)^{n+1}=(x+y)\cdot \sum _{k=0}^{n}{n \choose k}x^{n-k}y^{k},$

بتوزيعية $\cdot$ على $+$ :

$(x+y)^{n+1}=x^{n+1}+x\cdot \sum _{k=1}^{n}{n \choose k}x^{n-k}y^{k}+y\cdot \sum _{k=0}^{n-1}{n \choose k}x^{n-k}y^{k}+y^{n+1}$

بالتفكيك إلى جذاء :

$(x+y)^{n+1}=x^{n+1}+\sum _{k=1}^{n}\left\lbrack {{n} \choose {k}}+{{n} \choose {k-1}}\right\rbrack x^{n-k+1}y^{k}+y^{n+1}$

باستعمال صيغة مثلث باسكال :

$(x+y)^{n+1}=x^{n+1}+\sum _{k=1}^{n}{{n+1} \choose k}~x^{n-k+1}y^{k}+y^{n+1}$

وهو ما ينهي التبيان.

 الشرح الهندسي

Visualisation of binomial expansion up to the 4th power

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

In calculus, this picture also gives a geometric proof of the derivative $(x^{n})'=nx^{n-1}:$ if one sets $a=x$ and $b=\Delta x,$ interpreting b as an infinitesimal change in a, then this picture shows the infinitesimal change in the volume of an n-dimensional hypercube, $(x+\Delta x)^{n},$ where the coefficient of the linear term (in $\Delta x$) is $nx^{n-1},$ the area of the n faces, each of dimension $(n-1):$

$(x+\Delta x)^{n}=x^{n}+nx^{n-1}\Delta x+{\tbinom {n}{2}}x^{n-2}(\Delta x)^{2}+\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 n-cube as side length varies is the area of n of its $(n-1)$-dimensional faces".

If one integrates this picture, which corresponds to applying the fundamental theorem of calculus, one obtains Cavalieri's quadrature formula, the integral $\textstyle {\int x^{n-1}\,dx={\tfrac {1}{n}}x^{n}}$ – see proof of Cavalieri's quadrature formula for details.

 المعاملات الثنائية

المقالة الرئيسية: معامل ثنائي

المعاملات التي تظهر في التمديد ثنائي الحدين تسمى المعاملات الثنائية. These are usually written ${\tbinom {n}{k}}$, and pronounced “n choose k”.

 الصيغ

The coefficient of x^n−ky^k is given by the formula

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

which is defined in terms of the factorial function n!. Equivalently, this formula can be written

${n \choose k}={\frac {n(n-1)\cdots (n-k+1)}{k(k-1)\cdots 1}}=\prod _{\ell =1}^{k}{\frac {n-\ell +1}{\ell }}=\prod _{\ell =0}^{k-1}{\frac {n-\ell }{k-\ell }}$

with k factors in both the numerator and denominator of the fraction. Note that, although this formula involves a fraction, the binomial coefficient ${\tbinom {n}{k}}$ is actually an integer.

 التفسير التوافيقي

The binomial coefficient ${\tbinom {n}{k}}$ can be interpreted as the number of ways to choose k elements from an n-element set. This is related to binomials for the following reason: if we write (x + y)ⁿ as a product

$(x+y)(x+y)(x+y)\cdots (x+y),$

then, according to the distributive law, there will be one term in the expansion for each choice of either x or y from each of the binomials of the product. For example, there will only be one term xⁿ, corresponding to choosing x from each binomial. However, there will be several terms of the form xⁿ⁻²y², one for each way of choosing exactly two binomials to contribute a y. Therefore, after combining like terms, the coefficient of xⁿ⁻²y² will be equal to the number of ways to choose exactly 2 elements from an n-element set.

 البراهين

 البرهان التوافيقي

 مثال

The coefficient of xy² in

${\begin{aligned}(x+y)^{3}&=(x+y)(x+y)(x+y)\\&=xxx+xxy+xyx+{\underline {xyy}}+yxx+{\underline {yxy}}+{\underline {yyx}}+yyy\\&=x^{3}+3x^{2}y+{\underline {3xy^{2}}}+y^{3}.\end{aligned}}$

equals ${\tbinom {3}{2}}=3$ because there are three x,y strings of length 3 with exactly two y's, namely,

$xyy,\;yxy,\;yyx,$

corresponding to the three 2-element subsets of { 1, 2, 3 }, namely,

$\{2,3\},\;\{1,3\},\;\{1,2\},$

where each subset specifies the positions of the y in a corresponding string.

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

 الحالة العامة

Expanding (x + y)ⁿ yields the sum of the 2 ⁿ products of the form e₁e₂ ... e _n where each e _i is x or y. Rearranging factors shows that each product equals x^n−ky^k for some k between 0 and n. For a given k, the following are proved equal in succession:

• the number of copies of x^n − ky^k in the expansion
• the number of n-character x,y strings having y in exactly k positions
• the number of k-element subsets of { 1, 2, ..., n}
• ${n \choose k}$ (this is either by definition, or by a short combinatorial argument if one is defining ${n \choose k}$ as ${\frac {n!}{k!(n-k)!}}$).

This proves the binomial theorem.

 Inductive proof

Induction yields another proof of the binomial theorem. When n = 0, both sides equal 1, since x⁰ = 1 and ${\tbinom {0}{0}}=1$. Now suppose that the equality holds for a given n; we will prove it for n + 1. For j, k ≥ 0, let [ƒ(x, y)] _j,k denote the coefficient of x^jy^k in the polynomial ƒ(x, y). By the inductive hypothesis, (x + y)ⁿ is a polynomial in x and y such that [(x + y)ⁿ] _j,k is ${\tbinom {n}{k}}$ if j + k = n, and 0 otherwise. The identity

$(x+y)^{n+1}=x(x+y)^{n}+y(x+y)^{n}$

shows that (x + y)^{n + 1} also is a polynomial in x and y, and

$[(x+y)^{n+1}]_{j,k}=[(x+y)^{n}]_{j-1,k}+[(x+y)^{n}]_{j,k-1},$

since if j + k = n + 1, then (j − 1) + k = n and j + (k − 1) = n. Now, the right hand side is

${\binom {n}{k}}+{\binom {n}{k-1}}={\binom {n+1}{k}},$

by Pascal's identity. On the other hand, if j +k ≠ n + 1, then (j – 1) + k ≠ n and j +(k – 1) ≠ n, so we get 0 + 0 = 0. Thus

$(x+y)^{n+1}=\sum _{k=0}^{n+1}{\tbinom {n+1}{k}}x^{n+1-k}y^{k},$

which is the inductive hypothesis with n + 1 substituted for n and so completes the inductive step.

 التعميمات

 مبرهنة ذات الحدين المعممة لنيوتن

المقالة الرئيسية: 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 r, one can define

$${r \choose k}={\frac {r(r-1)\cdots (r-k+1)}{k!}}={\frac {(r)_{k}}{k!}},$$

where $(\cdot )_{k}$ is the Pochhammer symbol, here standing for a falling factorial. This agrees with the usual definitions when r is a nonnegative integer. Then, if x and y are real numbers with |x| > |y|, and r is any complex number, one has

$${\begin{aligned}(x+y)^{r}&=\sum _{k=0}^{\infty }{r \choose k}x^{r-k}y^{k}\\&=x^{r}+rx^{r-1}y+{\frac {r(r-1)}{2!}}x^{r-2}y^{2}+{\frac {r(r-1)(r-2)}{3!}}x^{r-3}y^{3}+\cdots .\end{aligned}}$$

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

For example, r = 1/2 gives the following series for the square root:

$${\sqrt {1+x}}=1+{\frac {1}{2}}x-{\frac {1}{8}}x^{2}+{\frac {1}{16}}x^{3}-{\frac {5}{128}}x^{4}+{\frac {7}{256}}x^{5}-\cdots .$$

Taking r = −1, the generalized binomial series gives the geometric series formula, valid for |x| < 1:

$$(1+x)^{-1}={\frac {1}{1+x}}=1-x+x^{2}-x^{3}+x^{4}-x^{5}+\cdots .$$

More generally, with r = −s, we have for |x| < 1:

$${\frac {1}{(1+x)^{s}}}=\sum _{k=0}^{\infty }{-s \choose k}x^{k}=\sum _{k=0}^{\infty }{s+k-1 \choose k}(-1)^{k}x^{k}.$$

So, for instance, when s = 1/2,

$${\frac {1}{\sqrt {1+x}}}=1-{\frac {1}{2}}x+{\frac {3}{8}}x^{2}-{\frac {5}{16}}x^{3}+{\frac {35}{128}}x^{4}-{\frac {63}{256}}x^{5}+\cdots .$$

Replacing x with -x yields:

$${\frac {1}{(1-x)^{s}}}=\sum _{k=0}^{\infty }{s+k-1 \choose k}(-1)^{k}(-x)^{k}=\sum _{k=0}^{\infty }{s+k-1 \choose k}x^{k}.$$

So, for instance, when s = 1/2, we have for |x| < 1:

$${\frac {1}{\sqrt {1-x}}}=1+{\frac {1}{2}}x+{\frac {3}{8}}x^{2}+{\frac {5}{16}}x^{3}+{\frac {35}{128}}x^{4}+{\frac {63}{256}}x^{5}+\cdots .$$

 Further generalizations

The generalized binomial theorem can be extended to the case where x and y are complex numbers. For this version, one should again assume |x| > |y| and define the powers of x + y and x using a holomorphic branch of log defined on an open disk of radius |x| centered at x. The generalized binomial theorem is valid also for elements x and y of a Banach algebra as long as xy = yx, and x is invertible, and قالب:Norm < 1.

A version of the binomial theorem is valid for the following Pochhammer symbol-like family of polynomials: for a given real constant c, define $x^{(0)}=1$ and

$$x^{(n)}=\prod _{k=1}^{n}[x+(k-1)c]$$

for $n>0.$ Then

$$(a+b)^{(n)}=\sum _{k=0}^{n}{\binom {n}{k}}a^{(n-k)}b^{(k)}.$$

The case c = 0 recovers the usual binomial theorem.

More generally, a sequence $\{p_{n}\}_{n=0}^{\infty }$ of polynomials is said to be of binomial type if

• $\deg p_{n}=n$ for all $n$,
• $p_{0}(0)=1$, and
• $p_{n}(x+y)=\sum _{k=0}^{n}{\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}\}_{n=0}^{\infty }$ if $Qp_{0}=0$ and $Qp_{n}=np_{n-1}$ for all $n\geqslant 1$. A sequence $\{p_{n}\}_{n=0}^{\infty }$ is binomial if and only if its basis operator is a Delta operator. 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

المقالة الرئيسية: 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}+\cdots +x_{m})^{n}=\sum _{k_{1}+k_{2}+\cdots +k_{m}=n}{\binom {n}{k_{1},k_{2},\ldots ,k_{m}}}x_{1}^{k_{1}}x_{2}^{k_{2}}\cdots x_{m}^{k_{m}},$$

where the summation is taken over all sequences of nonnegative integer indices k₁ through k_m such that the sum of all k_i is n. (For each term in the expansion, the exponents must add up to n). The coefficients ${\tbinom {n}{k_{1},\cdots ,k_{m}}}$ are known as multinomial coefficients, and can be computed by the formula

$${\binom {n}{k_{1},k_{2},\ldots ,k_{m}}}={\frac {n!}{k_{1}!\cdot k_{2}!\cdots k_{m}!}}.$$

Combinatorially, the multinomial coefficient ${\tbinom {n}{k_{1},\cdots ,k_{m}}}$ counts the number of different ways to partition an n-element set into disjoint subsets of sizes k₁, ..., k_m.

  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})^{n_{1}}\dotsm (x_{d}+y_{d})^{n_{d}}=\sum _{k_{1}=0}^{n_{1}}\dotsm \sum _{k_{d}=0}^{n_{d}}{\binom {n_{1}}{k_{1}}}x_{1}^{k_{1}}y_{1}^{n_{1}-k_{1}}\dotsc {\binom {n_{d}}{k_{d}}}x_{d}^{k_{d}}y_{d}^{n_{d}-k_{d}}.$$

This may be written more concisely, by multi-index notation, as

$$(x+y)^{\alpha }=\sum _{\nu \leq \alpha }{\binom {\alpha }{\nu }}x^{\nu }y^{\alpha -\nu }.$$

 General Leibniz rule

المقالة الرئيسية: General Leibniz rule

The general Leibniz rule gives the nth derivative of a product of two functions in a form similar to that of the binomial theorem:

$$(fg)^{(n)}(x)=\sum _{k=0}^{n}{\binom {n}{k}}f^{(n-k)}(x)g^{(k)}(x).$$

Here, the superscript (n) indicates the nth derivative of a function. If one sets f(x) = e^ax and g(x) = e^bx, and then cancels the common factor of e^{(a + b)x} from both sides of the result, the ordinary binomial theorem is recovered.

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

 التطبيقات

 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,

$\cos \left(nx\right)+i\sin \left(nx\right)=\left(\cos x+i\sin x\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 cos(nx) and sin(nx). For example, since

$\left(\cos x+i\sin x\right)^{2}=\cos ^{2}x+2i\cos x\sin x-\sin ^{2}x,$

De Moivre's formula tells us that

$\cos(2x)=\cos ^{2}x-\sin ^{2}x\quad {\text{and}}\quad \sin(2x)=2\cos x\sin x,$

which are the usual double-angle identities. Similarly, since

$\left(\cos x+i\sin x\right)^{3}=\cos ^{3}x+3i\cos ^{2}x\sin x-3\cos x\sin ^{2}x-i\sin ^{3}x,$

De Moivre's formula yields

$\cos(3x)=\cos ^{3}x-3\cos x\sin ^{2}x\quad {\text{and}}\quad \sin(3x)=3\cos ^{2}x\sin x-\sin ^{3}x.$

In general,

$\cos(nx)=\sum _{k{\text{ even}}}(-1)^{k/2}{n \choose k}\cos ^{n-k}x\sin ^{k}x$

and

$\sin(nx)=\sum _{k{\text{ odd}}}(-1)^{(k-1)/2}{n \choose k}\cos ^{n-k}x\sin ^{k}x.$

 Series for e

The number e is often defined by the formula

$e=\lim _{n\to \infty }\left(1+{\frac {1}{n}}\right)^{n}.$

Applying the binomial theorem to this expression yields the usual infinite series for e. In particular:

$\left(1+{\frac {1}{n}}\right)^{n}=1+{n \choose 1}{\frac {1}{n}}+{n \choose 2}{\frac {1}{n^{2}}}+{n \choose 3}{\frac {1}{n^{3}}}+\cdots +{n \choose n}{\frac {1}{n^{n}}}.$

The kth term of this sum is

${n \choose k}{\frac {1}{n^{k}}}={\frac {1}{k!}}\cdot {\frac {n(n-1)(n-2)\cdots (n-k+1)}{n^{k}}}$

As n → ∞, the rational expression on the right approaches one, and therefore

$\lim _{n\to \infty }{n \choose k}{\frac {1}{n^{k}}}={\frac {1}{k!}}.$

This indicates that e can be written as a series:

$e=\sum _{k=0}^{\infty }{\frac {1}{k!}}={\frac {1}{0!}}+{\frac {1}{1!}}+{\frac {1}{2!}}+{\frac {1}{3!}}+\cdots .$

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

 الاحتمالات

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 S}$ with probability of success $p\in [0,1]$ all not happening is

$$P\left(\bigcap _{t\in S}X_{t}^{C}\right)=(1-p)^{|S|}=\sum _{n=0}^{|S|}{|S| \choose n}(-p)^{n}$$

A useful upper bound for this quantity is $e^{-pn}$.

 مبرهنة ذات الحدين في الجبر المجرد

Formula (1) is valid more generally for any elements x and y of a semiring satisfying xy = yx. The theorem is true even more generally: alternativity suffices in place of associativity.

The binomial theorem can be stated by saying that the polynomial sequence { 1, x, x², x³, ... } is of binomial type.

 في الثقافة الشعبية

• 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."
• 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.

 انظر أيضاً

• Binomial approximation
• Binomial distribution
• Binomial inverse theorem
• Stirling's approximation

 للاستزادة

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

 وصلات خارجية

• قالب:SpringerEOM
• Binomial Theorem by Stephen Wolfram, and "Binomial Theorem (Step-by-Step)" by Bruce Colletti and Jeff Bryant, Wolfram Demonstrations Project, 2007.