How accurate would an approximation by one of the partial sums be?
This shows that the greatest error we have in approximating e by the nth partial sum is
Now 10 x 10! is over 30 million, so the estimate that we get with just the tenth partial sum is already accurate to within 1 part in 30 million. When we calculate the partial sum we find:
Since the total error is less than 0.000001, we can be confident that all the digits (except possibly the last one) are accurate. Thus gives us an estremely accurate estimate of e. This is much better than we shall do for Pi!
Now we turn to the problem of estimating Pi. We shall use
the fact that Pi/2 is the first positive zero of cos(x).

To make the result, rigorous, one can verify by by looking at the graph (which was drawn by Maple), or by direct calculation (using a pocket calculator, or even by hand) that x_1=1.3 and x_2=1.7 satisfy the appropriate inequalities. We summarize these reults in a proposition:
The problem is with the lower bound. The argument for the lower bound involved the fact that our polynomial was decreasing. This won't be so easy to see when we add in more terms. In fact, it will only be locally decreasing, and even that would be very hard to prove. We will see other ways of sharpening our estimate for Pi later -- for the moment this rough estimate must serve.