text:
Series (mathematics)
From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about infinite sums. For finite sums, see Summation.
Part of a series of articles about
Calculus
Fundamental theorem
Limits of functions
Continuity
Mean value theorem
Rolle's theorem
Differential[show]
Definitions
Derivative (generalizations)
Differential
infinitesimal
of a function
total
Concepts
Differentiation notation
Second derivative
Third derivative
Change of variables
Implicit differentiation
Related rates
Taylor's theorem
Rules and identities
Sum
Product
Chain
Power
Quotient
Inverse
General Leibniz
Faà di Bruno's formula
Integral[show]
Lists of integrals
Definitions
Antiderivative
Integral (improper)
Riemann integral
Lebesgue integration
Contour integration
Integration by
Parts
Discs
Cylindrical shells
Substitution (trigonometric)
Partial fractions
Order
Reduction formulae
Series[show]
Geometric (arithmetico-geometric)
Harmonic
Alternating
Power
Binomial
Taylor
Convergence tests
Summand limit (term test)
Ratio
Root
Integral
Direct comparison

Limit comparison
Alternating series
Cauchy condensation
Dirichlet
Abel
Vector[show]
Gradient
Divergence
Curl
Laplacian
Directional derivative
Identities
Theorems
Divergence
Gradient
Green's
Kelvin–Stokes
Stokes
Multivariable[show]
Formalisms
Matrix
Tensor
Exterior
Geometric
Definitions
Partial derivative
Multiple integral
Line integral
Surface integral
Volume integral
Jacobian
Hessian
Specialized[show]
Fractional
Malliavin
Stochastic
Variations
Glossary of calculus[show]
Glossary of calculus
v
t
e
In mathematics, a series is, roughly speaking, a description of the operation of adding infinitely many quantities, one after the other, to a given starting quantity.[1] The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures (such as in combinatorics), through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance.
For a long time, the idea that such a potentially infinite summation could produce a finite result was considered paradoxical by mathematicians and philosophers. This paradox was resolved using the concept of a limit during the 19th century. Zeno's paradox of Achilles and the tortoise illustrates this counterintuitive property of infinite sums: Achilles runs after a tortoise, but when he reaches the position of the tortoise at the beginning of the race, the tortoise has reached a second position; when he reaches this second position, the tortoise is at a third position, and so on. Zeno concluded that Achilles could never reach the tortoise, and thus that movement does not exist. Zeno divided the race into infinitely many sub-races, each requiring a finite amount of time, so that the total time for Achilles to catch the tortoise is given by a series. The resolution of the paradox is that, although the series has an infinite number of terms, it has a finite sum, which gives the time necessary for Achilles to catch the tortoise.
In modern terminology, any (ordered) infinite sequence ( a 1 , a 2 , a 3 , … ) {\displaystyle (a_{1},a_{2},a_{3},\ldots )} of terms (that is numbers, functions, or anything that can be added) defines a series, which is the operation of adding the a i {\displaystyle a_{i}} one after the other. To emphasize that there are an infinite number of terms, a series may be called an infinite series. Such a series is represented (or denoted) by an expression like
a 1 + a 2 + a 3 + ⋯ , {\displaystyle a_{1}+a_{2}+a_{3}+\cdots ,}
or, using the summation sign,
∑ i = 1 ∞ a i . {\displaystyle \sum _{i=1}^{\infty }a_{i}.}
The infinite sequence of additions implied by a series cannot be effectively carried on (at least in a finite amount of time). However, if the set to which the terms and their finite sums belong has a notion of limit, it is sometimes possible to assign a value to a series, called the sum of the series. This value is the limit as n tends to infinity (if the limit exists) of the finite sums of the n first terms of the series, which are called the nth partial sums of the series. That is,
∑ i = 1 ∞ a i = lim n → ∞ ∑ i = 1 n a i . {\displaystyle \sum _{i=1}^{\infty }a_{i}=\lim _{n\to \infty }\sum _{i=1}^{n}a_{i}.}
When this limit exists, one says that the series is convergent or summable, or that the sequence ( a 1 , a 2 , a 3 , … ) {\displaystyle (a_{1},a_{2},a_{3},\ldots )} is summable. In this case, the limit is called the sum of the series. Otherwise, the series is said to be divergent.
Generally, the terms of a series come from a ring, often the field R {\displaystyle {\mathbb {R}}} of the real numbers or the field C {\displaystyle {\mathbb {C}}} of the complex numbers. In this case, the set of all series is itself a ring (and even an associative algebra), in which the addition consists of adding the series term by term, and the multiplication is the Cauchy product.
Contents
[hide]
1 Basic properties
1.1 Convergent series
2 Examples of numerical series
2.1 π
2.2 Natural logarithm of 2
2.3 Natural logarithm base e
3 Calculus and partial summation as an operation on sequences
4 Properties of series
4.1 Non-negative terms
4.2 Absolute convergence
4.3 Conditional convergence
5 Convergence tests
6 Series of functions
6.1 Power series
6.2 Formal power series
6.3 Laurent series
6.4 Dirichlet series
6.5 Trigonometric series
7 History of the theory of infinite series
7.1 Development of infinite series
7.2 Convergence criteria
7.3 Uniform convergence
7.4 Semi-convergence
7.5 Fourier series
8 Generalizations
8.1 Asymptotic series
8.2 Divergent series
8.3 Series in Banach spaces
8.4 Summations over arbitrary index sets
8.4.1 Families of non-negative numbers
8.4.2 Abelian topological groups
8.4.3 Unconditionally convergent series
8.4.4 Well-ordered sums
8.4.5 Examples
9 See also
10 Notes
11 References
12 External links
Basic properties[edit]
An infinite series or simply a series is an infinite sum, represented by an infinite expression of the form[2]
a 0 + a 1 + a 2 + ⋯ , {\displaystyle a_{0}+a_{1}+a_{2}+\cdots ,}
where ( a n ) {\displaystyle (a_{n})} is any ordered sequence of terms, such as numbers, functions, or anything else that can be added (an abelian group). This is an expression that is obtained from the list of terms a 0 , a 1 , … {\displaystyle a_{0},a_{1},\dots } by laying them side by side, and conjoining them with the symbol "+". A series may also be represented by using summation notation, such as
∑ n = 0 ∞ a n {\displaystyle \sum _{n=0}^{\infty }a_{n}} .
If an abelian group A of terms has a concept of limit (for example, if it is a metric space), then some series, the convergent series, can be interpreted as having a value in A, called the sum of the series. This includes the common cases from calculus in which the group is the field of real numbers or the field of complex numbers. Given a series s = ∑ n = 0 ∞ a n , {\displaystyle s=\sum _{n=0}^{\infty }a_{n},} its kth partial sum is
s k = ∑ n = 0 k a n = a 0 + a 1 + ⋯ + a k . {\displaystyle s_{k}=\sum _{n=0}^{k}a_{n}=a_{0}+a_{1}+\cdots +a_{k}.}
By definition, the series ∑ n = 0 ∞ a n {\displaystyle \sum _{n=0}^{\infty }a_{n}} converges to the limit L (or simply sums to L), if the sequence of its partial sums has a limit L.[2] In this case, one usually writes
L = ∑ n = 0 ∞ a n . {\displaystyle L=\sum _{n=0}^{\infty }a_{n}.}
A series is said to be convergent if it converges to some limit or divergent when it does not. The value of this limit, if it exists, is then the value of the series.
Convergent series[edit]
Illustration of 3 geometric series with partial sums from 1 to 6 terms. The dashed line represents the limit.
A series ∑an is said to converge or to be convergent when the sequence (sk) of partial sums has a finite limit. If the limit of sk is infinite or does not exist, the series is said to diverge.[3] When the limit of partial sums exists, it is called the value (or sum) of the series
∑ n = 0 ∞ a n = lim k → ∞ s k = lim k → ∞ ∑ n = 0 k a n . {\displaystyle \sum _{n=0}^{\infty }a_{n}=\lim _{k\to \infty }s_{k}=\lim _{k\to \infty }\sum _{n=0}^{k}a_{n}.}
An easy way that an infinite series can converge is if all the an are zero for n sufficiently large. Such a series can be identified with a finite sum, so it is only infinite in a trivial sense.
Working out the properties of the series that converge even if infinitely many terms are non-zero is the essence of the study of series. Consider the example
1 + 1 2 + 1 4 + 1 8 + ⋯ + 1 2 n + ⋯ . {\displaystyle 1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\cdots +{\frac {1}{2^{n}}}+\cdots .}
It is possible to "visualize" its convergence on the real number line: we can imagine a line of length 2, with successive segments marked off of lengths 1, ½, ¼, etc. There is always room to mark the next segment, because the amount of line remaining is always the same as the last segment marked: when we have marked off ½, we still have a piece of length ½ unmarked, so we can certainly mark the next ¼. This argument does not prove that the sum is equal to 2 (although it is), but it does prove that it is at most 2. In other words, the series has an upper bound. Given that the series converges, proving that it is equal to 2 requires only elementary algebra. If the series is denoted S, it can be seen that
S / 2 = 1 + 1 2 + 1 4 + 1 8 + ⋯ 2 = 1 2 + 1 4 + 1 8 + 1 16 + ⋯ . {\displaystyle S/2={\frac {1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+\cdots }{2}}={\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+{\frac {1}{16}}+\cdots .}
Therefore,
S − S / 2 = 1 ⇒ S = 2. {\displaystyle S-S/2=1\Rightarrow S=2.}
Mathematicians extend the idiom discussed earlier to other, equivalent notions of series. For instance, when we talk about a recurring decimal, as in
x = 0.111 … {\displaystyle x=0.111\dots }
we are talking, in fact, just about the series
∑ n = 1 ∞ 1 10 n . {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{10^{n}}}.}
But since these series always converge to real numbers (because of what is called the completeness property of the real numbers), to talk about the series in this way is the same as to talk about the numbers for which they stand. In particular, the decimal expansion 0.111… can be identified with 1/9. This leads to an argument that 9 × 0.111… = 0.999… = 1, which only relies on the fact that the limit laws for series preserve the arithmetic operations; this argument is presented in the article 0.999....
Examples of numerical series[edit]
For other examples, see List of mathematical series and Sums of reciprocals § Infinitely many terms.
A geometric series is one where each successive term is produced by multiplying the previous term by a constant number (called the common ratio in this context). Example:
1 + 1 2 + 1 4 + 1 8 + 1 16 + ⋯ = ∑ n = 0 ∞ 1 2 n . {\displaystyle 1+{1 \over 2}+{1 \over 4}+{1 \over 8}+{1 \over 16}+\cdots =\sum _{n=0}^{\infty }{1 \over 2^{n}}.}
In general, the geometric series
∑ n = 0 ∞ z n {\displaystyle \sum _{n=0}^{\infty }z^{n}}
converges if and only if | z | < 1 {\textstyle |z|<1} .
An arithmetico-geometric series is a generalization of the geometric series, which has coefficients of the common ratio equal to the terms in an arithmetic sequence. Example:
3 + 5 2 + 7 4 + 9 8 + 11 16 + ⋯ = ∑ n = 0 ∞ ( 3 + 2 n ) 2 n . {\displaystyle 3+{5 \over 2}+{7 \over 4}+{9 \over 8}+{11 \over 16}+\cdots =\sum _{n=0}^{\infty }{(3+2n) \over 2^{n}}.}
The harmonic series is the series
1 + 1 2 + 1 3 + 1 4 + 1 5 + ⋯ = ∑ n = 1 ∞ 1 n . {\displaystyle 1+{1 \over 2}+{1 \over 3}+{1 \over 4}+{1 \over 5}+\cdots =\sum _{n=1}^{\infty }{1 \over n}.}
The harmonic series is divergent.
An alternating series is a series where terms alternate signs. Examples:
1 − 1 2 + 1 3 − 1 4 + 1 5 − ⋯ = ∑ n = 1 ∞ ( − 1 ) n − 1 n = ln  ( 2 ) {\displaystyle 1-{1 \over 2}+{1 \over 3}-{1 \over 4}+{1 \over 5}-\cdots =\sum _{n=1}^{\infty }{\left(-1\right)^{n-1} \over n}=\ln(2)\quad } (alternating harmonic series)
and
− 1 + 1 3 − 1 5 + 1 7 − 1 9 + ⋯ = ∑ n = 1 ∞ ( − 1 ) n 2 n − 1 = − π 4 {\displaystyle -1+{\frac {1}{3}}-{\frac {1}{5}}+{\frac {1}{7}}-{\frac {1}{9}}+\cdots =\sum _{n=1}^{\infty }{\frac {\left(-1\right)^{n}}{2n-1}}=-{\frac {\pi }{4}}}
The p-series
∑ n = 1 ∞ 1 n r {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{r}}}}
converges if r > 1 and diverges for r ≤ 1, which can be shown with the integral criterion described below in convergence tests. As a function of r, the sum of this series is Riemann's zeta function.
A telescoping series
∑ n = 1 ∞ ( b n − b n + 1 ) {\displaystyle \sum _{n=1}^{\infty }(b_{n}-b_{n+1})}
converges if the sequence bn converges to a limit L as n goes to infinity. The value of the series is then b1 − L.
There are some elementary series whose convergence is not yet known/proven. For example, it is unknown whether the Flint Hills series
∑ n = 1 ∞ csc 2  n n 3 {\displaystyle \sum _{n=1}^{\infty }{\frac {\csc ^{2}n}{n^{3}}}}
converges or not. The convergence depends on how well π {\displaystyle \pi } can be approximated with rational numbers (which is unknown as of yet). More specifically, the values of n with large numerical contributions to the sum are the numerators of the continued fraction convergents of π {\displaystyle \pi } , a sequence beginning with 1, 3, 22, 333, 355, 103993, ... (sequence A046947 in the OEIS). These are integers that are close to n π {\displaystyle n\pi } for some integer n, so that sin  n π {\displaystyle \sin n\pi } is close to 0 and its reciprocal is large. Alekseyev (2011) proved that if the series converges, then the irrationality measure of π {\displaystyle \pi } is smaller than 2.5, which is much smaller than the current known bound of 7.6063....[4][5]
π[edit]
Main articles: Pi § Infinite series, Approximations of π, and Harmonic number § Identities involving π
∑ i = 1 ∞ 1 i 2 = 1 1 2 + 1 2 2 + 1 3 2 + 1 4 2 + ⋯ = π 2 6 {\displaystyle \sum _{i=1}^{\infty }{\frac {1}{i^{2}}}={\frac {1}{1^{2}}}+{\frac {1}{2^{2}}}+{\frac {1}{3^{2}}}+{\frac {1}{4^{2}}}+\cdots ={\frac {\pi ^{2}}{6}}}
∑ i = 1 ∞ ( − 1 ) i + 1 ( 4 ) 2 i − 1 = 4 1 − 4 3 + 4 5 − 4 7 + 4 9 − 4 11 + 4 13 − ⋯ = π {\displaystyle \sum _{i=1}^{\infty }{\frac {(-1)^{i+1}(4)}{2i-1}}={\frac {4}{1}}-{\frac {4}{3}}+{\frac {4}{5}}-{\frac {4}{7}}+{\frac {4}{9}}-{\frac {4}{11}}+{\frac {4}{13}}-\cdots =\pi }
Natural logarithm of 2[edit]
Main article: Natural logarithm of 2 § Series representations
∑ i = 1 ∞ ( − 1 ) i + 1 i = ln  2 {\displaystyle \sum _{i=1}^{\infty }{\frac {(-1)^{i+1}}{i}}=\ln 2}
∑ i = 0 ∞ 1 ( 2 i + 1 ) ( 2 i + 2 ) = ln  2 {\displaystyle \sum _{i=0}^{\infty }{\frac {1}{(2i+1)(2i+2)}}=\ln 2}
∑ i = 0 ∞ ( − 1 ) i ( i + 1 ) ( i + 2 ) = 2 ln  ( 2 ) − 1 {\displaystyle \sum _{i=0}^{\infty }{\frac {(-1)^{i}}{(i+1)(i+2)}}=2\ln(2)-1}
∑ i = 1 ∞ 1 i ( 4 i 2 − 1 ) = 2 ln  ( 2 ) − 1 {\displaystyle \sum _{i=1}^{\infty }{\frac {1}{i(4i^{2}-1)}}=2\ln(2)-1}
∑ i = 1 ∞ 1 2 i i = ln  2 {\displaystyle \sum _{i=1}^{\infty }{\frac {1}{2^{i}i}}=\ln 2}
∑ i = 1 ∞ ( 1 3 i + 1 4 i ) 1 i = ln  2 {\displaystyle \sum _{i=1}^{\infty }\left({\frac {1}{3^{i}}}+{\frac {1}{4^{i}}}\right){\frac {1}{i}}=\ln 2}
∑ i = 1 ∞ 1 2 i ( 2 i − 1 ) = ln  2 {\displaystyle \sum _{i=1}^{\infty }{\frac {1}{2i(2i-1)}}=\ln 2}
Natural logarithm base e[edit]
Main article: e (mathematical constant)
∑ i = 0 ∞ ( − 1 ) i i ! = 1 − 1 1 ! + 1 2 ! − 1 3 ! + ⋯ = 1 e {\displaystyle \sum _{i=0}^{\infty }{\frac {(-1)^{i}}{i!}}=1-{\frac {1}{1!}}+{\frac {1}{2!}}-{\frac {1}{3!}}+\cdots ={\frac {1}{e}}}
∑ i = 0 ∞ 1 i ! = 1 0 ! + 1 1 ! + 1 2 ! + 1 3 ! + 1 4 ! + ⋯ = e {\displaystyle \sum _{i=0}^{\infty }{\frac {1}{i!}}={\frac {1}{0!}}+{\frac {1}{1!}}+{\frac {1}{2!}}+{\frac {1}{3!}}+{\frac {1}{4!}}+\cdots =e}
Calculus and partial summation as an operation on sequences[edit]
Partial summation takes as input a sequence, { an }, and gives as output another sequence, { SN }. It is thus a unary operation on sequences. Further, this function is linear, and thus is a linear operator on the vector space of sequences, denoted Σ. The inverse operator is the finite difference operator, Δ. These behave as discrete analogs of integration and differentiation, only for series (functions of a natural number) instead of functions of a real variable. For example, the sequence {1, 1, 1, ...} has series {1, 2, 3, 4, ...} as its partial summation, which is analogous to the fact that ∫ 0 x 1 d t = x . {\displaystyle \int _{0}^{x}1\,dt=x.}
In computer science it is known as prefix sum.
Properties of series[edit]
Series are classified not only by whether they converge or diverge, but also by the properties of the terms an (absolute or conditional convergence); type of convergence of the series (pointwise, uniform); the class of the term an (whether it is a real number, arithmetic progression, trigonometric function); etc.
Non-negative terms[edit]
When an is a non-negative real number for every n, the sequence SN of partial sums is non-decreasing. It follows that a series ∑an with non-negative terms converges if and only if the sequence SN of partial sums is bounded.
For example, the series
∑ n = 1 ∞ 1 n 2 {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{2}}}}
is convergent, because the inequality
1 n 2 ≤ 1 n − 1 − 1 n , n ≥ 2 , {\displaystyle {\frac {1}{n^{2}}}\leq {\frac {1}{n-1}}-{\frac {1}{n}},\quad n\geq 2,}
and a telescopic sum argument implies that the partial sums are bounded by 2. The exact value of the original series is the Basel problem.
Absolute convergence[edit]
Main article: Absolute convergence
A series
∑ n = 0 ∞ a n {\displaystyle \sum _{n=0}^{\infty }a_{n}}
is said to converge absolutely if the series of absolute values
∑ n = 0 ∞ | a n | {\displaystyle \sum _{n=0}^{\infty }\left|a_{n}\right|}
converges. This is sufficient to guarantee not only that the original series converges to a limit, but also that any reordering of it converges to the same limit.
Conditional convergence[edit]
Main article: Conditional convergence
A series of real or complex numbers is said to be conditionally convergent (or semi-convergent) if it is convergent but not absolutely convergent. A famous example is the alternating series
∑ n = 1 ∞ ( − 1 ) n + 1 n = 1 − 1 2 + 1 3 − 1 4 + 1 5 − ⋯ {\displaystyle \sum \limits _{n=1}^{\infty }{(-1)^{n+1} \over n}=1-{1 \over 2}+{1 \over 3}-{1 \over 4}+{1 \over 5}-\cdots }
which is convergent (and its sum is equal to ln 2), but the series formed by taking the absolute value of each term is the divergent harmonic series. The Riemann series theorem says that any conditionally convergent series can be reordered to make a divergent series, and moreover, if the an are real and S is any real number, that one can find a reordering so that the reordered series converges with sum equal to S.
Abel's test is an important tool for handling semi-convergent series. If a series has the form
∑ a n = ∑ λ n b n {\displaystyle \sum a_{n}=\sum \lambda _{n}b_{n}}
where the partial sums BN = b0 + ··· + bn are bounded, λn has bounded variation, and lim λn Bn exists:
sup N | ∑ n = 0 N b n | < ∞ , ∑ | λ n + 1 − λ n | < ∞ and λ n B n converges, {\displaystyle \sup _{N}{\Bigl |}\sum _{n=0}^{N}b_{n}{\Bigr |}<\infty ,\ \ \sum |\lambda _{n+1}-\lambda _{n}|<\infty \ {\text{and}}\ \lambda _{n}B_{n}\ {\text{converges,}}}
then the series ∑ an is convergent. This applies to the pointwise convergence of many trigonometric series, as in
∑ n = 2 ∞ sin  ( n x ) ln  n {\displaystyle \sum _{n=2}^{\infty }{\frac {\sin(nx)}{\ln n}}}
with 0 < x < 2π. Abel's method consists in writing bn+1 = Bn+1 − Bn, and in performing a transformation similar to integration by parts (called summation by parts), that relates the given series ∑ an to the absolutely convergent series
∑ ( λ n − λ n + 1 ) B n . {\displaystyle \sum (\lambda _{n}-\lambda _{n+1})\,B_{n}.}
Convergence tests[edit]
Main article: Convergence tests
n-th term test: If limn→∞ an ≠ 0 then the series diverges.
Comparison test 1 (see Direct comparison test): If ∑bn is an absolutely convergent series such that |an | ≤ C |bn | for some number C and for sufficiently large n , then ∑an converges absolutely as well. If ∑|bn | diverges, and |an | ≥ |bn | for all sufficiently large n , then ∑an also fails to converge absolutely (though it could still be conditionally convergent, e.g. if the an alternate in sign).
Comparison test 2 (see Limit comparison test): If ∑bn is an absolutely convergent series such that |an+1 /an | ≤ |bn+1 /bn | for sufficiently large n , then ∑an converges absolutely as well. If ∑|bn | diverges, and |an+1 /an | ≥ |bn+1 /bn | for all sufficiently large n , then ∑an also fails to converge absolutely (though it could still be conditionally convergent, e.g. if the an alternate in sign).
Ratio test: If there exists a constant C < 1 such that |an+1/an|<C for all sufficiently large n, then ∑an converges absolutely. When the ratio is less than 1, but not less than a constant less than 1, convergence is possible but this test does not establish it.
Root test: If there exists a constant C < 1 such that |an|1/n ≤ C for all sufficiently large n, then ∑an converges absolutely.
Integral test: if ƒ(x) is a positive monotone decreasing function defined on the interval [1, ∞) with ƒ(n) = an for all n, then ∑an converges if and only if the integral ∫1∞ ƒ(x) dx is finite.
Cauchy's condensation test: If an is non-negative and non-increasing, then the two series ∑an and ∑2ka(2k) are of the same nature: both convergent, or both divergent.
Alternating series test: A series of the form ∑(−1)n an (with an > 0) is called alternating. Such a series converges if the sequence an is monotone decreasing and converges to 0. The converse is in general not true.
For some specific types of series there are more specialized convergence tests, for instance for Fourier series there is the Dini test.
Series of functions[edit]
Main article: Function series
A series of real- or complex-valued functions
∑ n = 0 ∞ f n ( x ) {\displaystyle \sum _{n=0}^{\infty }f_{n}(x)}
converges pointwise on a set E, if the series converges for each x in E as an ordinary series of real or complex numbers. Equivalently, the partial sums
s N ( x ) = ∑ n = 0 N f n ( x ) {\displaystyle s_{N}(x)=\sum _{n=0}^{N}f_{n}(x)}
converge to ƒ(x) as N → ∞ for each x ∈ E.
A stronger notion of convergence of a series of functions is called uniform convergence. The series converges uniformly if it converges pointwise to the function ƒ(x), and the error in approximating the limit by the Nth partial sum,
| s N ( x ) − f ( x ) | {\displaystyle |s_{N}(x)-f(x)|}
can be made minimal independently of x by choosing a sufficiently large N.
Uniform convergence is desirable for a series because many properties of the terms of the series are then retained by the limit. For example, if a series of continuous functions converges uniformly, then the limit function is also continuous. Similarly, if the ƒn are integrable on a closed and bounded interval I and converge uniformly, then the series is also integrable on I and can be integrated term-by-term. Tests for uniform convergence include the Weierstrass' M-test, Abel's uniform convergence test, Dini's test, and the Cauchy criterion.
More sophisticated types of convergence of a series of functions can also be defined. In measure theory, for instance, a series of functions converges almost everywhere if it converges pointwise except on a certain set of measure zero. Other modes of convergence depend on a different metric space structure on the space of functions under consideration. For instance, a series of functions converges in mean on a set E to a limit function ƒ provided
∫ E | s N ( x ) − f ( x ) | 2 d x → 0 {\displaystyle \int _{E}\left|s_{N}(x)-f(x)\right|^{2}\,dx\to 0}
as N → ∞.
Power series[edit]
Main article: Power series
A power series is a series of the form
∑ n = 0 ∞ a n ( x − c ) n . {\displaystyle \sum _{n=0}^{\infty }a_{n}(x-c)^{n}.}
The Taylor series at a point c of a function is a power series that, in many cases, converges to the function in a neighborhood of c. For example, the series
∑ n = 0 ∞ x n n ! {\displaystyle \sum _{n=0}^{\infty }{\frac {x^{n}}{n!}}}
is the Taylor series of e x {\displaystyle e^{x}} at the origin and converges to it for every x.
Unless it converges only at x=c, such a series converges on a certain open disc of convergence centered at the point c in the complex plane, and may also converge at some of the points of the boundary of the disc. The radius of this disc is known as the radius of convergence, and can in principle be determined from the asymptotics of the coefficients an. The convergence is uniform on closed and bounded (that is, compact) subsets of the interior of the disc of convergence: to wit, it is uniformly convergent on compact sets.
Historically, mathematicians such as Leonhard Euler operated liberally with infinite series, even if they were not convergent. When calculus was put on a sound and correct foundation in the nineteenth century, rigorous proofs of the convergence of series were always required.
Formal power series[edit]
Main article: Formal power series
While many uses of power series refer to their sums, it is also possible to treat power series as formal sums, meaning that no addition operations are actually performed, and the symbol "+" is an abstract symbol of conjunction which is not necessarily interpreted as corresponding to addition. In this setting, the sequence of coefficients itself is of interest, rather than the convergence of the series. Formal power series are used in combinatorics to describe and study sequences that are otherwise difficult to handle, for example using the method of generating functions. The Hilbert–Poincaré series is a formal power series used to study graded algebras.
Even if the limit of the power series is not considered, if the terms support appropriate structure then it is possible to define operations such as addition, multiplication, derivative, antiderivative for power series "formally", treating the symbol "+" as if it corresponded to addition. In the most common setting, the terms come from a commutative ring, so that the formal power series can be added term-by-term and multiplied via the Cauchy product. In this case the algebra of formal power series is the total algebra of the monoid of natural numbers over the underlying term ring.[6] If the underlying term ring is a differential algebra, then the algebra of formal power series is also a differential algebra, with differentiation performed term-by-term.
Laurent series[edit]
Main article: Laurent series
Laurent series generalize power series by admitting terms into the series with negative as well as positive exponents. A Laurent series is thus any series of the form
∑ n = − ∞ ∞ a n x n . {\displaystyle \sum _{n=-\infty }^{\infty }a_{n}x^{n}.}
If such a series converges, then in general it does so in an annulus rather than a disc, and possibly some boundary points. The series converges uniformly on compact subsets of the interior of the annulus of convergence.
Dirichlet series[edit]
Main article: Dirichlet series
A Dirichlet series is one of the form
∑ n = 1 ∞ a n n s , {\displaystyle \sum _{n=1}^{\infty }{a_{n} \over n^{s}},}
where s is a complex number. For example, if all an are equal to 1, then the Dirichlet series is the Riemann zeta function
ζ ( s ) = ∑ n = 1 ∞ 1 n s . {\displaystyle \zeta (s)=\sum _{n=1}^{\infty }{\frac {1}{n^{s}}}.}
Like the zeta function, Dirichlet series in general play an important role in analytic number theory. Generally a Dirichlet series converges if the real part of s is greater than a number called the abscissa of convergence. In many cases, a Dirichlet series can be extended to an analytic function outside the domain of convergence by analytic continuation. For example, the Dirichlet series for the zeta function converges absolutely when Re s > 1, but the zeta function can be extended to a holomorphic function defined on C ∖ { 1 } {\displaystyle \mathbf {C} \setminus \{1\}} with a simple pole at 1.
This series can be directly generalized to general Dirichlet series.
Trigonometric series[edit]
Main article: Trigonometric series
A series of functions in which the terms are trigonometric functions is called a trigonometric series:
1 2 A 0 + ∑ n = 1 ∞ ( A n cos  n x + B n sin  n x ) . {\displaystyle {\tfrac {1}{2}}A_{0}+\sum _{n=1}^{\infty }\left(A_{n}\cos nx+B_{n}\sin nx\right).}
The most important example of a trigonometric series is the Fourier series of a function.
History of the theory of infinite series[edit]
Development of infinite series[edit]
Greek mathematician Archimedes produced the first known summation of an infinite series with a method that is still used in the area of calculus today. He used the method of exhaustion to calculate the area under the arc of a parabola with the summation of an infinite series, and gave a remarkably accurate approximation of π.[7][8]
Mathematicians from Kerala, India studied infinite series around 1350 CE.[9]
In the 17th century, James Gregory worked in the new decimal system on infinite series and published several Maclaurin series. In 1715, a general method for constructing the Taylor series for all functions for which they exist was provided by Brook Taylor. Leonhard Euler in the 18th century, developed the theory of hypergeometric series and q-series.
Convergence criteria[edit]
The investigation of the validity of infinite series is considered to begin with Gauss in the 19th century. Euler had already considered the hypergeometric series
1 + α β 1 ⋅ γ x + α ( α + 1 ) β ( β + 1 ) 1 ⋅ 2 ⋅ γ ( γ + 1 ) x 2 + ⋯ {\displaystyle 1+{\frac {\alpha \beta }{1\cdot \gamma }}x+{\frac {\alpha (\alpha +1)\beta (\beta +1)}{1\cdot 2\cdot \gamma (\gamma +1)}}x^{2}+\cdots }
on which Gauss published a memoir in 1812. It established simpler criteria of convergence, and the questions of remainders and the range of convergence.
Cauchy (1821) insisted on strict tests of convergence; he showed that if two series are convergent their product is not necessarily so, and with him begins the discovery of effective criteria. The terms convergence and divergence had been introduced long before by Gregory (1668). Leonhard Euler and Gauss had given various criteria, and Colin Maclaurin had anticipated some of Cauchy's discoveries. Cauchy advanced the theory of power series by his expansion of a complex function in such a form.
Abel (1826) in his memoir on the binomial series
1 + m 1 ! x + m ( m − 1 ) 2 ! x 2 + ⋯ {\displaystyle 1+{\frac {m}{1!}}x+{\frac {m(m-1)}{2!}}x^{2}+\cdots }
corrected certain of Cauchy's conclusions, and gave a completely scientific summation of the series for complex values of m {\displaystyle m} and x {\displaystyle x} . He showed the necessity of considering the subject of continuity in questions of convergence.
Cauchy's methods led to special rather than general criteria, and the same may be said of Raabe (1832), who made the first elaborate investigation of the subject, of De Morgan (from 1842), whose logarithmic test DuBois-Reymond (1873) and Pringsheim (1889) have shown to fail within a certain region; of Bertrand (1842), Bonnet (1843), Malmsten (1846, 1847, the latter without integration); Stokes (1847), Paucker (1852), Chebyshev (1852), and Arndt (1853).
General criteria began with Kummer (1835), and have been studied by Eisenstein (1847), Weierstrass in his various contributions to the theory of functions, Dini (1867), DuBois-Reymond (1873), and many others. Pringsheim's memoirs (1889) present the most complete general theory.
Uniform convergence[edit]
The theory of uniform convergence was treated by Cauchy (1821), his limitations being pointed out by Abel, but the first to attack it successfully were Seidel and Stokes (1847–48). Cauchy took up the problem again (1853), acknowledging Abel's criticism, and reaching the same conclusions which Stokes had already found. Thomae used the doctrine (1866), but there was great delay in recognizing the importance of distinguishing between uniform and non-uniform convergence, in spite of the demands of the theory of functions.
Semi-convergence[edit]
A series is said to be semi-convergent (or conditionally convergent) if it is convergent but not absolutely convergent.
Semi-convergent series were studied by Poisson (1823), who also gave a general form for the remainder of the Maclaurin formula. The most important solution of the problem is due, however, to Jacobi (1834), who attacked the question of the remainder from a different standpoint and reached a different formula. This expression was also worked out, and another one given, by Malmsten (1847). Schlömilch (Zeitschrift, Vol.I, p. 192, 1856) also improved Jacobi's remainder, and showed the relation between the remainder and Bernoulli's function
F ( x ) = 1 n + 2 n + ⋯ + ( x − 1 ) n . {\displaystyle F(x)=1^{n}+2^{n}+\cdots +(x-1)^{n}.}
Genocchi (1852) has further contributed to the theory.
Among the early writers was Wronski, whose "loi suprême" (1815) was hardly recognized until Cayley (1873) brought it into prominence.
Fourier series[edit]
Fourier series were being investigated as the result of physical considerations at the same time that Gauss, Abel, and Cauchy were working out the theory of infinite series. Series for the expansion of sines and cosines, of multiple arcs in powers of the sine and cosine of the arc had been treated by Jacob Bernoulli (1702) and his brother Johann Bernoulli (1701) and still earlier by Vieta. Euler and Lagrange simplified the subject, as did Poinsot, Schröter, Glaisher, and Kummer.
Fourier (1807) set for himself a different problem, to expand a given function of x in terms of the sines or cosines of multiples of x, a problem which he embodied in his Théorie analytique de la chaleur (1822). Euler had already given the formulas for determining the coefficients in the series; Fourier was the first to assert and attempt to prove the general theorem. Poisson (1820–23) also attacked the problem from a different standpoint. Fourier did not, however, settle the question of convergence of his series, a matter left for Cauchy (1826) to attempt and for Dirichlet (1829) to handle in a thoroughly scientific manner (see convergence of Fourier series). Dirichlet's treatment (Crelle, 1829), of trigonometric series was the subject of criticism and improvement by Riemann (1854), Heine, Lipschitz, Schläfli, and du Bois-Reymond. Among other prominent contributors to the theory of trigonometric and Fourier series were Dini, Hermite, Halphen, Krause, Byerly and Appell.
Generalizations[edit]
Asymptotic series[edit]
Asymptotic series, otherwise asymptotic expansions, are infinite series whose partial sums become good approximations in the limit of some point of the domain. In general they do not converge. But they are useful as sequences of approximations, each of which provides a value close to the desired answer for a finite number of terms. The difference is that an asymptotic series cannot be made to produce an answer as exact as desired, the way that convergent series can. In fact, after a certain number of terms, a typical asymptotic series reaches its best approximation; if more terms are included, most such series will produce worse answers.
Divergent series[edit]
Main article: Divergent series
Under many circumstances, it is desirable to assign a limit to a series which fails to converge in the usual sense. A summability method is such an assignment of a limit to a subset of the set of divergent series which properly extends the classical notion of convergence. Summability methods include Cesàro summation, (C,k) summation, Abel summation, and Borel summation, in increasing order of generality (and hence applicable to increasingly divergent series).
A variety of general results concerning possible summability methods are known. The Silverman–Toeplitz theorem characterizes matrix summability methods, which are methods for summing a divergent series by applying an infinite matrix to the vector of coefficients. The most general method for summing a divergent series is non-constructive, and concerns Banach limits.
Series in Banach spaces[edit]
The notion of series can be easily extended to the case of a Banach space. If xn is a sequence of elements of a Banach space X, then the series Σxn converges to x ∈ X if the sequence of partial sums of the series tends to x; to wit,
‖ x − ∑ n = 0 N x n ‖ → 0 {\displaystyle {\biggl \|}x-\sum _{n=0}^{N}x_{n}{\biggr \|}\to 0}
as N → ∞.
More generally, convergence of series can be defined in any abelian Hausdorff topological group. Specifically, in this case, Σxn converges to x if the sequence of partial sums converges to x.
Summations over arbitrary index sets[edit]
Definitions may be given for sums over an arbitrary index set I.[10] There are two main differences with the usual notion of series: first, there is no specific order given on the set I; second, this set I may be uncountable. The notion of convergence needs to be strengthened, because the concept of conditional convergence depends on the ordering of the index set.
If a : I ↦ G {\displaystyle a:I\mapsto G} is a function from an index set I to a set G, then the "series" associated to a {\displaystyle a} is the formal sum of the elements a ( x ) ∈ G {\displaystyle a(x)\in G} over the index elements x ∈ I {\displaystyle x\in I} denoted by the
∑ x ∈ I a ( x ) . {\displaystyle \sum _{x\in I}a(x).}
When the index set is the natural numbers I = N {\displaystyle I=\mathbb {N} } , the function a : N ↦ G {\displaystyle a:\mathbb {N} \mapsto G} is a sequence denoted by a ( n ) = a n {\displaystyle a(n)=a_{n}} . A series indexed on the natural numbers is an ordered formal sum and so we rewrite ∑ n ∈ N {\displaystyle \sum _{n\in \mathbb {N} }} as ∑ n = 0 ∞ {\displaystyle \sum _{n=0}^{\infty }} in order to emphasize the ordering induced by the natural numbers. Thus, we obtain the common notation for a series indexed by the natural numbers
∑ n = 0 ∞ a n = a 0 + a 1 + a 2 + ⋯ . {\displaystyle \sum _{n=0}^{\infty }a_{n}=a_{0}+a_{1}+a_{2}+\cdots .}
Families of non-negative numbers[edit]
When summing a family {ai}, i ∈ I, of non-negative numbers, one may define
∑ i ∈ I a i = sup { ∑ i ∈ A a i | A finite, A ⊂ I } ∈ [ 0 , + ∞ ] . {\displaystyle \sum _{i\in I}a_{i}=\sup {\Bigl \{}\sum _{i\in A}a_{i}\,{\big |}A{\text{ finite, }}A\subset I{\Bigr \}}\in [0,+\infty ].}
When the supremum is finite, the set of i ∈ I such that ai > 0 is countable. Indeed, for every n ≥ 1, the set A n = { i ∈ I : a i > 1 / n } {\displaystyle A_{n}=\{i\in I\,:\,a_{i}>1/n\}} is finite, because
1 n card ( A n ) ≤ ∑ i ∈ A n a i ≤ ∑ i ∈ I a i < ∞ . {\displaystyle {\frac {1}{n}}\,{\textrm {card}}(A_{n})\leq \sum _{i\in A_{n}}a_{i}\leq \sum _{i\in I}a_{i}<\infty .}
If I is countably infinite and enumerated as I = {i0, i1,...} then the above defined sum satisfies
∑ i ∈ I a i = ∑ k = 0 + ∞ a i k , {\displaystyle \sum _{i\in I}a_{i}=\sum _{k=0}^{+\infty }a_{i_{k}},}
provided the value ∞ is allowed for the sum of the series.
Any sum over non-negative reals can be understood as the integral of a non-negative function with respect to the counting measure, which accounts for the many similarities between the two constructions.
Abelian topological groups[edit]
Let a : I → X, where I is any set and X is an abelian Hausdorff topological group. Let F be the collection of all finite subsets of I. Note that F is a directed set ordered under inclusion with union as join. Define the sum S of the family a as the limit
S = ∑ i ∈ I a i = lim { ∑ i ∈ A a i | A ∈ F } {\displaystyle S=\sum _{i\in I}a_{i}=\lim {\Bigl \{}\sum _{i\in A}a_{i}\,{\big |}A\in F{\Bigr \}}}
if it exists and say that the family a is unconditionally summable. Saying that the sum S is the limit of finite partial sums means that for every neighborhood V of 0 in X, there is a finite subset A0 of I such that
S − ∑ i ∈ A a i ∈ V , A ⊃ A 0 . {\displaystyle S-\sum _{i\in A}a_{i}\in V,\quad A\supset A_{0}.}
Because F is not totally ordered, this is not a limit of a sequence of partial sums, but rather of a net.[11][12]
For every W, neighborhood of 0 in X, there is a smaller neighborhood V such that V − V ⊂ W. It follows that the finite partial sums of an unconditionally summable family ai, i ∈ I, form a Cauchy net, that is: for every W, neighborhood of 0 in X, there is a finite subset A0 of I such that
∑ i ∈ A 1 a i − ∑ i ∈ A 2 a i ∈ W , A 1 , A 2 ⊃ A 0 . {\displaystyle \sum _{i\in A_{1}}a_{i}-\sum _{i\in A_{2}}a_{i}\in W,\quad A_{1},A_{2}\supset A_{0}.}
When X is complete, a family a is unconditionally summable in X if and only if the finite sums satisfy the latter Cauchy net condition. When X is complete and ai, i ∈ I, is unconditionally summable in X, then for every subset J ⊂ I, the corresponding subfamily aj, j ∈ J, is also unconditionally summable in X.
When the sum of a family of non-negative numbers, in the extended sense defined before, is finite, then it coincides with the sum in the topological group X = R.
If a family a in X is unconditionally summable, then for every W, neighborhood of 0 in X, there is a finite subset A0 of I such that ai ∈ W for every i not in A0. If X is first-countable, it follows that the set of i ∈ I such that ai ≠ 0 is countable. This need not be true in a general abelian topological group (see examples below).
Unconditionally convergent series[edit]
Suppose that I = N. If a family an, n ∈ N, is unconditionally summable in an abelian Hausdorff topological group X, then the series in the usual sense converges and has the same sum,
∑ n = 0 ∞ a n = ∑ n ∈ N a n . {\displaystyle \sum _{n=0}^{\infty }a_{n}=\sum _{n\in \mathbf {N} }a_{n}.}
By nature, the definition of unconditional summability is insensitive to the order of the summation. When ∑an is unconditionally summable, then the series remains convergent after any permutation σ of the set N of indices, with the same sum,
∑ n = 0 ∞ a σ ( n ) = ∑ n = 0 ∞ a n . {\displaystyle \sum _{n=0}^{\infty }a_{\sigma (n)}=\sum _{n=0}^{\infty }a_{n}.}
Conversely, if every permutation of a series ∑an converges, then the series is unconditionally convergent. When X is complete, then unconditional convergence is also equivalent to the fact that all subseries are convergent; if X is a Banach space, this is equivalent to say that for every sequence of signs εn = ±1, the series
∑ n = 0 ∞ ε n a n {\displaystyle \sum _{n=0}^{\infty }\varepsilon _{n}a_{n}}
converges in X. If X is a Banach space, then one may define the notion of absolute convergence. A series ∑an of vectors in X converges absolutely if
∑ n ∈ N ‖ a n ‖ < + ∞ . {\displaystyle \sum _{n\in \mathbf {N} }\|a_{n}\|<+\infty .}
If a series of vectors in a Banach space converges absolutely then it converges unconditionally, but the converse only holds in finite-dimensional Banach spaces (theorem of Dvoretzky & Rogers (1950)).
Well-ordered sums[edit]
Conditionally convergent series can be considered if I is a well-ordered set, for example an ordinal number α0. One may define by transfinite recursion:
∑ β < α + 1 a β = a α + ∑ β < α a β {\displaystyle \sum _{\beta <\alpha +1}a_{\beta }=a_{\alpha }+\sum _{\beta <\alpha }a_{\beta }}
and for a limit ordinal α,
∑ β < α a β = lim γ → α ∑ β < γ a β {\displaystyle \sum _{\beta <\alpha }a_{\beta }=\lim _{\gamma \to \alpha }\sum _{\beta <\gamma }a_{\beta }}
if this limit exists. If all limits exist up to α0, then the series converges.
Examples[edit]
Given a function f : X→Y, with Y an abelian topological group, define for every a ∈ X
f a ( x ) = { 0 x ≠ a , f ( a ) x = a , {\displaystyle f_{a}(x)={\begin{cases}0&x\neq a,\\f(a)&x=a,\\\end{cases}}}
a function whose support is a singleton {a}. Then
f = ∑ a ∈ X f a {\displaystyle f=\sum _{a\in X}f_{a}}
in the topology of pointwise convergence (that is, the sum is taken in the infinite product group YX ).
In the definition of partitions of unity, one constructs sums of functions over arbitrary index set I,
∑ i ∈ I φ i ( x ) = 1. {\displaystyle \sum _{i\in I}\varphi _{i}(x)=1.}
While, formally, this requires a notion of sums of uncountable series, by construction there are, for every given x, only finitely many nonzero terms in the sum, so issues regarding convergence of such sums do not arise. Actually, one usually assumes more: the family of functions is locally finite, i.e., for every x there is a neighborhood of x in which all but a finite number of functions vanish. Any regularity property of the φi, such as continuity, differentiability, that is preserved under finite sums will be preserved for the sum of any subcollection of this family of functions.
On the first uncountable ordinal ω1 viewed as a topological space in the order topology, the constant function f: [0,ω1) → [0,ω1] given by f(α) = 1 satisfies
∑ α ∈ [ 0 , ω 1 ) f ( α ) = ω 1 {\displaystyle \sum _{\alpha \in [0,\omega _{1})}f(\alpha )=\omega _{1}}
(in other words, ω1 copies of 1 is ω1) only if one takes a limit over all countable partial sums, rather than finite partial sums. This space is not separable.
See also[edit]
Continued fraction
Convergence tests
Convergent series
Divergent series
Infinite compositions of analytic functions
Infinite expression
Infinite product
Iterated binary operation
List of mathematical series
Prefix sum
Sequence transformation
Series expansion
Taylor series
Notes[edit]
Jump up ^ Thompson, Silvanus; Gardner, Martin (1998). Calculus Made Easy. ISBN 978-0312185480.
^ Jump up to: a b Swokowski 1983, p. 501
Jump up ^ Michael Spivak, Calculus
Jump up ^ Max A. Alekseyev, On convergence of the Flint Hills series, arXiv:1104.5100, 2011.
Jump up ^ Weisstein, Eric W. "Flint Hills Series". MathWorld.
Jump up ^ Nicolas Bourbaki (1989), Algebra, Springer : §III.2.11.
Jump up ^ O'Connor, J.J. & Robertson, E.F. (February 1996). "A history of calculus". University of St Andrews. Retrieved 2007-08-07.
Jump up ^ K., Bidwell, James (30 November 1993). "Archimedes and Pi-Revisited". School Science and Mathematics. 94 (3). More than one of |website= and |journal= specified (help)
Jump up ^ "Indians predated Newton 'discovery' by 250 years". manchester.ac.uk.
Jump up ^ Jean Dieudonné, Foundations of mathematical analysis, Academic Press
Jump up ^ Bourbaki, Nicolas (1998). General Topology: Chapters 1–4. Springer. pp. 261–270. ISBN 9783540642411.
Jump up ^ Choquet, Gustave (1966). Topology. Academic Press. pp. 216–231. ISBN 9780121734503.
References[edit]
Bromwich, T. J. An Introduction to the Theory of Infinite Series MacMillan & Co. 1908, revised 1926, reprinted 1939, 1942, 1949, 1955, 1959, 1965.
Dvoretzky, Aryeh; Rogers, C. Ambrose (1950). "Absolute and unconditional convergence in normed linear spaces". Proc. Natl. Acad. Sci. U.S.A. 36 (3): 192–197. doi:10.1073/pnas.36.3.192. PMC 1063182  .
Swokowski, Earl W. (1983), Calculus with analytic geometry (Alternate ed.), Boston: Prindle, Weber & Schmidt, ISBN 0-87150-341-7
MR0033975
External links[edit]
Wikimedia Commons has media related to Series (mathematics).
Hazewinkel, Michiel, ed. (2001) [1994], "Series", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
Infinite Series Tutorial
"Series-TheBasics". Paul's Online Math Notes.
[hide]
v
t
e
Sequences and series
Integer
sequences
Basic
Arithmetic progression
Geometric progression
Harmonic progression
Square number
Cubic number
Factorial
Powers of two
Powers of 10
Advanced (list)
Complete sequence
Fibonacci numbers
Figurate number
Heptagonal number
Hexagonal number
Lucas number
Pell number
Pentagonal number
Polygonal number
Triangular number
Properties of sequences
Cauchy sequence
Monotone sequence
Periodic sequence
Properties of series
Convergent series
Divergent series
Conditional convergence
Absolute convergence
Uniform convergence
Alternating series
Telescoping series
Explicit series
Convergent
1/2 − 1/4 + 1/8 − 1/16 + ⋯
1/2 + 1/4 + 1/8 + 1/16 + ⋯
1/4 + 1/16 + 1/64 + 1/256 + ⋯
1 + 1/2s+ 1/3s + ... (Riemann zeta function)
Divergent
1 + 1 + 1 + 1 + ⋯
1 + 2 + 3 + 4 + ⋯
1 + 2 + 4 + 8 + ⋯
1 − 1 + 1 − 1 + ⋯ (Grandi's series)
Infinite arithmetic series
1 − 2 + 3 − 4 + ⋯
1 − 2 + 4 − 8 + ⋯
1 + 1/2 + 1/3 + 1/4 + ⋯ (harmonic series)
1 − 1 + 2 − 6 + 24 − 120 + ⋯ (alternating factorials)
1/2 + 1/3 + 1/5 + 1/7 + 1/11 + ⋯ (inverses of primes)
Kinds of series
Taylor series
Power series
Formal power series
Laurent series
Puiseux series
Dirichlet series
Trigonometric series
Fourier series
Generating series
Hypergeometric
series
Generalized hypergeometric series
Hypergeometric function of a matrix argument
Lauricella hypergeometric series
Modular hypergeometric series
Riemann's differential equation
Theta hypergeometric series
Authority control
NDL: 00567344
Retrieved from "https://en.wikipedia.org/w/index.php?title=Series_(mathematics)&oldid=841452414"
Categories:
Calculus
Mathematical series
Hidden categories:
Pages with citations having redundant parameters
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
In other projects
Wikimedia Commons
Languages
العربية
Azərbaycanca
Bân-lâm-gú
Башҡортса
Беларуская
Беларуская (тарашкевіца)
Български
Bosanski
Català
Čeština
Dansk
Deutsch
Ελληνικά
Español
Esperanto
Euskara
فارسی
Français
Galego
贛語
客家語/Hak-kâ-ngî
한국어
हिन्दी
Hrvatski
Bahasa Indonesia
Íslenska
Italiano
עברית
ಕನ್ನಡ
ქართული
ລາວ
Latina
Latviešu
Lëtzebuergesch
Lietuvių
Magyar
Македонски
മലയാളം
Bahasa Melayu
Nederlands
नेपाली
日本語
Norsk
Oʻzbekcha/ўзбекча
Patois
Polski
Português
Română
Русский
Scots
Sicilianu
සිංහල
Simple English
Slovenčina
Slovenščina
کوردی
Српски / srpski
Srpskohrvatski / српскохрватски
Suomi
Svenska
தமிழ்
ไทย
Türkçe
Українська
اردو
Tiếng Việt
粵語
中文
59 more
Edit links
This page was last edited on 15 May 2018, at 23:02.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

key: html

type: local

value: div

attrs: id class

values: mw-page-base noprint

values: mw-head-base noprint

value: a

attrs: id class lang

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

attrs: href title

attrs: role class

values:
note
hatnote navigation-not-searchable

value: td

value: tr

value: th

value: li

value: ul

values: padding:0.3em 0.4em 0.3em;font-weight:bold;border-top: 1px solid #aaa; border-bottom: 1px solid #aaa;padding:0.15em 0.25em 0.3em;font-weight:normal;

values:
/wiki/Total_differential
mw-redirect
Total differential

values: float:right;clear:right;width:22.0em;margin:0 0 1.0em 1.0em;background:#f9f9f9;border:1px solid #aaa;padding:0.2em;border-spacing:0.4em 0;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse; border-spacing:0px; border:none; width:100%; margin:0px; font-size:100%; clear:none; float:none

values: font-size: 105%; padding: 0.15em 0px 0.4em; text-align: center; border-top-width: 1px; border-top-style: solid; border-top-color: rgb(170, 170, 170); border-bottom-width: 1px; border-bottom-style: solid; border-bottom-color: rgb(170, 170, 170); display: none;

values:
/wiki/Methods_of_contour_integration
mw-redirect
Methods of contour integration

values:
/wiki/Partial_fractions_in_integration
mw-redirect
Partial fractions in integration

values:
/wiki/Arithmetico-geometric_sequence
mw-redirect
Arithmetico-geometric sequence

values:
/wiki/Potential_infinity
mw-redirect
Potential infinity

values:
/wiki/Zeno%27s_paradox
mw-redirect
Zeno's paradox

values:
/wiki/Achilles_and_the_tortoise
mw-redirect
Achilles and the tortoise

values:
/wiki/Sequence_(mathematics)
mw-redirect
Sequence (mathematics)

values: vertical-align: -0.838ex; width:14.487ex; height:2.843ex;

values:
/wiki/Term_(mathematics)
mw-redirect
Term (mathematics)

values: vertical-align: -0.671ex; width:2.029ex; height:2.009ex;

values: vertical-align: -0.671ex; width:19.131ex; height:2.343ex;

values:
/wiki/Summation_sign
mw-redirect
Summation sign

values: {\displaystyle \sum _{i=1}^{\infty }a_{i}.}

values: vertical-align: -3.005ex; width:6.418ex; height:6.843ex;

values: vertical-align: -3.005ex; width:19.948ex; height:6.843ex;

values: vertical-align: -0.338ex; width:1.678ex; height:2.176ex;

values: vertical-align: -0.838ex; width:4.258ex; height:2.843ex;

values: vertical-align: -0.671ex; width:9.359ex; height:2.009ex;

values: {\displaystyle \sum _{n=0}^{\infty }a_{n}}

values: vertical-align: -3.005ex; width:6.19ex; height:6.843ex;

values: {\displaystyle s=\sum _{n=0}^{\infty }a_{n},}

values: vertical-align: -3.005ex; width:11.026ex; height:6.843ex;

values: vertical-align: -3.005ex; width:33.344ex; height:7.343ex;

values: {\displaystyle L=\sum _{n=0}^{\infty }a_{n}.}

values: vertical-align: -3.005ex; width:11.519ex; height:6.843ex;

attrs: alt src width height class srcset data-file-width data-file-height

values: vertical-align: -3.005ex; width:30.463ex; height:7.343ex;

values: vertical-align: -2.005ex; width:33.898ex; height:5.343ex;

values: vertical-align: -1.838ex; width:55.354ex; height:6.509ex;

values: vertical-align: -0.838ex; width:22.446ex; height:2.843ex;

values: vertical-align: -0.338ex; width:12.835ex; height:2.176ex;

values: vertical-align: -3.005ex; width:8.768ex; height:6.843ex;

values:
/wiki/Real_numbers
mw-redirect
Real numbers

values:
/wiki/Complete_space
mw-redirect
Complete space

values: Edit section: Examples of numerical series

values: vertical-align: -3.005ex; width:37.949ex; height:6.843ex;

values: {\displaystyle \sum _{n=0}^{\infty }z^{n}}

values: vertical-align: -3.005ex; width:6.051ex; height:6.843ex;

values: vertical-align: -0.838ex; width:6.643ex; height:2.843ex;

values:
/wiki/Arithmetico-geometric_series
mw-redirect
Arithmetico-geometric series

values:
/wiki/Arithmetic_sequence
mw-redirect
Arithmetic sequence

values: vertical-align: -3.005ex; width:43.937ex; height:6.843ex;

values: vertical-align: -3.005ex; width:35.8ex; height:6.843ex;

values: vertical-align: -3.005ex; width:52.19ex; height:7.176ex;

values:
/wiki/Alternating_harmonic_series
mw-redirect
Alternating harmonic series

values: vertical-align: -3.005ex; width:49.202ex; height:6.843ex;

values: {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{r}}}}

