The result you cite is true for the infinite series:
To find the partial sum, we may write (using partial fraction decomposition):
Can you simplify this by observing all but two terms cancel each other out and observe what happens as ?
The result you cite is true for the infinite series:
To find the partial sum, we may write (using partial fraction decomposition):
Can you simplify this by observing all but two terms cancel each other out and observe what happens as ?
Oh yeah.
Btw, that problem is just a part of my long solution for this main problem:
Find the sum of <tex>sqrt(1+\frac{1}{1^2}+\frac{1}{2^2})+sqrt(1+\f rac{1}{2^2}+\frac{1}{3^2})+sqrt(1+\frac{1}{3^2}+\f rac{1}{4^2})+...+sqrt(1+\frac{1}{1999^2}+\frac{1}{ 2000^2})</tex>.
I aproached this main problem by observing the simplified form of each first 5 terms and I thought that the sum is just equal to the number of terms to the aforementioned series. But now that you mentioned that solution, then maybe there's another or perhaps general solution for this problem without using logic or any patterns.
I know that the series above can be expressed as the sum of <tex>1+\frac{1}{k^2}+\frac{1}{(k+1)^2}</tex> with n=1 to n=1999.
But how can I show this? Please help.
Thank you so muchhhhhh.
But here's my last question. How can I show that k^2*(k+1)^2+k^2+(k+1)^2 is equal to (k^2+k+1)^2. I know that the former one is equal to k^4+2k^3+3k^2+2k+1 but i can't seem to factor it to form the latter.
Here is the technique I used:
After expanding and collecting like terms, the numerator becomes:
Now, we wish to see if it may be factored as the square of a quadratic, and we know what the leading and trailing terms must be, so we may write:
Expanding the right side, we find:
This implies that , and so we have:
Hence: