Work through the odd-numbered problems 1-61. Once you have completed the problem set, check your answers.
In problems 1 – 5 , rewrite the sigma notation as a summation and perform the indicated addition.
In problems 7 – 11, rewrite each summation using the sigma notation. Do not evaluate the sums.
In problems 13 – 15 , use the values of and in Table 3 and verify that the value in part (a) does equal the value in part (b).
For problems 15 – 17 , use the values of and in Table 3 and verify that the value in part (a) does not equal the value in part (b).
For problems 19 – 29, , and . Evaluate each sum.
For problems 31 – 35 , write out each summation and simplify the result. These are examples of "telescoping sums"
For problems 37– 43 , (i) list the subintervals determined by the partition , (ii) find the values of , (iii) find the mesh of P, and (iv) calculate .
43. For , verify that = length of the interval [a, b].
For problems 45 – 47 , (i) sketch the graph of f on the given interval, (ii) draw vertical lines at each point of the given partition, (iii) evaluate each f(ci) and sketch the corresponding rectangle, and (iv) calculate and add together the areas of the rectangles.
For problems 49 – 51 , sketch the function and find the smallest possible value and the largest possible value for a Riemann sum of the given function and partition.
Upper and Lower Sum Problems
53. Suppose and for a positive function f and a partition P of the interval [ 1, 5]. We can be certain that every Riemann sum for the partition P is within what distance of the exact value of the area between the graph of and the interval ? (b) What if and ?
55. If we divide the interval into 50 equally wide subintervals and calculate a Riemann sum for by "randomly" selecting a point in each subinterval (any point in the subinterval), then we can be certain that the Riemann sum is within what distance of the exact value of the area between f and the interval ?
Summing Powers of Consecutive Integers
Explicit formulas for some commonly encountered summations are known and are useful for explicitly evaluating some Riemann sums and their limits. The formulas below are included here for your reference. They will not be used or needed in the following sections. The summation formula for the first n positive integers is relatively well–known, has several easy but clever proofs, and even has an interesting story.
Proof: Let represent the sum . Rearranging the summands, we also know . Adding these 2 representations of together,
It is said that Gauss discovered this formula for himself at the age of 5. His teacher, planning on keeping the class busy for a while, asked the students to add the integers from 1 to 100. Gauss thought a few minutes, wrote his answer on his slate, and turned it in. According to the story, he then sat smugly while his classmates struggled with the problem.
57. Find the sum of the first 100 positive integers in 2 ways: (1) using Gauss' formula, and (2) using Gauss' method.
59. Find the sum of the integers from 10 to 20.
Formulas for other integer powers of the first n integers have been discovered:
In problem 61, use the properties of summation and the formulas for powers to evaluate each sum
Source: Dale Hoffman, https://s3.amazonaws.com/saylordotorg-resources/wwwresources/site/wp-content/uploads/2012/12/MA005-5.2-Sigma-Notation-and-Riemann-Sums.pdf
This work is licensed under a Creative Commons Attribution 3.0 License.