Carl Friedrich Gauss
There is a famous story about arithmetic series dating back to the late 1700s. The story is about a boy named Carl Friedrich Gauss and something he did when he was in primary school.

Source: Gauss - johan10/iStock/Getty Images
The name Gauss may be familiar to you, as he grew to become a famous mathematician, so famous that centuries later, tens of thousands of Grades 7 and 8 students write a math contest every year called the Gauss Contest.

Source: The Centre for Education in Mathematics and Computing (2017). Gauss Contest Grade 8. Retrieved from: https://cemc.uwaterloo.ca/contests/past_contests/2017/2017Gauss8Contest.pdf
So what happened to Gauss in primary school? Well, as the story goes, when Gauss was around Grade 2 or 3, his teacher wanted to keep his students busy for a while. So the teacher told the class to add all the integers from \(1\) to \(100\). But according to the story, almost immediately, Gauss had the answer, \(5050\).
Gauss and \(1+2+3+\cdots+100\)
So how did Gauss quickly add all the integers from \(1\) to \(100\)?
\(1+2+3+\cdots+98+99+100=~?\)
Well, he rearranged the terms of the sum into pairs. He decided to pair together \(1\) and \(100\), \(2\) and \(99\), \(3\) and \(98\), and so on until the two middle terms, \(50\) and \(51\), were paired together.
\( 1+2+3+\cdots+98+99+100 = (1+100)+(2+99)+(3+98)+\cdots+(50+51) \)
Notice that every number from \(1\) to \(100\) has been paired together, and this happens because there are an even number of terms in the sum that Gauss had to calculate. If there were an odd number of terms, the middle term would not have a pair, and Gauss would have needed to account for that.
Now by pairing this way, what Gauss recognized was that each pair has a sum of \(101\). Since there are \(50\) pairs, we get
\(\begin{align*} 1+2+3+\cdots+98+99+100 &= (1+100)+(2+99)+(3+98)+\cdots+(50+51) \\ &= 101+101+101+\cdots+101 \\ & = 50(101) \\ &= 5050 \end{align*}\)
Now, Gauss went on to become one of the most important mathematicians of all time, making contributions to the world of mathematics, physics, astronomy, and other mathematical sciences.
We can tweak Gauss's method slightly to avoid the complication introduced when there are an odd number of terms in the sum. This next variation works for any number of terms.
A slightly different approach:
First, we write the sum that is to be calculated and we'll call the sum \(S\).
\( S\; =\;\;\;\;1+\;\;\;2+\;\;\;3+\cdots+\;\;98+\;\;99+100 \tag{1} \)
We again use the idea of pairing numbers together so that each pair has the same sum. But this time, let's do it by writing \(S\) again, but with the terms in reverse order.
\( S\; = 100+\;\;99+\;98+\cdots+\;\;\;\;3+\;\;\;2+\;\;\;\;1 \tag{2} \)
Next, we can add these two equations together. We get Equation \((1)\) \(+\) Equation \((2)\):
\(\begin{align*} S\; & =\;\;\;\;1+\;\;\;2+\;\;\;3+\cdots+\;\;98+\;\;99+100 \tag{1} \\ S\;& = 100+\;\;99+\;98+\cdots+\;\;\;\;3+\;\;\;2+\;\;\;\;1 \tag{2} \\ \hline \;2S\;&=101+101+101+\cdots+101+101+101 \tag{1)+(2} \end{align*}\)
On the left side, we get \(2S\). And on the right side, each pair of terms has sum \(101\). Since there are \(100\) terms, we get that \(2S=100(101) = 10~100\).
But as the left side says, this is double the sum that we want. That's because we wrote the initial sum twice. So we divide both sides by \(2\). Putting this all together, we get that
\(\begin{align*} S\; & =\;\;\;\;1+\;\;\;2+\;\;\;3+\cdots+\;\;98+\;\;99+100 \tag{1} \\ S\;& = 100+\;\;99+\;98+\cdots+\;\;\;\;3+\;\;\;2+\;\;\;\;1 \tag{2} \\ \hline \;2S\;&=101+101+101+\cdots+101+101+101 \tag{1)+(2}\\ 2S\;&=100(101)\\ 2S\; &= 10~100\\ S\; & = 5050 \end{align*}\)
Gauss Extended to \(1+2+3+\cdots+n\)
We can generalize this to find the sum of not just the first \(100\) positive integers, but the first \(n\) positive integers, that is \(1+2+3+\cdots+n\).
As before we write our sum, and notice that since the last term is \(n\), the second last term is \(n-1\), and the third last term is \(n-2\). Then we write the sum again, this time in reverse order.
\(\begin{align*} S\;&=\;\;\;\;\;\;\;\;\;\;1+\;\;\;\;\;\;\;\;\;\;2+\;\;\;\;\;\;\;\;\;3+\cdots+(n-2)+(n-1)+\;\;\;\;\;\;\; n \tag{1}\\ S\;&\;= \;\;\;\;\;\;\;\;\;n+(n-1)+(n-2)+\cdots+\;\;\;\;\;\;\;\;\;\;3+\;\;\;\;\;\;\;\;\;2+\;\;\;\;\;\;1 \tag{2} \end{align*}\)
We add these two equations. We get Equation \((1)\) \(+\) Equation \((2)\):
\(\begin{align*} S\;&=\;\;\;\;\;\;\;\;\;\;1+\;\;\;\;\;\;\;\;\;\;2+\;\;\;\;\;\;\;\;\;3+\cdots+(n-2)+(n-1)+\;\;\;\;\;\;\; n \tag{1}\\ S\;&\;= \;\;\;\;\;\;\;\;\;n+(n-1)+(n-2)+\cdots+\;\;\;\;\;\;\;\;\;\;3+\;\;\;\;\;\;\;\;\;2+\;\;\;\;\;\;1 \tag{2} \\ \hline \;2S\;&=\;\;(n+1)+(n+1)+(n+1)+\cdots+(n+1)+(n+1)+(n+1) \tag{1)+(2} \end{align*}\)
On the left side we get \(2S\). On the right side, we get that the first pair has sum \(n+1\), and the second pair also has sum \(n+1\), since \(2+(n-1)=n+1\). Likewise, the third pair is \(n+1\). In fact, every pair has sum \(n+1\).
Now the right side has \(n\) terms, where each term is \(n+1\). So the right side is \(n(n+1)\). We need to divide both sides by \(2\). Putting this all together, we get that
\(\begin{align*} S\;&=\;\;\;\;\;\;\;\;\;\;1+\;\;\;\;\;\;\;\;\;\;2+\;\;\;\;\;\;\;\;\;3+\cdots+(n-2)+(n-1)+\;\;\;\;\;\;\; n \tag{1}\\ S\;&\;= \;\;\;\;\;\;\;\;\;n+(n-1)+(n-2)+\cdots+\;\;\;\;\;\;\;\;\;\;3+\;\;\;\;\;\;\;\;\;2+\;\;\;\;\;\;1 \tag{2} \\ \hline \;2S\;&=\;\;(n+1)+(n+1)+(n+1)+\cdots+(n+1)+(n+1)+(n+1) \tag{1)+(2}\\ 2S\;&\;=n(n+1)\\ S\; & \;=\dfrac{n(n+1)}2 \end{align*}\)
Thus, we have get the following:
The sum of the first \(n\) positive integers, \(1+2+3+\cdots+n\), is equal to \(\dfrac{n(n+1)}2\).
Gauss Extended to Any Arithmetic Series
We can further generalize Gauss's approach to any arithmetic series.
Recall
An arithmetic sequence is a sequence in which each term after the first term is obtained by adding a constant \(d\) to the previous term.
So a general arithmetic sequence is the ordered list
\(a,~a+d,~a+2d,\ldots\)
Since a series is just the sum of the terms of a sequence, this sequence corresponds to this general arithmetic series, where the commas have been replaced by addition signs:
\(a+(a+d) + (a+2d) + \cdots\)
We can also write that the sum of the first \(n\) terms, \(S_n\), is
\(S_n=a+(a+d) + (a+2d) + \cdots+[a+(n-1)d]\)
Notice that the sum that Gauss needed to calculate is
The sum \(1+2+3+\cdots+100\) is the sum of the arithmetic series with \(a=1\) since the first term is \(1\), \(d=1\) since the common difference is \(1\), and \(n=100\) since there are \(100\) terms in the series.
So let's apply Gauss's modified method to the general arithmetic series to determine a formula for the sum of the first \(n\) terms of an arithmetic series.
We first write the sum of the first \(n\) terms starting at the first term, \(a\). Next, we write the terms in reverse order.
\(\begin{align*} S_n& \;=\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;a+\;\;\;\;\;\;\;\;\;\;\;\;(a+d)+\cdots+[a+(n-1)d] \tag{1}\\ S_n& \;=\;\;\;[a+(n-1)d]+\;\;[a+(n-2)d]+\cdots+\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;a \tag{2} \end{align*}\)
Take a look for a moment at the second term in the reverse order sequence, \([a+(n-2)d]\). This term has one less \(d\) than the previous term and \((n-2)d\)'s instead of \((n-1)d\).
Then, as before, we add these two equations together. We get Equation \((1)\) \(+\) Equation \((2)\):
\(\begin{align*} S_n& \;=\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;a+\;\;\;\;\;\;\;\;\;\;\;\;(a+d)+\cdots+[a+(n-1)d] \tag{1}\\ S_n& \;=\;\;\;[a+(n-1)d]+\;\;[a+(n-2)d]+\cdots+\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;a \tag{2} \\ \hline 2S_n&=\;[2a+(n-1)d]+[2a+(n-1)d]+\cdots+[2a+(n-1)d] \tag{1)+(2} \end{align*}\)
The left side is \(2S\), and on the right side, the first term has \(2a\)'s and \((n-1)d\)'s. The second term is going to be the sum of \(a+d\) and \(a + (n-2)d\). So it also has has \(2a\)'s and \((n-1)d\)'s, since \(d+(n-2)d= (n-1)d\).
This ends up being the case for all of the terms. There are \(n\) of these terms. Since each is the same, we have that \(2S_n=n[2a+(n-1)d]\). We can divide both sides by \(2\). Putting this all together, we get
\(\begin{align*} S_n& \;=\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;a+\;\;\;\;\;\;\;\;\;\;\;\;(a+d)+\cdots+[a+(n-1)d] \tag{1}\\ S_n& \;=\;\;\;[a+(n-1)d]+\;\;[a+(n-2)d]+\cdots+\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;a \tag{2} \\ \hline 2S_n&=\;[2a+(n-1)d]+[2a+(n-1)d]+\cdots+[2a+(n-1)d] \tag{1)+(2}\\ 2S_n&\;=n[2a+(n-1)d]\\ S_n &\;= \dfrac{n[2a+(n-1)d]}2 \\ S_n &\;= \dfrac{n}2[2a+(n-1)d] \end{align*}\)
Thus, we have get the following:
The sum of the first \(n\) terms of an arithmetic series with first term \(a \) and common difference \(d\) is \(S_n=\dfrac{n}2[2a+(n-1)d]\).