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.
Nice solution :) Also, if you want to format an arrow you write: \rightarrow\ in the brackets, and \displaystyle\sum_{r=1}^{n} produces a sum that looks different
This solution seems incorrect to me. I have seen this question elsewhere and the solution involves the use of sandwich theorem (which is quite wonderful).
Log in to reply
I guess you mean this solution.
Let n and r be positive integers. Then
n + r > 0
n 2 + n + r > n 2
n 2 + n + r r < n 2 r
Also,
r < n + 1
n 2 + n + r < n 2 + 2 n + 1 = ( n + 1 ) 2
( n + 1 ) 2 r < n 2 + n + r r
( n + 1 ) 2 r < n 2 + n + r r < n 2 r
Hence,
r = 1 ∑ n ( n + 1 ) 2 r < r = 1 ∑ n n 2 + n + r r < r = 1 ∑ n n 2 r
2 ( n + 1 ) n < S < 2 n n + 1
And so, at the limit
2 1 − < S < 2 1 +
Or S = 2 1
r = 1 ∑ n n 2 + n + r r = r = 1 ∑ n r n 2 + r n + 1 1 = r = 1 ∑ n r n + 1 + n 1 1 n 1
∫ 0 1 x d x = n → ∞ lim r = 1 ∑ n n + 2 r n 1 ≤ n → ∞ lim r = 1 ∑ n r n + 1 + n 1 1 n 1 ≤ n → ∞ lim r = 1 ∑ n r n + 1 1 n 1 = ∫ 0 1 x d x
∫ 0 1 x d x = 2 1
Problem Loading...
Note Loading...
Set Loading...
If n approach to infinity the denominator will be n 2 ,so,it's become the same in all terms.
hence we have
l i m n − > ∞ Σ r = 1 n n 2 + n + r r = l i m n − > ∞ Σ r = 1 n n 2 r = n 2 n ( n + 1 ) / 2 = 2 1