values: vertical-align: -3.005ex; width:6.947ex; height:6.843ex;

values: {\displaystyle \sum _{n=1}^{\infty }(b_{n}-b_{n+1})}

values: vertical-align: -3.005ex; width:14.537ex; height:6.843ex;

values: vertical-align: -3.005ex; width:10.395ex; height:6.843ex;

values: vertical-align: -0.338ex; width:1.332ex; height:1.676ex;

values: On-Line Encyclopedia of Integer Sequences

values: vertical-align: -0.338ex; width:2.727ex; height:1.676ex;

values: vertical-align: -0.338ex; width:5.969ex; height:2.176ex;

values:
/wiki/Irrationality_measure
mw-redirect
Irrationality measure

values: vertical-align: -3.005ex; width:42.153ex; height:6.843ex;

values: vertical-align: -3.005ex; width:61.68ex; height:7.009ex;

values: vertical-align: -3.005ex; width:18.846ex; height:7.009ex;

values: vertical-align: -3.005ex; width:26.72ex; height:6.843ex;

values: vertical-align: -3.005ex; width:31.369ex; height:7.009ex;

values: vertical-align: -3.005ex; width:27.774ex; height:6.843ex;

values: {\displaystyle \sum _{i=1}^{\infty }{\frac {1}{2^{i}i}}=\ln 2}

