The summation of an explicit sequence is denoted as a succession of additions. For example, summation of [1, 2, 4, 2] is denoted 1 + 2 + 4 + 2, and results in 9, that is, 1 + 2 + 4 + 2 = 9. Because addition is associative and commutative, there is no need of parentheses, and the result does not depend on the order of the summands. Summation of a sequence of only one element results in this element itself. Summation of an empty sequence (a sequence with zero element) results, by convention, in 0.
Very often, the elements of a sequence are defined, through regular pattern, as a function of their place in the sequence. For simple patterns, summation of long sequences may be represented with most summands replaced by ellipses. For example, summation of the first 100 natural numbers may be written 1 + 2 + 3 + 4 + + 99 + 100. Otherwise, summation is denoted by using ? notation, where is an enlarged capital Greek lettersigma. For example, the sum of the first n natural integers is denoted
For long summations, and summations of variable length (defined with ellipses or ? notation), it is a common problem to find closed-form expressions for the result. For example,[a]
Although such formulas do not always exist, many summation formulas have been discovered. Some of the most common and elementary ones are listed in this article.
The summation symbol
Mathematical notation uses a symbol that compactly represents summation of many similar terms: the summation symbol, , an enlarged form of the upright capital Greek letter Sigma. This is defined as:
where i represents the index of summation; ai 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.[b]
Here is an example showing the summation of squares:
Informal writing sometimes omits the definition of the index and bounds of summation when these are clear from context, as in:
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:
is the sum of over all (integers) in the specified range,
is the sum of over all elements in the set , and
is the sum of over all positive integers dividing .[c]
There are also ways to generalize the use of many sigma signs. For example,
is the same as
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 , an enlarged form of the Greek capital letter Pi, replacing the .
It is possible to sum fewer than 2 numbers:
If the summation has one summand , then the evaluated sum is .
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 in the definition above, then there is only one term in the sum; if , then there is none.
where f is a function defined on the nonnegative integers.
Thus, given such a function f, the problem is to compute the antidifference of f, that is, a function such that , that is,
This function is defined up to the addition of a constant, and may be chosen as
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
since the right hand side is by definition the limit for 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.
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.
^Although the name of the dummy variable does not matter (by definition), one usually uses letters from the middle of the alphabet ( through ) to denote integers, if there is a risk of confusion. For example, even if there should be no doubt about the interpretation, it could look slightly confusing to many mathematicians to see instead of in the above formulae involving . See also typographical conventions in mathematical formulae.
^Handbook of Discrete and Combinatorial Mathematics, Kenneth H. Rosen, John G. Michaels, CRC Press, 1999, ISBN0-8493-0149-1.