Addition

Addition is one of the basic operations of arithmetic. Template:WiktionaryIn its simplest form, addition combines two numbers (terms, summands), the augend and addend, into a single number, the sum. Adding more numbers corresponds to repeated addition. By extension, addition of zero, one or infinitely many numbers can be defined, see below.

For a definition of addition in the natural numbers, see Addition in N.

See also: counting

Contents

1 Important properties 2 Notation 3 Relationships to other operations and constants 4 Useful sums 5 Approximation by integrals 6 In music 7 See also 8 External links

Important properties

When adding finitely many numbers, it doesn't matter how you group the numbers and in which order you add them; you will always get the same result. (See Associativity and Commutativity.) If you add zero to any number, the quantity won't change; zero is the identity element for addition. The sum of any number and its additive inverse (in contexts where such a thing exists) is zero.: )

Notation

If the terms are all written out individually, then addition is written using the plus sign ("+"). Thus, the sum of 1, 2, and 4 is 1 + 2 + 4 = 7. If the terms are not written out individually, then the sum may be written with an ellipsis to mark out the missing terms. Thus, the sum of all the natural numbers from 1 to 100 is 1 + 2 + … + 99 + 100.

Alternatively, the sum can be represented by the summation symbol, which is the capital Sigma. This is defined as:

<math> \sum_{i=m}^{n} x_{i} = x_{m} + x_{m+1} + x_{m+2} + \dots + x_{n-1} + x_{n}. <math>

The subscript gives the symbol for a dummy variable, i. Here, i represents the index of summation; m is the lower bound of summation, and n is the upper bound of summation. So, for example:

<math> \sum_{x=2}^{6} x^{2} = 2^{2} + 3^{2} + 4^{2} + 5^{2} + 6^{2} = 90. <math>

One may also consider sums of infinitely many terms; these are called infinite series. Notationally, we would replace n above by the infinity symbol (∞). The sum of such a series is defined as the limit of the sum of the first n terms, as n grows without bound. That is:

<math> \sum_{i=m}^{\infty} x_{i} := \lim_{n\to\infty} \sum_{i=m}^{n} x_{i}. <math>

One can similarly replace m with negative infinity, and

<math>\sum_{i=-\infty}^\infty x_i := \lim_{n\to\infty}\sum_{i=-n}^m x_i + \lim_{n\to\infty}\sum_{i=m+1}^n x_i,<math>

for some integer m, provided both limits exist.

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. For example:

<math>\sum_{0\le x< 100} f(x)<math>

is the sum of f(x) over all (integer) x in the specified range,

<math>\sum_{x\in S} f(x)<math>

is the sum over all x in the set S, and

<math>\sum_{d|n}\mu(d)<math>

is the sum of μ(d) over all integers d dividing n.

Relationships to other operations and constants

It's possible to add fewer than 2 numbers:

• If you add the single term x, then the sum is x.
• If you add zero terms, then the 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 m = n in the definition above, then there is only one term in the sum; if m = n + 1, then there is none.

Many other operations can be thought of as generalised sums. If a single term x appears in a sum n times, then the sum is n'x, the result of a multiplication. If n is not a natural number, then the multiplication may still make sense, so that we have a sort of notion of adding a term, say, two and a half times.

A special case is multiplication by -1, which leads to the concept of the additive inverse, and to subtraction, the inverse operation to addition.

The most general version of these ideas is the linear combination, where any number of terms are included in the generalised sum any number of times.

Useful sums

The following are useful identities:

<math> \sum_{i=1}^{n} i = \frac {n(n+1)}{2} <math>

(see arithmetic series);

<math>\sum_{k=i}^nk = \frac{(n-i+1)(n+i)}{2}<math>

<math> \sum_{i=1}^{n} (2i - 1) = n^2; <math>

<math> \sum_{i=0}^{n} i^{2} = \frac{n(n+1)(2n+1)}{6}; <math>

<math> \sum_{i=0}^{n} i^{3} = \left(\frac{n(n+1)}{2}\right)^{2}; <math>

<math> \sum_{i=N_1}^{N_2} x^{i} = \frac{x^{N_2+1}-x^{N_1}}{x-1}<math> (see geometric series);