values: vertical-align: -3.005ex; width:13.93ex; height:6.843ex;

values: vertical-align: -3.005ex; width:24.573ex; height:6.843ex;

values: vertical-align: -3.005ex; width:20.908ex; height:6.843ex;

values: vertical-align: -3.005ex; width:41.537ex; height:7.009ex;

values: vertical-align: -3.005ex; width:43.46ex; height:6.843ex;

values: Edit section: Calculus and partial summation as an operation on sequences

values:
/wiki/Linear_operator
mw-redirect
Linear operator

values: vertical-align: -2.338ex; width:12.704ex; height:5.843ex;

values: {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n^{2}}}}

values: vertical-align: -3.005ex; width:7.027ex; height:6.843ex;

values: vertical-align: -2.171ex; width:27.347ex; height:5.509ex;

values: {\displaystyle \sum _{n=0}^{\infty }\left|a_{n}\right|}

values: vertical-align: -3.005ex; width:7.484ex; height:6.843ex;

values: vertical-align: -3.005ex; width:41.858ex; height:7.009ex;

values: {\displaystyle \sum a_{n}=\sum \lambda _{n}b_{n}}

values: vertical-align: -1.338ex; width:17.821ex; height:3.843ex;

values: vertical-align: -3.005ex; width:61.541ex; height:7.343ex;

values: {\displaystyle \sum _{n=2}^{\infty }{\frac {\sin(nx)}{\ln n}}}

values: vertical-align: -3.005ex; width:11.968ex; height:6.843ex;

values: \sum _{n=2}^{\infty }{\frac {\sin(nx)}{\ln n}}

values: {\displaystyle \sum (\lambda _{n}-\lambda _{n+1})\,B_{n}.}

values: vertical-align: -1.338ex; width:19.269ex; height:3.843ex;

values:
/wiki/N-th_term_test
mw-redirect
N-th term test

values:
/wiki/Monotone_decreasing
mw-redirect
Monotone decreasing

values:
/wiki/Cauchy%27s_condensation_test
mw-redirect
Cauchy's condensation test

values: {\displaystyle \sum _{n=0}^{\infty }f_{n}(x)}

values: vertical-align: -3.005ex; width:9.239ex; height:6.843ex;

values: vertical-align: -3.005ex; width:18.258ex; height:7.343ex;

values: vertical-align: -0.838ex; width:14.473ex; height:2.843ex;

values:
/wiki/Abel%27s_uniform_convergence_test
mw-redirect
Abel's uniform convergence test

values:
/wiki/Dini%27s_test
mw-redirect
Dini's test

values:
/wiki/Measure_theory
mw-redirect
Measure theory

