drawar
- 130
- 0
Homework Statement
Let a_{n} be an alternating series whose terms are decreasing in magnitude. How to compute the sum as precisely as possible using four-digit chopping arithmetic? In particular, apply the method to compute \sum\limits_{n = 0}^\infty {\frac{{{{( - 1)}^n}}}{{(2n)!}}} and specify how the term \frac{{{{( - 1)}^n}}}{{(2n)!}} is obtained.Here is an excerpt from my textbook regarding the definition of finite digit chopping arithmetic:
Any positive real number y can be written in decimal floating point form: y=0.{d_1}{d_2}{d_3}...{d_k}{d_{k + 1}}{d_{k + 2}}... \times {10^n} where each digit d_{k} satises 0 \leq d_{k} \leq 9 and d_{1} \neq 0. To put y to a k-digit decimal floating point number, the first method is chopping (a.k.a. rounding towards 0 or truncation): fl(y)=0.{d_1}{d_2}{d_3}...{d_k} \times {10^n}
Here, fl(y) denotes the floating form of y.
Homework Equations
The Attempt at a Solution
I was told that calculating by nesting is more precise than calculating term by term, but how to calculate the sum of a series going to infinity? Any hint given is much appreciated, thanks!
Last edited: