Difference between revisions of "Sigma notation"
m (→Examples) |
m (→Examples) |
||
| (2 intermediate revisions by one other user not shown) | |||
| Line 4: | Line 4: | ||
== Definition == | == Definition == | ||
| − | For any | + | For any integers <math>m</math> and <math>n</math> such that <math>m \leq n</math> and any function <math>a(x)</math> defined on the integers, we write <math>\sum_{k=m}^n a(k)</math> for the sum <math>a(m)+a(m+1)+a(m+2)+\ldots+a(n-1)+a(n)</math>. |
| − | |||
== Description == | == Description == | ||
| Line 13: | Line 12: | ||
For any constant c and [[finite]] (or [[absolutely convergent]]) [[series]] <math>a_k</math> and <math>b_k</math>, | For any constant c and [[finite]] (or [[absolutely convergent]]) [[series]] <math>a_k</math> and <math>b_k</math>, | ||
*<math>\sum_a^b c = c(b-a+1)</math> | *<math>\sum_a^b c = c(b-a+1)</math> | ||
| + | |||
*<math>\sum ca_k = c\sum a_k</math> | *<math>\sum ca_k = c\sum a_k</math> | ||
| + | |||
*<math>\sum (a_k + b_k) = \sum a_k + \sum b_k</math> | *<math>\sum (a_k + b_k) = \sum a_k + \sum b_k</math> | ||
| Line 19: | Line 20: | ||
* <math>\sum_{i = 33}^{56} 1 = 1 + 1 + \ldots + 1 + 1 = 24</math> | * <math>\sum_{i = 33}^{56} 1 = 1 + 1 + \ldots + 1 + 1 = 24</math> | ||
| − | * <math>\sum_{i = 1}^{\infty} \left(\dfrac{1}{2}\right)^ | + | * <math>\sum_{i = 1}^{\infty} \left(\dfrac{1}{2}\right)^i = \dfrac{1}{2} + \dfrac{1}{4} + \dfrac{1}{16} + \ldots = 1</math> |
== See Also == | == See Also == | ||
Latest revision as of 16:17, 8 February 2024
This article is a stub. Help us out by expanding it.
Sigma notation, also known as summation notation, provides a method for writing long, complicated, sometimes infinite sums neatly and compactly. Besides being easier to write than the explicit sum, sigma notation is also useful in that it shows the general form of each addend.
Definition
For any integers 
and 
such that 
and any function 
defined on the integers, we write 
for the sum 
.
Description
Let's first use an example to demonstrate how to use the notation. Consider the sum 
. We'll denote the sequence 
where k is the number of terms being summed. We want to rewrite the sum so that each term is in terms of its number k in the sequence. Factoring, we get, 
. Now, we see that each term is five times it's number in the sequence k; that is, as k ranges from 1 to 5, each term can be written as 5k. This sum is written in summation notation as 
. In this case, 1 is the lower limit of summation, the number the index of summation k starts the sum with, and ends with the upper limit of summation 5. One way to remember the terms is to note that the lower limit of summation is written under the sigma and the upper one is written above the sigma.
Properties
For any constant c and finite (or absolutely convergent) series and 
,
