Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Arithmetic progression
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Sum== <div class="thumb tright"> <div class="thumbinner" style="width:220px;"> {| style="background-color:white; width:220px;" | 2 || + || 5 || + || 8 || + || 11 || + || 14 || = || 40 |- | 14 || + || 11 || + || 8 || + || 5 || + || 2 || = || 40 |- |colspan=11|<hr> |- | 16 || + || 16 || + || 16 || + || 16 || + || 16 || = || 80 |} <div class="thumbcaption"> Computation of the sum 2 + 5 + 8 + 11 + 14. When the sequence is reversed and added to itself term by term, the resulting sequence has a single repeated value in it, equal to the sum of the first and last numbers (2 + 14 = 16). Thus 16 Γ 5 = 80 is twice the sum. </div> </div> </div> The [[Summation|sum]] of the members of a finite arithmetic progression is called an '''arithmetic series'''. For example, consider the sum: :<math>2 + 5 + 8 + 11 + 14 = 40 </math> This sum can be found quickly by taking the number ''n'' of terms being added (here 5), multiplying by the sum of the first and last number in the progression (here 2 + 14 = 16), and dividing by 2: :<math>\frac{n(a_1 + a_n)}{2}</math> In the case above, this gives the equation: :<math>2 + 5 + 8 + 11 + 14 = \frac{5(2 + 14)}{2} = \frac{5 \times 16}{2} = 40.</math> This formula works for any arithmetic progression of real numbers beginning with <math>a_1</math> and ending with <math>a_n</math>. For example, :<math>\left(-\frac{3}{2}\right) + \left(-\frac{1}{2}\right) + \frac{1}{2} = \frac{3\left(-\frac{3}{2} + \frac{1}{2}\right)}{2} = -\frac{3}{2}.</math> === Derivation === [[File:Animated proof for the formula giving the sum of the first integers 1+2+...+n.gif|thumb|Animated proof for the formula giving the sum of the first integers 1+2+...+n.]] To derive the above formula, begin by expressing the arithmetic series in two different ways: :<math> S_n=a+a_2+a_3+\dots+a_{(n-1)} +a_n</math> :<math> S_n=a+(a+d)+(a+2d)+\dots+(a+(n-2)d)+(a+(n-1)d). </math> Rewriting the terms in reverse order: :<math> S_n=(a+(n-1)d)+(a+(n-2)d)+\dots+(a+2d)+(a+d)+a.</math> Adding the corresponding terms of both sides of the two equations and halving both sides: :<math> S_n=\frac{n}{2}[2a + (n-1)d].</math> This formula can be simplified as: :<math>\begin{align} S_n &=\frac{n}{2}[a + a + (n-1)d].\\ &=\frac{n}{2}(a+a_n).\\ &=\frac{n}{2}(\text{initial term}+\text{last term}). \end{align}</math> Furthermore, the mean value of the series can be calculated via: <math>S_n / n</math>: :<math> \overline{a} =\frac{a_1 + a_n}{2}.</math> The formula is essentially the same as the formula for the mean of a [[discrete uniform distribution]], interpreting the arithmetic progression as a set of equally probable outcomes.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)