<math> \sum_{i=0}^{n} x^{i} = \frac{x^{n+1}-1}{x-1} <math> (special case of the above where <math>{N_1}=0<math>)

<math> \sum_{i=0}^{\infty} x^{i} = \frac{1}{1-x};<math> (special case of the above, <math>\lim_{n\to\infty}<math> and <math>|x|<1<math>);

<math> \sum_{i=0}^{n} {n \choose i} = 2^{n} <math>

(see binomial coefficient);

<math> \sum_{i=0}^{n-1} {i \choose k} = {n \choose k+1}. <math>

<math>\left(\sum_i a_i\right)\left(\sum_j b_j\right) = \sum_i\sum_j a_ib_j<math>

<math>{\left(\sum_i a_i\right)}^2 = 2\sum_i\sum_{j

In general, the sum of the first n mth powers is

<math>\sum_{i=0}^n i^m = \frac{(n+1)^{m+1}}{m+1} + \sum_{k=1}^m\frac{B_k}{m-k+1}{m\choose k}(n+1)^{m-k+1},<math>

where <math>B_k<math> is the kth Bernoulli number.

The following are useful approximations (using theta notation):

<math> \sum_{i=1}^{n} i^{c} = \Theta(n^{c+1}) <math>

for every real constant c greater than -1;

<math> \sum_{i=1}^{n} \frac{1}{i} = \Theta(\log{n}); <math>

<math> \sum_{i=1}^{n} c^{i} = \Theta(c^{n}) <math>

for every real constant c greater than 1;

<math> \sum_{i=1}^{n} \log(i)^{c} = \Theta(n \cdot \log(n)^{c}) <math>

for every nonnegative real constant c;

<math> \sum_{i=1}^{n} \log(i)^{c} \cdot i^{d} = \Theta(n^{d+1} \cdot \log(n)^{c}) <math>

for all nonnegative real constants c and d;

<math> \sum_{i=1}^{n} \log(i)^{c} \cdot i^{d} \cdot b^{i} = \Theta (n^{d} \cdot \log(n)^{c} \cdot b^{n}) <math>

for all nonnegative real constants b > 1, c, d.

Approximation by integrals

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

<math> \int_{s=a-1}^{b} f(s)\, ds \le \sum_{i=a}^{b} f(i) \le \int_{s=a}^{b+1} f(s)\, ds.<math>

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

In music

Sums are also used in musical set theory. George Perle provides the following example:

"C-E, D-F♯, E♭-G, are different instances of the same interval… the other kind of identity… has to do with axes of symmetry. C-E belongs to a family of symmetrically related dyads as follows:"

D

D♯

E

F

F♯

G

G♯

D

C♯

C

B

A♯

A

G♯

Axis pitches italicized, the axis is pitch class determined.

Thus in addition to being part of the interval-4 family, C-E is also a part of the sum-2 family (with G♯ equal to 0).

The tone row to Alban Berg's Lyric Suite, <math>\{0,11,7,4,2,9,3,8,10,1,5,6\}<math>, is a series of six dyads, all sum 11. If the row is rotated and retograded, so it runs <math>\{0,6,5,1,\dots\}<math>, the dyads are all sum 6.

Successive dyads from Lyric Suite tone row, all sum 11

C		G		D		D♯		A♯		E♯
B		E		A		G♯		C♯		F♯

Axis pitches italicized, the axis is dyad (interval 1) determined

See also

• Incrementation
• Plus and minus signs
• Equals sign
• Modular arithmetic
• Elementary arithmetic

External links

• Addition (http://www.cut-the-knot.org/do_you_know/addition.shtml)
• Template:Planetmath reference
• Addition on a Japanese abacus (http://webhome.idirect.com/~totton/abacus/pages.htm#Addition1) selected from Abacus: Mystery of the Bead (http://webhome.idirect.com/~totton/abacus/)ca:Suma

da:Addition de:Addition et:Liitmine es:Suma eo:Operacioj per nombroj fr:Addition is:Samlagning lt:Sudėtis nl:Optellen ja:総和 pl:Dodawanie ru:Сложение (чисел) simple:Addition fi:Yhteenlasku sl:Vsota sv:Addition zh:加法 th:การบวก