values: vertical-align: -2.338ex; width:26.403ex; height:5.676ex;

values: {\displaystyle \sum _{n=0}^{\infty }a_{n}(x-c)^{n}.}

values: vertical-align: -3.005ex; width:15.042ex; height:6.843ex;

values: {\displaystyle \sum _{n=0}^{\infty }{\frac {x^{n}}{n!}}}

values: vertical-align: -3.005ex; width:7.126ex; height:6.843ex;

values: vertical-align: -0.338ex; width:2.256ex; height:2.343ex;

values:
/wiki/Compact_set
mw-redirect
Compact set

values:
/wiki/Graded_algebra
mw-redirect
Graded algebra

values:
/wiki/Natural_numbers
mw-redirect
Natural numbers

values: {\displaystyle \sum _{n=-\infty }^{\infty }a_{n}x^{n}.}

values: vertical-align: -3.005ex; width:11.217ex; height:6.843ex;

values: {\displaystyle \sum _{n=1}^{\infty }{a_{n} \over n^{s}},}

values: vertical-align: -3.005ex; width:7.673ex; height:6.843ex;

values: vertical-align: -3.005ex; width:14.716ex; height:6.843ex;

values: {\displaystyle \mathbf {C} \setminus \{1\}}

values: vertical-align: -0.838ex; width:7.613ex; height:2.843ex;

