Summation

Calculation results v t e
Addition (+)
${\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{summand}}\,+\,{\text{summand}}\\\scriptstyle {\text{addend (broad sense)}}\,+\,{\text{addend (broad sense)}}\\\scriptstyle {\text{augend}}\,+\,{\text{addend (strict sense)}}\end{matrix}}\right\}\,=\,}$	${\displaystyle \scriptstyle {\text{sum}}}$
Subtraction (−)
${\displaystyle \scriptstyle {\text{minuend}}\,-\,{\text{subtrahend}}\,=\,}$	${\displaystyle \scriptstyle {\text{difference}}}$
Multiplication (×)
${\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{factor}}\,\times \,{\text{factor}}\\\scriptstyle {\text{multiplier}}\,\times \,{\text{multiplicand}}\end{matrix}}\right\}\,=\,}$	${\displaystyle \scriptstyle {\text{product}}}$
Division (÷)
${\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\frac {\scriptstyle {\text{dividend}}}{\scriptstyle {\text{divisor}}}}\\\scriptstyle {\text{ }}\\\scriptstyle {\frac {\scriptstyle {\text{numerator}}}{\scriptstyle {\text{denominator}}}}\end{matrix}}\right\}\,=\,}$	${\displaystyle {\begin{matrix}\scriptstyle {\text{fraction}}\\\scriptstyle {\text{quotient}}\\\scriptstyle {\text{ratio}}\end{matrix}}}$
Exponentiation
${\displaystyle \scriptstyle {\text{base}}^{\text{exponent}}\,=\,}$	${\displaystyle \scriptstyle {\text{power}}}$
nth root (√)
${\displaystyle \scriptstyle {\sqrt[{\text{degree}}]{\scriptstyle {\text{radicand}}}}\,=\,}$	${\displaystyle \scriptstyle {\text{root}}}$
Logarithm (log)
${\displaystyle \scriptstyle \log _{\text{base}}({\text{antilogarithm}})\,=\,}$	${\displaystyle \scriptstyle {\text{logarithm}}}$

In mathematics, summation (denoted with an enlarged capital Greek sigma symbol ${\displaystyle \textstyle \sum }$) is the addition of a sequence of numbers; the result is their sum or total. If numbers are added sequentially from left to right, any intermediate result is a partial sum, prefix sum, or running total of the summation.

The numbers to be summed (called addends, or sometimes summands) may be integers, rational numbers, real numbers, or complex numbers. Besides numbers, other types of values can be added as well: vectors, matrices, polynomials and, in general, elements of any additive group (or even monoid).

For finite sequences of such elements, summation always produces a well-defined sum. The summation of an infinite sequence of values is called a series. A value of such a series may often be defined by means of a limit (although sometimes the value may be infinite, and often no value results at all). Another notion involving limits of finite sums is integration.

The summation of the sequence [1, 2, 4, 2] is an expression whose value is the sum of each of the members of the sequence. In the example, 1 + 2 + 4 + 2 = 9. Because addition is associative, the sum does not depend on how the additions are grouped, for instance (1 + 2) + (4 + 2) and 1 + ((2 + 4) + 2) both have the value 9; therefore, parentheses are usually omitted in repeated additions. Addition is also commutative, so permuting the terms of a finite sequence does not change its sum. For infinite summations this property may fail. See Absolute convergence for conditions under which it still holds.

There is no special notation for the summation of such explicit sequences, as the corresponding repeated addition expression will do. There is only a slight difficulty if the sequence has fewer than two elements: the summation of a sequence of one term involves no plus sign (it is indistinguishable from the term itself) and the summation of the empty sequence cannot even be written down (but one can write its value "0" in its place). If, however, the terms of the sequence are given by a regular pattern, possibly of variable length, then a summation operator may be useful or even essential.

For the summation of the sequence of consecutive integers from 1 to 100, one could use an addition expression involving an ellipsis to indicate the missing terms: 1 + 2 + 3 + 4 + ... + 99 + 100. In this case, the reader can easily guess the pattern. However, for more complicated patterns, one needs to be precise about the rule used to find successive terms, which can be achieved by using the summation operator "Σ". Using this sigma notation the above summation is written as:

${\displaystyle \sum _{i\mathop {=} 1}^{100}i.}$

The value of this summation is 5050. It can be found without performing 99 additions, since it can be shown (for instance by mathematical induction) that

${\displaystyle \sum _{i\mathop {=} 1}^{n}i={\frac {n(n+1)}{2}}}$

