| Alternating Sum |
Article Index for Alternating |
Articles about Alternating Series |
Website Links For Alternating |
Information AboutAlternating Sum |
| CATEGORIES ABOUT ALTERNATING SERIES | |
| calculus | |
| mathematical series | |
|
: with ''an'' ≥ 0. A finite sum of this kind is an alternating sum. A ''sufficient'' condition for the : diverges, while the alternating version : converges to the Natural Logarithm of 2. A broader test for convergence of an alternating series is ''Leibniz' test'': if the sequence is monotone decreasing and tends to zero, then the series : converges. The Partial Sum : can be used to approximate the sum of a convergent alternating series. If is monotone decreasing and tends to zero, then the error in this approximation is less than . A conditionally convergent series is an infinite series that converges, but does not converge absolutely. The following non-intuitive result is true: if the ''real'' series : converges conditionally, then for every real number there is a ''reordering'' of the series such that : As an example of this, consider the series above for the natural logarithm of 2: : One possible reordering for this series is as follows (the only purpose of the brackets in the first line is to help clarity): : : : : A proof of this assertion runs along the lines: the Greedy Algorithm for σ is Correct . SEE ALSO |
|
|