|
1 + 2 + 3 + 4 + . . . + 100 = ?
An old story says Gauss found the sum of the above problem, and at the same time developed a formula, in less than a few minutes when he was a young student. |
Arithmetic Series
The objective of this section is to find a formula for calculating the sum of the first n terms of any arithmetic sequence. As will be shown, the method we are using today was developed by the mathematician Carl F. Gauss (1777 – 1855) when he was a young student. According to an old story, one day Gauss and his classmates were asked to find the sum of these first hundred counting numbers. All the other students in the class began by adding two numbers at a time, starting from the first term. This is a natural reaction. Also, it is a valid approach, although it is not the most efficient method, as will be seen. But Gauss found a quicker way. First, he wrote the sum twice, one in an ordinary order and the other in a reverse order:
100 + 99 + . . . + 4 + 3 + 2 + 1 By adding vertically, each pair of numbers adds up to 101:
Since there are 100 of these sums of 101, the total is 100
Using Gauss´ approach, we can find the formula for the sum of the first n terms of an arithmetic sequence having first term a1 and a common difference c, as follows: |
| Sn |
= a1 + a2 + a3 + . . . + an
= a1 + (a1 + c) + (a1 + 2c) + . . . + [a1 + (n-1)c]
|
| Also, Sn |
= an + . . . + a3 + a2 + a1
= [a1 + (n-1)c] + . . . + (a1 + 2c) + (a1 + c) + a1
|
| Therefore, 2Sn |
= (a1 + a2 + a3 + . . . + an)
+ (an + . . . + a3 + a2 + a1) = [2a1 + (n-1)c] + . . . + [2a1 + (n-1)c] = n [2a1 + (n-1)c]
|
| Sn |
= n [2a1 + (n-1)c] / 2
= n [a1 + a1 + (n-1)c] / 2 = n [a1 + an] / 2 |
|
Generally, we use the Greek letter
in which it is understood that k is to be replaced by each of the numbers 1, 2, 3, 4, and 5 in the expression 2k, and then the sum of the resulting values is to be indicated. |
|
When k = 1,
k = 2, k = 3, k = 4, k = 6, |
2k = 2
2k = 4 2k = 6 2k = 8 2k = 10 |
|
Using this new notation, we have:
or
|