In mathematics, the binomial series is a generalization of the polynomial that comes from a binomial formula expression like for a nonnegative integer . Specifically, the binomial series is the MacLaurin series for the function , where and . Explicitly,
| (1) |
where the power series on the right-hand side of ( 1 ) is expressed in terms of the (generalized) binomial coefficients
Note that if α is a nonnegative integer n then the xn + 1 term and all later terms in the series are 0, since each contains a factor of (n − n). Thus, in this case, the series is finite and gives the algebraic binomial formula.
Whether ( 1 ) converges depends on the values of the complex numbers α and x. More precisely:
In particular, if α is not a non-negative integer, the situation at the boundary of the disk of convergence, |x| = 1, is summarized as follows:
The following hold for any complex number α:
| (2) |
| (3) |
Unless is a nonnegative integer (in which case the binomial coefficients vanish as is larger than ), a useful asymptotic relationship for the binomial coefficients is, in Landau notation:
| (4) |
This is essentially equivalent to Euler's definition of the Gamma function:
and implies immediately the coarser bounds
| (5) |
for some positive constants m and M .
Formula ( 2 ) for the generalized binomial coefficient can be rewritten as
| (6) |
To prove (i) and (v), apply the ratio test and use formula ( 2 ) above to show that whenever is not a nonnegative integer, the radius of convergence is exactly 1. Part (ii) follows from formula ( 5 ), by comparison with the p-series
with . To prove (iii), first use formula ( 3 ) to obtain
| (7) |
and then use (ii) and formula ( 5 ) again to prove convergence of the right-hand side when is assumed. On the other hand, the series does not converge if and , again by formula ( 5 ). Alternatively, we may observe that for all , . Thus, by formula ( 6 ), for all . This completes the proof of (iii). Turning to (iv), we use identity ( 7 ) above with and in place of , along with formula ( 4 ), to obtain
as . Assertion (iv) now follows from the asymptotic behavior of the sequence . (Precisely, certainly converges to if and diverges to if . If , then converges if and only if the sequence converges , which is certainly true if but false if : in the latter case the sequence is dense , due to the fact that diverges and converges to zero).
The usual argument to compute the sum of the binomial series goes as follows. Differentiating term-wise the binomial series within the disk of convergence |x| < 1 and using formula ( 1 ), one has that the sum of the series is an analytic function solving the ordinary differential equation (1 + x)u′(x) − αu(x) = 0 with initial condition u(0) = 1.
The unique solution of this problem is the function u(x) = (1 + x)α. Indeed, multiplying by the integrating factor (1 + x)−α−1 gives
so the function (1 + x)−αu(x) is a constant, which the initial condition tells us is 1. That is, u(x) = (1 + x)α is the sum of the binomial series for |x| < 1.
The equality extends to |x| = 1 whenever the series converges, as a consequence of Abel's theorem and by continuity of (1 + x)α.
Closely related is the negative binomial series defined by the MacLaurin series for the function , where and . Explicitly,
which is written in terms of the multiset coefficient
When α is a positive integer, several common sequences are apparent. The case α = 1 gives the series 1 + x + x2 + x3 + ..., where the coefficient of each term of the series is simply 1. The case α = 2 gives the series 1 + 2x + 3x2 + 4x3 + ..., which has the counting numbers as coefficients. The case α = 3 gives the series 1 + 3x + 6x2 + 10x3 + ..., which has the triangle numbers as coefficients. The case α = 4 gives the series 1 + 4x + 10x2 + 20x3 + ..., which has the tetrahedral numbers as coefficients, and similarly for higher integer values of α.
The negative binomial series includes the case of the geometric series, the power series [1]
(which is the negative binomial series when , convergent in the disc ) and, more generally, series obtained by differentiation of the geometric power series:
with , a positive integer. [2]
The first results concerning binomial series for other than positive-integer exponents were given by Sir Isaac Newton in the study of areas enclosed under certain curves. John Wallis built upon this work by considering expressions of the form y = (1 − x2)m where m is a fraction. He found that (written in modern terms) the successive coefficients ck of (−x2)k are to be found by multiplying the preceding coefficient by m− (k− 1)/k (as in the case of integer exponents), thereby implicitly giving a formula for these coefficients. He explicitly writes the following instances [lower-alpha 1]
The binomial series is therefore sometimes referred to as Newton's binomial theorem. Newton gives no proof and is not explicit about the nature of the series. Later, on 1826 Niels Henrik Abel discussed the subject in a paper published on Crelle's Journal , treating notably questions of convergence. [4]
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers n ≥ k ≥ 0 and is written It is the coefficient of the xk term in the polynomial expansion of the binomial power (1 + x)n; this coefficient can be computed by the multiplicative formula
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 (x + y)n into a sum involving terms of the form axbyc, 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,
Bessel functions, first defined by the mathematician Daniel Bernoulli and then generalized by Friedrich Bessel, are canonical solutions y(x) of Bessel's differential equation
In probability theory, the central limit theorem (CLT) states that, under appropriate conditions, the distribution of a normalized version of the sample mean converges to a standard normal distribution. This holds even if the original variables themselves are not normally distributed. There are several versions of the CLT, each applying in the context of different conditions.
In mathematics, a power series is an infinite series of the form
In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series.
In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Unlike an ordinary series, the formal power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers.
In mathematics, the n-th harmonic number is the sum of the reciprocals of the first n natural numbers:
In mathematics, the beta function, also called the Euler integral of the first kind, is a special function that is closely related to the gamma function and to binomial coefficients. It is defined by the integral
In mathematics, a multiset is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements. The number of instances given for each element is called the multiplicity of that element in the multiset. As a consequence, an infinite number of multisets exist which contain only elements a and b, but vary in the multiplicities of their elements:
The Basel problem is a problem in mathematical analysis with relevance to number theory, concerning an infinite sum of inverse squares. It was first posed by Pietro Mengoli in 1650 and solved by Leonhard Euler in 1734, and read on 5 December 1735 in The Saint Petersburg Academy of Sciences. Since the problem had withstood the attacks of the leading mathematicians of the day, Euler's solution brought him immediate fame when he was twenty-eight. Euler generalised the problem considerably, and his ideas were taken up more than a century later by Bernhard Riemann in his seminal 1859 paper "On the Number of Primes Less Than a Given Magnitude", in which he defined his zeta function and proved its basic properties. The problem is named after Basel, hometown of Euler as well as of the Bernoulli family who unsuccessfully attacked the problem.
In mathematical analysis, asymptotic analysis, also known as asymptotics, is a method of describing limiting behavior.
In mathematical analysis, Cesàro summation assigns values to some infinite sums that are not necessarily convergent in the usual sense. The Cesàro sum is defined as the limit, as n tends to infinity, of the sequence of arithmetic means of the first n partial sums of the series.
In combinatorics, the symbolic method is a technique for counting combinatorial objects. It uses the internal structure of the objects to derive formulas for their generating functions. The method is mostly associated with Philippe Flajolet and is detailed in Part A of his book with Robert Sedgewick, Analytic Combinatorics, while the rest of the book explains how to use complex analysis in order to get asymptotic and probabilistic results on the corresponding generating functions.
In mathematics, the Lerch zeta function, sometimes called the Hurwitz–Lerch zeta function, is a special function that generalizes the Hurwitz zeta function and the polylogarithm. It is named after Czech mathematician Mathias Lerch, who published a paper about the function in 1887.
In mathematics, especially in combinatorics, Stirling numbers of the first kind arise in the study of permutations. In particular, the Stirling numbers of the first kind count permutations according to their number of cycles.
In mathematics, the Nørlund–Rice integral, sometimes called Rice's method, relates the nth forward difference of a function to a line integral on the complex plane. It commonly appears in the theory of finite differences and has also been applied in computer science and graph theory to estimate binary tree lengths. It is named in honour of Niels Erik Nørlund and Stephen O. Rice. Nørlund's contribution was to define the integral; Rice's contribution was to demonstrate its utility by applying saddle-point techniques to its evaluation.
In mathematics, a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating function enumerating another. These transformations typically involve integral formulas applied to a sequence generating function or weighted sums over the higher-order derivatives of these functions.
In analytic number theory, a Dirichlet series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their summatory functions is to perform an integral transform that inverts the operation of forming the DGF of a sequence. This inversion is analogous to performing an inverse Z-transform to the generating function of a sequence to express formulas for the series coefficients of a given ordinary generating function.