Telescoping series

Telescoping series

In mathematics, a telescoping series is an informal expression referring to a series whose sum can be found by exploiting the circumstance that nearly every term cancels with either a succeeding or preceding term. Such a technique is also known as the method of differences.

For example, the series

:sum_{n=1}^infty frac{1}{n(n+1)}

simplifies as

:egin{align}sum_{n=1}^infty frac{1}{n(n+1)} & {} = sum_{n=1}^infty left( frac{1}{n} - frac{1}{n+1} ight) \& {} = left(1 - frac{1}{2} ight) + left(frac{1}{2} - frac{1}{3} ight) + cdots \& {} = 1 + left(- frac{1}{2} + frac{1}{2} ight)+ left( - frac{1}{3} + frac{1}{3} ight) + cdots = 1.end{align}

A pitfall

Although telescoping can be a useful technique, there are pitfalls to watch out for:

:0 = sum_{n=1}^infty 0 = sum_{n=1}^infty (1-1) = 1 + sum_{n=1}^infty (-1 + 1) = 1,

is not correct because regrouping of terms is invalid unless the individual terms converge to 0; see Grandi's series. The way to avoid this error is to find the sum of the first "N" terms first and "then" take the limit as "N" approaches infinity:

:egin{align}sum_{n=1}^N frac{1}{n(n+1)} & {} = sum_{n=1}^N left( frac{1}{n} - frac{1}{n+1} ight) \& {} = left(1 - frac{1}{2} ight) + left(frac{1}{2} - frac{1}{3} ight) + cdots + left(frac{1}{N} -frac{1}{N+1} ight) \& {} = 1 + left(- frac{1}{2} + frac{1}{2} ight)+ left( - frac{1}{3} + frac{1}{3} ight) + cdots+ left(-frac{1}{N} + frac{1}{N} ight) - frac{1}{N+1} \& {} = 1 - frac{1}{N+1} o 1 mathrm{as} N oinfty.end{align}

More examples

* Many trigonometric functions also admit representation as a difference, which allows telescopic cancelling between the consequent terms.

::egin{align}sum_{n=1}^N sinleft(n ight) & {} = sum_{n=1}^N frac{1}{2} cscleft(frac{1}{2} ight) left(2sinleft(frac{1}{2} ight)sinleft(n ight) ight) \& {} =frac{1}{2} cscleft(frac{1}{2} ight) sum_{n=1}^N left(cosleft(frac{2n-1}{2} ight) -cosleft(frac{2n+1}{2} ight) ight) \& {} =frac{1}{2} cscleft(frac{1}{2} ight) left(cosleft(frac{1}{2} ight) -cosleft(frac{2N+1}{2} ight) ight).end{align}

* Some sums of the form

::sum_{n=1}^N {f(n) over g(n)},

:where "f" and "g" are polynomial functions whose quotient may be broken up into partial fractions, will fail to admit summation by this method. In particular, we have

::egin{align}sum^infty_{n=0}frac{2n+3}{(n+1)(n+2)} & {} =sum^infty_{n=0}left(frac{1}{n+1}+frac{1}{n+2} ight) \& {} = left(frac{1}{1} + frac{1}{2} ight) + left(frac{1}{2} + frac{1}{3} ight) + left(frac{1}{3} + frac{1}{4} ight) + cdots \& {} cdots + left(frac{1}{n-1} + frac{1}{n} ight) + left(frac{1}{n} + frac{1}{n+1} ight) + left(frac{1}{n+1} + frac{1}{n+2} ight) + cdots \& {} =infty.end{align}

:The problem is that the terms do not cancel.

* Let "k" be a positive integer. Then