values:
/wiki/Pole_(complex_analysis)
mw-redirect
Pole (complex analysis)

values:
/wiki/Trigonometric_function
mw-redirect
Trigonometric function

values: vertical-align: -3.005ex; width:35.63ex; height:6.843ex;

values: Edit section: History of the theory of infinite series

values: Edit section: Development of infinite series

values: James Gregory (astronomer and mathematician)

values:
/wiki/Maclaurin_series
mw-redirect
Maclaurin series

values:
/wiki/Hypergeometric_series
mw-redirect
Hypergeometric series

values: vertical-align: -2.671ex; width:39.16ex; height:6.509ex;

values: vertical-align: -2.005ex; width:29.726ex; height:5.843ex;

values: vertical-align: -0.338ex; width:2.04ex; height:1.676ex;

values: vertical-align: -0.338ex; width:1.33ex; height:1.676ex;

values:
/wiki/George_Gabriel_Stokes
mw-redirect
George Gabriel Stokes

values: vertical-align: -0.838ex; width:32.992ex; height:2.843ex;

values:
/wiki/Josef_Hoene-Wronski
mw-redirect
Josef Hoene-Wronski

values:
/wiki/Franciscus_Vieta
mw-redirect
Franciscus Vieta

values:
/wiki/Joseph_Louis_Lagrange
mw-redirect
Joseph Louis Lagrange