for all natural numbers n.^[1] More generally, formulae exist for many summations of terms following a regular pattern.

The term "indefinite summation" refers to the search for an inverse image of a given infinite sequence s of values for the forward difference operator, in other words for a sequence, called antidifference of s, whose finite differences are given by s. By contrast, summation as discussed in this article is called "definite summation".

When it is necessary to clarify that numbers are added with their signs, the term algebraic sum^[2] is used. For example, in electric circuit theory Kirchhoff's circuit laws consider the algebraic sum of currents in a network of conductors meeting at a point, assigning opposite signs to currents flowing in and out of the node.

Notation[edit]

Capital-sigma notation[edit]

The summation symbol

Mathematical notation uses a symbol that compactly represents summation of many similar terms: the summation symbol, ${\displaystyle \textstyle \sum }$, an enlarged form of the upright capital Greek letter Sigma. This is defined as:

${\displaystyle \sum _{i\mathop {=} m}^{n}a_{i}=a_{m}+a_{m+1}+a_{m+2}+\cdots +a_{n-1}+a_{n}}$

where i represents the index of summation; a_i is an indexed variable representing each successive term in the series; m is the lower bound of summation, and n is the upper bound of summation. The "i = m" under the summation symbol means that the index i starts out equal to m. The index, i, is incremented by 1 for each successive term, stopping when i = n.^[3]

Here is an example showing the summation of squares:

${\displaystyle \sum _{i=3}^{6}i^{2}=3^{2}+4^{2}+5^{2}+6^{2}=86.}$

Informal writing sometimes omits the definition of the index and bounds of summation when these are clear from context, as in:

${\displaystyle \sum a_{i}^{2}=\sum _{i\mathop {=} 1}^{n}a_{i}^{2}.}$

One often sees generalizations of this notation in which an arbitrary logical condition is supplied, and the sum is intended to be taken over all values satisfying the condition. Here are some common examples:

${\displaystyle \sum _{0\leq k<100}f(k)}$

is the sum of ${\displaystyle f(k)}$ over all (integers) ${\displaystyle k}$ in the specified range,

${\displaystyle \sum _{x\mathop {\in } S}f(x)}$

is the sum of ${\displaystyle f(x)}$ over all elements ${\displaystyle x}$ in the set ${\displaystyle S}$, and

${\displaystyle \sum _{d|n}\;\mu (d)}$

is the sum of ${\displaystyle \mu (d)}$ over all positive integers ${\displaystyle d}$ dividing ${\displaystyle n}$.^[4]

There are also ways to generalize the use of many sigma signs. For example,

${\displaystyle \sum _{i,j}}$

is the same as

${\displaystyle \sum _{i}\sum _{j}.}$

A similar notation is applied when it comes to denoting the product of a sequence, which is similar to its summation, but which uses the multiplication operation instead of addition (and gives 1 for an empty sequence instead of 0). The same basic structure is used, with ${\displaystyle \textstyle \prod }$, an enlarged form of the Greek capital letter Pi, replacing the ${\displaystyle \textstyle \sum }$.

Special cases[edit]

It is possible to sum fewer than 2 numbers:

• If the summation has one summand ${\displaystyle x}$, then the evaluated sum is ${\displaystyle x}$.
• If the summation has no summands, then the evaluated sum is zero, because zero is the identity for addition. This is known as the empty sum.

These degenerate cases are usually only used when the summation notation gives a degenerate result in a special case. For example, if ${\displaystyle n=m}$ in the definition above, then there is only one term in the sum; if ${\displaystyle n=m-1}$, then there is none.

Formal definition[edit]

Summation may be defined recursively as follows

${\displaystyle \sum _{i=a}^{b}g(i)=0}$ , for b < a.

${\displaystyle \sum _{i=a}^{b}g(i)=g(b)+\sum _{i=a}^{b-1}g(i)}$, for b ≥ a.

Measure theory notation[edit]

In the notation of measure and integration theory, a sum can be expressed as a definite integral,

${\displaystyle \sum _{k\mathop {=} a}^{b}f(k)=\int _{[a,b]}f\,d\mu }$

where ${\displaystyle [a,b]}$ is the subset of the integers from ${\displaystyle a}$ to ${\displaystyle b}$, and where ${\displaystyle \mu }$ is the counting measure.

Fundamental theorem of discrete calculus[edit]

Indefinite sums can be used to calculate definite sums with the formula:^[5]

${\displaystyle \sum _{k=a}^{b}f(k)=\Delta ^{-1}f(b+1)-\Delta ^{-1}f(a)}$

