This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I dont understand why this solution has so much more upvotes than the next ones when they are practically the same.
Log in to reply
It was... a day early lol...
Log in to reply
Getting pulled back into a comment I made 1 year earlier... :P
LOL! :P
People are too lazy to scroll down. I am a teen so I don't fall into the "people" category! :P
What about the last term da!!
Can you please explain the last step??
This is a very good solution, very clear, thanks!
i dont understand in 2n=d step how to come 1 over n +1
Log in to reply
The technique is called "Partial Fraction Decomposition". It is often used in integrating rational functions and can be found in the index of most modern calculus texts (or of course google). For this particular case (textbooks typically present the entire topic in terms of 4 cases) you would set up as follows:
( n + 1 ) ( n + 2 ) 1 = n + 1 A + n + 2 B
Now mult both sides by the LCD, yielding:
1 = A(n+2) + B(n+1)
Now to find A substitute n = -1 & solve. Similarly, to find B sub in n = -2 & solve. Note, these subsitutions are the zeros of the factors of the LCD. These two steps yield:
A = 1 & B = -1
Thus: ( n + 1 ) ( n + 2 ) 1 = n + 1 1 − n + 2 1
Log in to reply
You can also use hide and seek method instead .
Log in to reply
@Syed Baqir – Yes, the hide and seek (or cover up) method is quicker with less writting, but often harder for someone to understand why it works. So for understanding purposes it's best to show the longer method (of multy both side by the LCD) and then later show the hide and seek method as a more efficient method.
I just loved it.. :)
Very elegantly done!
Log in to reply
Not really, taking the limit is more elegant than adding two diverging series.
You may use \infty for typing infinity in latex. I have edited your solution.
S = N → ∞ lim n = 1 ∑ N n 2 + 3 n + 2 1 = N → ∞ lim n = 1 ∑ N ( n + 1 ) ( n + 2 ) 1 = N → ∞ lim n = 1 ∑ N n + 1 1 − n + 2 1 = N → ∞ lim 2 1 − N + 2 1 = 2 1
Can you explain me the last line?
Log in to reply
In response to Mayank Kunwar: The limit of 1/(N+2) as N approaches to infinity is zero; that is, as N gets bigger and bigger, 1/(N+2) approaches to zero. Thus, 1/2 - 0 = 1/2.
Its actually the same solution like the first one... but another way to write it... Look at first solution, all terms cancel out except for first and last one... since first term=1/2 and last term=1/N+2, the last line is written as such.
The only difference here really is that he took the limit for the last term... (Please correct me if wrong, i'm obviously a noob to math.)
why we can do limit in this particular question?
Log in to reply
To be on the safer side, I like to take the limit. This problem isn't very tough to handle but others could be. For example, in the above solution, n = 1 ∑ ∞ n + 1 1 is diverging and n = 1 ∑ ∞ n + 2 1 is also diverging. I don't like to play with diverging series that way.
Can you explain me how can you transform 1/((n+1)(n+2)) into 1/(n+1)-1/(n+2)? I can't see it.
n = 1 ∑ ∞ n 2 + 3 n + 2 1 = n = 1 ∑ ∞ ( n + 1 1 − n + 2 1 ) 2 1 − 3 1 + 3 1 − 4 1 + 4 1 + ⋯ We observe that all the terms after 2 1 cancel out so the answer is 2 1
Never mind but when same solution is there, you don't need to post it again!
Log in to reply
@Pranjal Jain Most of the solutions are the same.
Log in to reply
Yeah, all of them need not be posted. Although its fine.
We note that:
n = 1 ∑ ∞ n 2 + 3 n + 2 1 = n = 1 ∑ ∞ ( n + 1 ) ( n + 2 ) 1 = n = 1 ∑ ∞ ( n + 1 1 − n + 2 1 ) = ( 2 1 − 3 1 ) + ( 3 1 − 4 1 ) + ( 4 1 − 5 1 ) + . . . = 2 1
A different approach...
n = 1 ∑ ∞ n 2 + 3 n + 2 1 = n = 1 ∑ ∞ ( n + 1 ) ( n + 2 ) 1 = n = 2 ∑ ∞ n ( n + 1 ) 1 = = n = 1 ∑ ∞ n ( n + 1 ) 1 − n = 1 ∑ 1 n ( n + 1 ) 1 = 1 − 2 1 = 2 1
By the way, I got n = 1 ∑ ∞ n ( n + 1 ) 1 = 1 from the Brilliant Telescoping Series material that was linked on the problem description.
n = 1 ∑ ∞ n 2 + 3 n + 2 1 = ( n + 1 ) ( n + 2 ) 1 = n + 1 1 − n + 2 1
Then, when we add all the terms together, the 2nd and 1st terms will cancel, leaving
2 1 − ∞ + 1 1 = 2 1
I did It with vn method (nice method read about it people)
Problem Loading...
Note Loading...
Set Loading...
n 2 + 3 n + 2 1 = n + 1 1 − n + 2 1
now for n = 1,2,3,4,.......
∑ n = 1 ∞ n + 1 1 = 2 1 + 3 1 + 4 1 + . . . . . .
similarly,
∑ n = 1 ∞ n + 2 1 = 3 1 + 4 1 + 5 1 + . . . . . .
therefore,
∑ n = 1 ∞ n 2 + 3 n + 2 1 = ∑ n = 1 ∞ n + 1 1 − ∑ n = 1 ∞ n + 2 1 = 2 1