# What is Sums: Definition and 370 Discussions

In mathematics, summation is the addition of a sequence of any kind of numbers, called addends or summands; the result is their sum or total. Beside numbers, other types of values can be summed as well: functions, vectors, matrices, polynomials and, in general, elements of any type of mathematical objects on which an operation denoted "+" is defined.
Summations of infinite sequences are called series. They involve the concept of limit, and are not considered in this article.
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 is the same irrespective of 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 no elements), by convention, results 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 as 1 + 2 + 3 + 4 + ⋯ + 99 + 100. Otherwise, summation is denoted by using Σ notation, where

{\textstyle \sum }
is an enlarged capital Greek letter sigma. For example, the sum of the first n natural integers can be denoted as

i
=
1

n

i
.

{\textstyle \sum _{i=1}^{n}i.}

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,

i
=
1

n

i
=

n
(
n
+
1
)

2

.

{\displaystyle \sum _{i=1}^{n}i={\frac {n(n+1)}{2}}.}
Although such formulas do not always exist, many summation formulas have been discovered—with some of the most common and elementary ones being listed in the remainder of this article.

View More On Wikipedia.org
1. ### POTW Does the Alternating Binomial Sum Formula Hold for All Positive Integers?

Show that for all positive integers ##n##, $$\binom{n}{1} - \frac{1}{2}\binom{n}{2} + \cdots + (-1)^{n-1}\frac{1}{n}\binom{n}{n} = 1 + \frac{1}{2} + \cdots + \frac{1}{n}$$
2. ### POTW Ramanujan Sums: Showing $c_n(k)$

Consider the ##n##th Ramanujan sum, $$c_n(k) = \sum_{\substack{m = 1\\(m,n) = 1}}^n \exp\left\{2\pi i \frac{k m}{n}\right\}$$ Show that $$c_n(k) = \sum_{d\mid (k,n)} d\, \mu\left(\frac{n}{d}\right)$$
3. ### POTW Limit of Complex Sums: Find $$\lim_{n\to \infty}$$

Let ##c## be a complex number with ##|c| \neq 1##. Find $$\lim_{n\to \infty} \frac{1}{n}\sum_{\ell = 1}^n \frac{\sin(e^{2\pi i \ell/n})}{1-ce^{-2\pi i \ell/n}}$$
4. ### I Original definition of Riemann Integral and Darboux Sums

Given a function ##f##, interval ##[a,b]##, and its tagged partition ##\dot P##. The Riemann Sum is defined over ##\dot P## is as follows: $$S (f, \dot P) = \sum f(t_i) (x_k - x_{k-1})$$ A function is integrable on ##[a,b]##, if for every ##\varepsilon \gt 0##, there exists a...

17. ### Python Calculating Riemann Sums on Python w/ Numpy

import numpy as np def num_int(f,a,b,n): dx=(b-a)/n x=np.arange(a,b,step=dx) y=f(x) return y.sum()*dx def rational_func(x): return 1/(1+x**2) print(num_int(rational_func,2,5,10)) Here is my code for the left endpoint, I know this code works because I compared it to an...

19. ### Mathematica Will Mathematica Optimize Looping for Partial Sums?

In this example, DiscretePlot[ Sum[ f[x], {x,1,n} ],{n,1,20}] will Mathematica automatically optimize the procedure -- i.e., will it run a single loop where it calculates the sum up to 20 only once, transferring the partial sums to the output as it goes along? Assume that there is no...
20. ### A Ascending Order of the Sums of the Elements of the Sub(multi)set of MultiSet

Summary: Generating Subsets of a Multiset in Ascending Order of the Sums of the Elements of the Sub(multi)set I am trying to come up with an algorithm where you can generate combination from a set in a order such that their sums are in increasing order. This set has to be a multiset i.e...
21. ### Riemann sums for discontinuous functions

The definition of the Riemann sums: https://en.wikipedia.org/wiki/Riemann_sum I'm stuck with a problem in my textbook involving upper and lower Riemann sums. The first question in the problem asks whether, given a function ##f## defined on ##[a,b]##, the upper and lower Riemann sums for ##f##...

49. ### I Divergent Sums of Linearly Independent Elements

Suppose we had an infinite series - z = ∑i = 1 to ∞ ( α1(i)x1 + α2(i)x2 + . . . + αm(i)xm ) - rewritten as the cumulative sequence - z(n) = α1(n)x1 + α2(n)x2 + . . . + αm(n)xm - where the xj are linearly independent and normalized (and serve as a finite basis across the sequence). If all...
50. ### I Express power sums in terms of elementary symmetric function

The sum of the $k$ th power of n variables $\sum_{i=1}^{i=n} x_i^k$ is a symmetric polynomial, so it can be written as a sum of the elementary symmetric polynomials. I do know about the Newton's identities, but just with the algorithm of proving the symmetric function theorem, what should we do...