where ${\displaystyle \Delta ^{-1}}$ is the antidifference operator, the inverse of the forward difference operator ${\displaystyle \Delta }$.

Approximation by definite integrals[edit]

Many such approximations can be obtained by the following connection between sums and integrals, which holds for any:

increasing function f:

${\displaystyle \int _{s=a-1}^{b}f(s)\ ds\leq \sum _{i=a}^{b}f(i)\leq \int _{s=a}^{b+1}f(s)\ ds.}$

decreasing function f:

${\displaystyle \int _{s=a}^{b+1}f(s)\ ds\leq \sum _{i=a}^{b}f(i)\leq \int _{s=a-1}^{b}f(s)\ ds.}$

For more general approximations, see the Euler–Maclaurin formula.

For summations in which the summand is given (or can be interpolated) by an integrable function of the index, the summation can be interpreted as a Riemann sum occurring in the definition of the corresponding definite integral. One can therefore expect that for instance

${\displaystyle {\frac {b-a}{n}}\sum _{i=0}^{n-1}f\left(a+i{\frac {b-a}{n}}\right)\approx \int _{a}^{b}f(x)\ dx,}$

since the right hand side is by definition the limit for ${\displaystyle n\to \infty }$ of the left hand side. However, for a given summation n is fixed, and little can be said about the error in the above approximation without additional assumptions about f: it is clear that for wildly oscillating functions the Riemann sum can be arbitrarily far from the Riemann integral.

Identities[edit]

The formulae below involve finite sums; for infinite summations or finite summations of expressions involving trigonometric functions or other transcendental functions, see list of mathematical series.

General identities[edit]

${\displaystyle \sum _{n=s}^{t}C\cdot f(n)=C\cdot \sum _{n=s}^{t}f(n)}$, where C is a constant

${\displaystyle \sum _{n=s}^{t}f(n)\pm \sum _{n=s}^{t}g(n)=\sum _{n=s}^{t}\left[f(n)\pm g(n)\right]}$

${\displaystyle \sum _{n=s}^{t}f(n)=\sum _{n=s+p}^{t+p}f(n-p)}$

${\displaystyle \sum _{n\in B}f(n)=\sum _{m\in A}f(\sigma (m))}$, for a bijection σ from a finite set A onto a finite set B; this generalizes the preceding formula.

${\displaystyle \sum _{n=s}^{j}f(n)+\sum _{n=j+1}^{t}f(n)=\sum _{n=s}^{t}f(n)}$

${\displaystyle \sum _{i=k_{0}}^{k_{1}}\sum _{j=l_{0}}^{l_{1}}a_{i,j}=\sum _{j=l_{0}}^{l_{1}}\sum _{i=k_{0}}^{k_{1}}a_{i,j}}$

${\displaystyle \sum _{k\leq j\leq i\leq n}a_{i,j}=\sum _{i=k}^{n}\sum _{j=k}^{i}a_{i,j}=\sum _{j=k}^{n}\sum _{i=j}^{n}a_{i,j}=\sum _{j=0}^{n-k}\sum _{i=k}^{n-j}a_{i+j,i}}$

${\displaystyle \sum _{n=0}^{t}f(2n)+\sum _{n=0}^{t}f(2n+1)=\sum _{n=0}^{2t+1}f(n)}$

${\displaystyle \sum _{i=s}^{m}\sum _{j=t}^{n}{a_{i}}{c_{j}}=\left(\sum _{i=s}^{m}a_{i}\right)\cdot \sum _{j=t}^{n}c_{j}}$

${\displaystyle \sum _{n=s}^{t}\ln f(n)=\ln \prod _{n=s}^{t}f(n)}$

${\displaystyle c^{\left[\sum _{n=s}^{t}f(n)\right]}=\prod _{n=s}^{t}c^{f(n)}}$

${\displaystyle \left(\sum _{k=0}^{n}a_{k}\right)\cdot \left(\sum _{k=0}^{n}b_{k}\right)=\sum _{k=0}^{2n}\sum _{i=0}^{k}a_{i}b_{k-i}-\sum _{k=0}^{n-1}\left(a_{k}\sum _{i=n+1}^{2n-k}b_{i}+b_{k}\sum _{i=n+1}^{2n-k}a_{i}\right)}$

${\displaystyle \sum _{n=a}^{b}f(n)=\sum _{n=0}^{b}f(n)-\sum _{n=0}^{a-1}f(n)}$

Powers and logarithm of arithmetic progressions[edit]

