Misplaced Pages

Addition: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 04:24, 17 May 2003 editPizza Puzzle (talk | contribs)4,762 editsmNo edit summary← Previous edit Revision as of 06:37, 17 May 2003 edit undoPizza Puzzle (talk | contribs)4,762 editsmNo edit summaryNext edit →
Line 8: Line 8:


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. This is known as the ] and ] of addition. If you add ] to any real ], the number representing said quantity won't change; for real numbers, zero is the ]. The sum of any real number and its ] is zero. 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. This is known as the ] and ] of addition. If you add ] to any real ], the number representing said quantity won't change; for real numbers, zero is the ]. The sum of any real number and its ] is zero.

See also: ]


== Notation == == Notation ==

Revision as of 06:37, 17 May 2003

Addition is one of the basic operations of arithmetic. Addition combines two or more numbers, the summands, into a single number, the sum. (If there are only two terms, these are the augend and addend respectively.) For a definition of addition in the natural numbers, see Addition in N.

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. This is known as the associativity and commutativity of addition. If you add zero to any real quantity, the number representing said quantity won't change; for real numbers, zero is the additive identity. The sum of any real number and its additive inverse is zero.

See also: distributive property

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 with the summation symbol, which is a capital Sigma from the Greek alphabet. This is defined as:

i = m n x i = x m + x m + 1 + x m + 2 + . . . + x n 1 + x n {\displaystyle \sum _{i=m}^{n}x_{i}=x_{m}+x_{m+1}+x_{m+2}+...+x_{n-1}+x_{n}}


The subscript gives the symbol for a dummy variable (i in our case) and its lower value (m); the superscript gives its upper value. So for instance

i = 2 6 i 2 = 2 2 + 3 2 + 4 2 + 5 2 + 6 2 = 90 {\displaystyle \sum _{i=2}^{6}i^{2}=2^{2}+3^{2}+4^{2}+5^{2}+6^{2}=90}

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.

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 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 nx, 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:

i = 1 n i = n ( n + 1 ) 2 {\displaystyle \sum _{i=1}^{n}i={n(n+1) \over 2}}
i = 1 n ( 2 i 1 ) = n 2 {\displaystyle \sum _{i=1}^{n}(2i-1)=n^{2}}
i = 0 n i 2 = n ( n + 1 ) ( 2 n + 1 ) 6 {\displaystyle \sum _{i=0}^{n}i^{2}={\frac {n(n+1)(2n+1)}{6}}}
i = 0 n i 3 = ( n ( n + 1 ) 2 ) 2 {\displaystyle \sum _{i=0}^{n}i^{3}=\left({n(n+1) \over 2}\right)^{2}}
i = 0 n x i = x n + 1 1 x 1 {\displaystyle \sum _{i=0}^{n}x^{i}={\frac {x^{n+1}-1}{x-1}}} (see geometric series)
i = 0 x i = 1 1 x {\displaystyle \sum _{i=0}^{\infty }x^{i}={\frac {1}{1-x}}}
i = 0 n ( n i ) = 2 n {\displaystyle \sum _{i=0}^{n}{n \choose i}=2^{n}} (see binomial coefficient)
i = 0 n 1 ( i k ) = ( n k + 1 ) {\displaystyle \sum _{i=0}^{n-1}{i \choose k}={n \choose k+1}}

The following are useful approximations (using theta notation):

i = 1 n i c = θ ( n c + 1 ) {\displaystyle \sum _{i=1}^{n}i^{c}=\theta (n^{c+1})} for every real constant c ≠ -1.
i = 1 n 1 i = θ ( log n ) {\displaystyle \sum _{i=1}^{n}{\frac {1}{i}}=\theta (\log {n})}
i = 1 n c i = θ ( c n ) {\displaystyle \sum _{i=1}^{n}c^{i}=\theta (c^{n})} for every real constant c ≠ 1.
i = 1 n log ( i ) c = θ ( n log ( n ) c ) {\displaystyle \sum _{i=1}^{n}\log {(i)}^{c}=\theta (n\cdot \log {(n)}^{c})} for every real constant c ≥ 0.
i = 1 n log ( i ) c i d = θ ( n d + 1 log ( n ) c ) {\displaystyle \sum _{i=1}^{n}\log {(i)}^{c}\cdot i^{d}=\theta (n^{d+1}\cdot \log {(n)}^{c})} for all real constants c ≥ 0 and d ≥ 0.
i = 1 n log ( i ) c i d b i = θ ( n d log ( n ) c b n ) {\displaystyle \sum _{i=1}^{n}\log {(i)}^{c}\cdot i^{d}\cdot b^{i}=\theta (n^{d}\cdot \log {(n)}^{c}\cdot b^{n})} for all real constants c ≥ 0, d ≥ 0 and b > 1.

See also: