Ask your own question, for FREE!
Computer Science 16 Online
OpenStudy (anonymous):

Prove that the following sum is telescoping. SEE BELOW

OpenStudy (anonymous):

\[\sum_{j=1}^{n}(a _{j}-a _{j-1})=a _{n}-a _{0}\]

OpenStudy (anonymous):

I am just supposed to show that that equality is true where a0, a1...an is a sequence of real numbers

OpenStudy (e.mccormick):

Might want to try in math, rather than computer science. =) Also, have you looked into a proof of the sigma sums? You might be able to use it as a template.

OpenStudy (anonymous):

So you're given that the equality holds, and asked to show it's telescoping, rather than the typical case of using the fact that it's telescoping to establish the equality?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!