${\displaystyle \sum _{i=1}^{n}c=nc\quad }$ for every constant c

${\displaystyle \sum _{i=0}^{n}i=\sum _{i=1}^{n}i={\frac {n(n+1)}{2}}\qquad }$ (Sum of the simplest arithmetic progression, consisting of the n first natural numbers.)^[6]

${\displaystyle \sum _{i=1}^{n}2i-1=n^{2}\qquad }$ (Sum of first odd natural numbers)

${\displaystyle \sum _{i=0}^{n}2i=n(n+1)\qquad }$ (Sum of first even natural numbers)

${\displaystyle \sum _{i=1}^{n}\log i=\log n!\qquad }$ (A sum of logarithms is the logarithm of the product)

${\displaystyle \sum _{i=0}^{n}i^{2}={\frac {n(n+1)(2n+1)}{6}}={\frac {n^{3}}{3}}+{\frac {n^{2}}{2}}+{\frac {n}{6}}\qquad }$ (Sum of the first squares, see square pyramidal number.) ^[6]

${\displaystyle \sum _{i=0}^{n}i^{3}=\left(\sum _{i=0}^{n}i\right)^{2}=\left({\frac {n(n+1)}{2}}\right)^{2}={\frac {n^{4}}{4}}+{\frac {n^{3}}{2}}+{\frac {n^{2}}{4}}\qquad }$ (Nicomachus's theorem) ^[6]

More generally,

${\displaystyle \sum _{i=0}^{n}i^{p}={\frac {(n+1)^{p+1}}{p+1}}+\sum _{k=1}^{p}{\frac {B_{k}}{p-k+1}}{p \choose k}(n+1)^{p-k+1},}$

where ${\displaystyle B_{k}}$ denotes a Bernoulli number (see Faulhaber's formula).

In particular^[6]

${\displaystyle \sum _{i=0}^{n}i^{4}={\frac {n(n+1)(2n+1)(3n^{2}+3n-1)}{30}}={\frac {n^{5}}{5}}+{\frac {n^{4}}{2}}+{\frac {n^{3}}{3}}-{\frac {n}{30}}}$

${\displaystyle \sum _{i=1}^{n}i^{5}={\frac {n^{2}(n+1)^{2}(2n^{2}+2n-1)}{12}}}$

${\displaystyle \sum _{i=1}^{n}i^{6}={\frac {n(n+1)(2n+1)(3n^{4}+6n^{3}-3n+1)}{42}}}$

${\displaystyle \sum _{i=1}^{n}i^{7}={\frac {n^{2}(n+1)^{2}(3n^{4}+6n^{3}-n^{2}-4n+2)}{24}}}$

${\displaystyle \sum _{i=1}^{n}i^{8}={\frac {n(n+1)(2n+1)(5n^{6}+15n^{5}+5n^{4}-15n^{3}-n^{2}-9n-3)}{90}}}$

${\displaystyle \sum _{i=1}^{n}i^{9}={\frac {n^{2}(n+1)^{2}(2n^{6}+6n^{5}+n^{4}-8n^{3}+n^{2}+6n-3)}{20}}}$

${\displaystyle \sum _{i=1}^{n}i^{10}={\frac {n(n+1)(2n+1)(3n^{8}+12n^{7}+8n^{6}-18n^{5}-10n^{4}+24n^{3}+2n^{2}-15n+5)}{66}}}$

Summation index in exponents[edit]

In the summations below, ${\displaystyle a\neq 1}$.

${\displaystyle \sum _{i=0}^{n-1}a^{i}={\frac {1-a^{n}}{1-a}}}$ (see geometric series)

${\displaystyle \sum _{i=0}^{n-1}{\frac {1}{2^{i}}}=2-{\frac {1}{2^{n-1}}}}$ (special case when a = 1/2)

${\displaystyle \sum _{i=0}^{n-1}ia^{i}={\frac {a-na^{n}+(n-1)a^{n+1}}{(1-a)^{2}}}}$

${\displaystyle \sum _{i=0}^{n-1}i2^{i}=2+(n-2)2^{n}}$ (special case when a = 2)

${\displaystyle \sum _{i=0}^{n-1}{\frac {i}{2^{i}}}=2-{\frac {n+1}{2^{n-1}}}}$ (special case when a = 1/2)

${\displaystyle {\begin{aligned}\sum _{i=0}^{n-1}\left(b+id\right)a^{i}&=\sum _{i=0}^{n-1}\left(ba^{i}+ida^{i}\right)\\&=b\sum _{i=0}^{n-1}a^{i}+d\sum _{i=0}^{n-1}ia^{i}\\&=b\left({\frac {1-a^{n}}{1-a}}\right)+d\left({\frac {a-na^{n}+(n-1)a^{n+1}}{(1-a)^{2}}}\right)\\&={\frac {b-[b+(n-1)d]a^{n}}{1-a}}+{\frac {da(1-a^{n-1})}{(1-a)^{2}}}\end{aligned}}}$

(see arithmetico-geometric series)

Binomial coefficients and factorials[edit]

There exist very many summation identities involving binomial coefficients (a whole chapter of Concrete Mathematics is devoted to just the basic techniques). Some of the most basic ones are the following.

${\displaystyle \sum _{i=0}^{n}{n \choose i}=2^{n}}$ (Gives the number of combinations in the binomial distribution)

${\displaystyle \sum _{k=0}^{m}\left({\begin{array}{c}n+k\\n\\\end{array}}\right)=\left({\begin{array}{c}n+m+1\\n+1\\\end{array}}\right)}$

${\displaystyle \sum _{i=1}^{n}i{n \choose i}=n(2^{n-1})}$

${\displaystyle \sum _{i=0}^{n}{}_{i}P_{k}{n \choose i}={}_{n}P_{k}(2^{n-k})}$

${\displaystyle \sum _{i=0}^{n}{\frac {n \choose i}{i+1}}={\frac {2^{n+1}-1}{n+1}}}$

${\displaystyle \sum _{i=0}^{n}i!\cdot {n \choose i}=\sum _{i=0}^{n}{}_{n}P_{i}=\lfloor n!\cdot e\rfloor ,\quad n\in \mathbb {Z} ^{+}}$, where ${\displaystyle {}_{n}P_{i}}$ is the number of k-permutations of n and ${\displaystyle \lfloor x\rfloor }$ denotes the floor function.

${\displaystyle \sum _{i=k}^{n}{i \choose k}={n+1 \choose k+1}}$

${\displaystyle \sum _{i=0}^{n}{n \choose i}a^{n-i}b^{i}=(a+b)^{n}}$, the binomial theorem

${\displaystyle \sum _{i=0}^{n}i\cdot i!=(n+1)!-1}$

${\displaystyle \sum _{i=1}^{n}{}_{i+k}P_{k+1}=\sum _{i=1}^{n}\prod _{j=0}^{k}(i+j)={\frac {(n+k+1)!}{(n-1)!(k+2)}}}$

${\displaystyle \sum _{i=0}^{n}{m+i-1 \choose i}={m+n \choose n}}$

${\displaystyle \sum _{i=0}^{n}{n \choose i}^{2}={2n \choose n}}$

Growth rates[edit]

The following are useful approximations (using theta notation):

${\displaystyle \sum _{i=1}^{n}i^{c}\in \Theta (n^{c+1})}$ for real c greater than −1

${\displaystyle \sum _{i=1}^{n}{\frac {1}{i}}\in \Theta (\log _{e}n)}$ (See Harmonic number)

${\displaystyle \sum _{i=1}^{n}c^{i}\in \Theta (c^{n})}$ for real c greater than 1

${\displaystyle \sum _{i=1}^{n}\log(i)^{c}\in \Theta (n\cdot \log(n)^{c})}$ for non-negative real c

${\displaystyle \sum _{i=1}^{n}\log(i)^{c}\cdot i^{d}\in \Theta (n^{d+1}\cdot \log(n)^{c})}$ for non-negative real c, d

${\displaystyle \sum _{i=1}^{n}\log(i)^{c}\cdot i^{d}\cdot b^{i}\in \Theta (n^{d}\cdot \log(n)^{c}\cdot b^{n})}$ for non-negative real b > 1, c, d

Miscellaneous[edit]

${\displaystyle \sum _{i=1}^{n}{\frac {1}{i}}=H_{n}}$ (See Harmonic number)

${\displaystyle \sum _{i=1}^{n}{\frac {1}{i^{k}}}=H_{n}^{k}}$ (See Generalized harmonic number)

See also[edit]

• Einstein notation
• Iverson bracket
• Iterated binary operation
• Kahan summation algorithm
• Products of sequences
• Product (mathematics)

Notes[edit]

External links[edit]

• Media related to Summation at Wikimedia Commons
• "Summation". PlanetMath. 
• Moriarty, Philip; Bowley, Roger (2009). "∑ – Summation (and Fourier Analysis)". Sixty Symbols. Brady Haran for the University of Nottingham.