::sum^infty_{n=1} {frac{1}{n(n+k) = frac{H_k}{k}

:where "H""k" is the "k"th harmonic number. All of the terms after 1/("k" − 1) cancel.

An application in probability theory

In probability theory, a Poisson process is a stochastic process of which the simplest case involves "occurrences" at random times, the waiting time until the next occurrence having a memoryless exponential distribution, and the number of "occurrences" in any time interval having a Poisson distribution whose expected value is proportional to the length of the time interval. Let "X""t" be the number of "occurrences" before time "t", and let "T""x" be the waiting time until the "x"th "occurrence". We seek the probability density function of the random variable "T""x". We use the probability mass function for the Poisson distribution, which tells us that

: Pr(X_t = x) = frac{(lambda t)^x e^{-lambda t{x!},

where λ is the average number of occurrences in any time interval of length 1. Observe that the event ["X""t" ≥ x] is the same as the event ["T""x" ≤ "t"] , and thus they have the same probability. The density function we seek is therefore

: egin{align}f(t) & {} = frac{d}{dt}Pr(T_x le t) = frac{d}{dt}Pr(X_t ge x) = frac{d}{dt}(1 - Pr(X_t le x-1)) \ \& {} = frac{d}{dt}left( 1 - sum_{u=0}^{x-1} Pr(X_t = u ight)= frac{d}{dt}left( 1 - sum_{u=0}^{x-1} frac{(lambda t)^u e^{-lambda t{u!} ight) \ \& {} = lambda e^{-lambda t} - e^{-lambda t} sum_{u=1}^{x-1} left( frac{lambda^ut^{u-1{(u-1)!} - frac{lambda^{u+1} t^u}{u!} ight)end{align}

The sum telescopes, leaving

: f(t) = frac{lambda^x t^{x-1} e^{-lambda t{x!}.

Other applications

For other applications, see:

* Grandi's series;
* Proof that the sum of the reciprocals of the primes diverges, where one of the proofs uses a telescoping sum;
* Order statistic, where a telescoping sum occurs in the derivation of a probability density function;
* Lefschetz fixed-point theorem, where a telescoping sum arises in algebraic topology;
* Homology theory, again in algebraic topology;
* Eilenberg–Mazur swindle, where a telescoping sum of knots occurs.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Series (mathematics) — A series is the sum of the terms of a sequence. Finite sequences and series have defined first and last terms, whereas infinite sequences and series continue indefinitely.[1] In mathematics, given an infinite sequence of numbers { an } …   Wikipedia

  • Telescoping bolt — External view of Uzi and MP40 submachineguns, both 9mm submachineguns with a 10 (250mm) barrel, showing size advantage that telescoping mechanism allows …   Wikipedia

  • Grandi's series — The infinite series 1 − 1 + 1 − 1 + hellip;or:sum {n=0}^{infin} ( 1)^nis sometimes called Grandi s series, after Italian mathematician, philosopher, and priest Guido Grandi, who gave a memorable treatment of the series in 1703. It is a divergent… …   Wikipedia

  • Abbey Series — Infobox Book name = The Abbey Girls title orig = translator = image caption = Pictorial boards from the first edition, (1920), of the book which gave its name to the whole series author = Elsie J. Oxenham illustrator = Arthur A. Dixon cover… …   Wikipedia

  • Honda CX series — Infobox Motorcycle name = CX series aka = manufacturer = Honda parent company = production = 1978–1983 predecessor = successor = GL500 Silverwing, ST series (influenced) class = engine = 500–673 cc water cooled longitudinal OHV 80° V twin, 4… …   Wikipedia

  • Honda CR series — Road Race Bikes= Off Road BikesThe CR series Yann pomerleau suceis the Honda company s line of off road, two stroke, motocross motorcycles. Honda has always been ahead of the curve with this line, having pioneered the aluminum frame in 1997. 2006 …   Wikipedia

  • List of real analysis topics — This is a list of articles that are considered real analysis topics. Contents 1 General topics 1.1 Limits 1.2 Sequences and Series 1.2.1 Summation Methods …   Wikipedia

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie …   Wikipedia

  • Outline of combinatorics — See also: Index of combinatorics articles The following outline is presented as an overview of and topical guide to combinatorics: Combinatorics – branch of mathematics concerning the study of finite or countable discrete structures. Contents 1… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”