I tested the OP's claim about the 7,000th term being within 0.0001 of the infinite sum, which happens to converge to
ln4.
The
7,000th partial sum is approx. 1.386151514, whereas
ln4≈1.386294361, so the error is approx. 0.000142847. Unfortunately, this is still
>0.0001
The
20,000th partial sum is approx. 1.386244362, and the error is approx. 0.00004999875, which is
<0.0001. Like topsquark said, the error formula is only an upper bound, but fewer terms could be enough to get within 0.0001. It looks like the
10,000th partial sum is finally within 0.0001. Sorry, 9,999.
To make sure things are clear, all this is irrelevant to the question as actually
intended, though it is
stated in a somewhat misleading way. (I only know what was intended by knowing typical problems of this sort, and the vicinity of their answer.)
They asked how many terms are
needed, but as we've seen, far fewer than 20,000 terms are really
necessary to make the sum be closer than 0.0001.
On the other hand, they didn't ask about
making the actual sum that close, but about
estimating it that accurately. And they imply that they are talking about
using the particular theorem they have just taught to decide how many terms to use; there may well be a different theorem or method.
So in terms of the question itself (as opposed to understanding how series actually work), it makes no difference what number of terms
actually produces such an accurate sum. They intend to ask,
how many terms does the theorem require you to use in your estimate.
Turning now to the OP:
Determine how many terms are needed to estimate the sum of the series to within 0.0001.
This is the exact wording.
That's what I expected. It didn't sound like you paraphrased the problem, but I wanted to be sure. What I said above does apply.
Thanks for this information.
OK. I will show you two examples as well as our original post. The two examples will be within
0.01.
∑n=1∞(−1)n+1n34
∣S−Sn∣≤an+1=(n+1)34≤0.01
If
n=7,
a8=834≈0.007813≤0.01
And the book says,
7 terms are needed to estimate the sum within
0.01
It's interesting that they don't show how they actually found this number; they just show the
check. (They could have done the same check with a number greater than 7, and it would work; they haven't shown that 7 is the [minimum] number
needed (according to the theorem, much less by actual summation).
Presumably, they solved the inequality
(n+1)34≤0.01. This becomes
4≤0.01(n+1)3, so that
400≤(n+1)3, and then
n+1≥4001/3>7. Therefore the smallest value of n is 7.
In any case, yes, you did just what they did.
My suspicion is that they (explicitly or implicitly) used a "less than", and solved
n+12<0.0001, for which the smallest integer solution is 20,000, because 19,999 makes it
exactly equal. One way or another, this seems to have thrown them off.
But it didn't trick
you.