This problem is a reprise of problem 6 with 1.001 replaced by 1.000001

Compute an approximation to which gives the area under for , using a modified Riemann sum with the (NOT equally spaced) partition and left hand endpoints EXCEPT neglecting the area of the last rectangle. Here denotes the largest possible power which fits in the interval .

Please note that the problem is NOT asking for the value of . Rather it is asking for the EXACT values of the areas of approximating rectangles and for the EXACT value of the sum of the areas of the rectangles. Calculator approximations (no matter how accurate) will NOT be accepted. Do the calculations by hand using fractions (until you notice the pattern in the areas).

The number of approximating rectangles is:
=
The area of the first rectangle =
The area of the second rectangle =
The area of the third rectangle =
The sum of the areas of the rectangles =

The ingenious idea of using these unusual nonequally spaced partitions to compute the area under thus relating it to Napier's logarithms is due to a Belgian monk, Gregory St. Vincent around 1647.

You can earn partial credit on this problem.