values:
/wiki/Augustin_Louis_Cauchy
mw-redirect
Augustin Louis Cauchy

values: Journal für die reine und angewandte Mathematik

values:
/wiki/Asymptotic_series
mw-redirect
Asymptotic series

values:
/wiki/Summability_method
mw-redirect
Summability method

values:
/wiki/Abel_summation
mw-redirect
Abel summation

values: vertical-align: -3.005ex; width:17.562ex; height:7.343ex;

values: Edit section: Summations over arbitrary index sets

values: vertical-align: -0.338ex; width:9.78ex; height:2.176ex;

values: vertical-align: -0.338ex; width:1.23ex; height:1.676ex;

values: vertical-align: -0.838ex; width:9.036ex; height:2.843ex;

values: vertical-align: -0.338ex; width:5.342ex; height:2.176ex;

values: vertical-align: -3.171ex; width:8.758ex; height:5.676ex;

values: vertical-align: -0.338ex; width:5.948ex; height:2.176ex;

values: vertical-align: -0.338ex; width:10.286ex; height:2.176ex;

values: vertical-align: -0.838ex; width:9.981ex; height:2.843ex;

values: {\displaystyle \sum _{n\in \mathbb {N} }}

values: vertical-align: -3.171ex; width:3.355ex; height:5.676ex;

values: vertical-align: -3.005ex; width:3.355ex; height:6.843ex;

values: vertical-align: -3.005ex; width:28.419ex; height:6.843ex;

values: Edit section: Families of non-negative numbers

values: vertical-align: -3.171ex; width:48.961ex; height:6.176ex;

values: vertical-align: -0.838ex; width:24.759ex; height:2.843ex;

values: vertical-align: -3.338ex; width:36.103ex; height:6.676ex;

values: vertical-align: -3.171ex; width:16.148ex; height:7.343ex;

values: Edit section: Abelian topological groups

values:
/wiki/Inclusion_(mathematics)
mw-redirect
Inclusion (mathematics)

values:
/wiki/Join_(mathematics)
mw-redirect
Join (mathematics)

values: vertical-align: -3.171ex; width:33.702ex; height:6.176ex;

values: vertical-align: -3.171ex; width:26.381ex; height:5.676ex;

values: S-\sum _{i\in A}a_{i}\in V,\quad A\supset A_{0}.

values: vertical-align: -3.505ex; width:36.933ex; height:6.009ex;

values: Edit section: Unconditionally convergent series

values: vertical-align: -3.171ex; width:16.332ex; height:7.009ex;

values: \sum _{n=0}^{\infty }a_{n}=\sum _{n\in \mathbf {N} }a_{n}.

values: vertical-align: -3.005ex; width:18.346ex; height:6.843ex;

values: {\displaystyle \sum _{n=0}^{\infty }\varepsilon _{n}a_{n}}

values: vertical-align: -3.005ex; width:8.492ex; height:6.843ex;

values: \sum _{n=0}^{\infty }\varepsilon _{n}a_{n}

values: {\displaystyle \sum _{n\in \mathbf {N} }\|a_{n}\|<+\infty .}

values: vertical-align: -3.171ex; width:16.599ex; height:5.676ex;

values: \sum _{n\in \mathbf {N} }\|a_{n}\|<+\infty .

values:
/wiki/Transfinite_recursion
mw-redirect
Transfinite recursion

values: vertical-align: -3.338ex; width:22.763ex; height:5.843ex;

values: vertical-align: -3.505ex; width:19.365ex; height:6.009ex;

attrs: columnalign rowspacing columnspacing displaystyle

values: vertical-align: -2.505ex; width:23.918ex; height:6.176ex;

values: vertical-align: -3.171ex; width:10.371ex; height:5.676ex;

values:
/wiki/Topology_of_pointwise_convergence
mw-redirect
Topology of pointwise convergence

values:
/wiki/Partitions_of_unity
mw-redirect
Partitions of unity

values: {\displaystyle \sum _{i\in I}\varphi _{i}(x)=1.}

values: vertical-align: -3.171ex; width:14.109ex; height:5.676ex;

values: vertical-align: -3.505ex; width:16.94ex; height:6.009ex;

values: \sum _{\alpha \in [0,\omega _{1})}f(\alpha )=\omega _{1}

values: Infinite compositions of analytic functions

values:
/wiki/Infinite_expression_(mathematics)
mw-redirect
Infinite expression (mathematics)

values:
nofollow
external text
https://arxiv.org/abs/1104.5100

values:
nofollow
external text
//doi.org/10.1073%2Fpnas.36.3.192

attrs: alt src title width height srcset data-file-width data-file-height

attrs: alt src width height srcset data-file-width data-file-height

values: Fibonacci spiral with square sizes up to 34.

values:
navbox-image
6
width:1px;padding:0px 0px 0px 2px

values:
/wiki/Monotone_sequence
mw-redirect
Monotone sequence

values:
/wiki/Infinite_arithmetic_series
mw-redirect
Infinite arithmetic series

values: Divergence of the sum of the reciprocals of the primes

values:
/wiki/Generating_series
mw-redirect
Generating series

values:
/wiki/Generalized_hypergeometric_series
mw-redirect
Generalized hypergeometric series

values: Hypergeometric function of a matrix argument

values:
/wiki/Modular_hypergeometric_series
mw-redirect
Modular hypergeometric series

values:
/wiki/Theta_hypergeometric_series
mw-redirect
Theta hypergeometric series

values: nowraplinks collapsible autocollapse navbox-inner

values: Category:Pages with citations having redundant parameters

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values:
/wiki/Series_(mathematics)
View the content page [ctrl-alt-c]
c

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values: Permanent link to this revision of the page

values: Link to connected data repository item [ctrl-alt-g]

values: Printable version of this page [ctrl-alt-p]

values: portal navigation p-wikibase-otherprojects p-wikibase-otherprojects-label

values: متسلسلة (رياضيات) – Arabic

values:
interlanguage-link interwiki-az
display: none;

values:
interlanguage-link interwiki-zh-min-nan
display: none;

values: Һанлы рәт – Bashkir

values:
interlanguage-link interwiki-ba
display: none;

values: Рад (матэматыка) – Belarusian

values:
interlanguage-link interwiki-be
display: none;

values: Лікавы шэраг – Belarusian (Taraškievica orthography)

values:
interlanguage-link interwiki-be-x-old
display: none;

values: Числов ред – Bulgarian

values:
interlanguage-link interwiki-bg
display: none;

values:
interlanguage-link interwiki-bs
display: none;

values:
interlanguage-link interwiki-ca
display: none;

values:
interlanguage-link interwiki-cs
display: none;

values:
interlanguage-link interwiki-da
display: none;

values:
interlanguage-link interwiki-de
display: none;

values: Σειρά – Greek

values:
interlanguage-link interwiki-el
display: none;

values:
interlanguage-link interwiki-eo
display: none;

values:
interlanguage-link interwiki-eu
display: none;

values: سری (ریاضیات) – Persian

values:
interlanguage-link interwiki-fa
display: none;

values:
interlanguage-link interwiki-fr
display: none;

values:
interlanguage-link interwiki-gl
display: none;

values:
interlanguage-link interwiki-gan
display: none;

values:
interlanguage-link interwiki-hak
display: none;

values:
interlanguage-link interwiki-ko
display: none;

values: श्रेणी (गणित) – Hindi

values:
interlanguage-link interwiki-hr
display: none;

values:
interlanguage-link interwiki-is
display: none;

values:
https://it.wikipedia.org/wiki/Serie
Serie – Italian
it
it
interlanguage-link-target

values:
interlanguage-link interwiki-it
display: none;

values: טור (מתמטיקה) – Hebrew

values:
interlanguage-link interwiki-he
display: none;

values: ಶ್ರೇಢಿಗಳು (ಗಣಿತ) – Kannada

values:
interlanguage-link interwiki-kn
display: none;

values: მწკრივი (მათემატიკა) – Georgian

values:
interlanguage-link interwiki-ka
display: none;

values: ຊຸດຈຳນວນ – Lao

values:
interlanguage-link interwiki-lo
display: none;

values:
interlanguage-link interwiki-la
display: none;

values:
interlanguage-link interwiki-lv
display: none;

values:
interlanguage-link interwiki-lb
display: none;

values:
interlanguage-link interwiki-lt
display: none;

values:
interlanguage-link interwiki-hu
display: none;

values: Ред (математика) – Macedonian

values:
interlanguage-link interwiki-mk
display: none;

values:
interlanguage-link interwiki-ml
display: none;

values:
interlanguage-link interwiki-nl
display: none;

values: श्रेणी – Nepali

values:
interlanguage-link interwiki-ne
display: none;

values:
interlanguage-link interwiki-ja
display: none;

values:
interlanguage-link interwiki-no
display: none;

values:
https://uz.wikipedia.org/wiki/Qatorlar
Qatorlar – Uzbek
uz
uz
interlanguage-link-target

values:
interlanguage-link interwiki-uz
display: none;

values: Siiriz (matimatix) – Jamaican Creole English

values:
interlanguage-link interwiki-jam
display: none;

values:
interlanguage-link interwiki-pl
display: none;

values:
interlanguage-link interwiki-ro
display: none;

values: Числовой ряд – Russian

values:
interlanguage-link interwiki-sco
display: none;

values:
interlanguage-link interwiki-scn
display: none;

values: අපරිමිත ශ්‍රේණි – Sinhala

values:
interlanguage-link interwiki-si
display: none;

values:
interlanguage-link interwiki-simple
display: none;

values:
interlanguage-link interwiki-sk
display: none;

values:
interlanguage-link interwiki-sl
display: none;

values:
interlanguage-link interwiki-ckb
display: none;

values: Ред (математика) – Serbian

values:
interlanguage-link interwiki-sr
display: none;

values:
interlanguage-link interwiki-sh
display: none;

values:
interlanguage-link interwiki-fi
display: none;

values:
interlanguage-link interwiki-sv
display: none;

values: தொடர் (கணிதம்) – Tamil

values:
interlanguage-link interwiki-ta
display: none;

values: อนุกรม – Thai

values:
interlanguage-link interwiki-th
display: none;

values:
https://tr.wikipedia.org/wiki/Seri
Seri – Turkish
tr
tr
interlanguage-link-target

values:
interlanguage-link interwiki-tr
display: none;

values: Ряд (математика) – Ukrainian

values:
interlanguage-link interwiki-uk
display: none;

values: سلسلہ (ریاضی) – Urdu

values:
interlanguage-link interwiki-vi
display: none;

values:
interlanguage-link interwiki-zh-yue
display: none;

values: All languages (initial selection from common choices by you and others)

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Series_mathematics rootpage-Series_mathematics skin-vector action-view