Solve 42-48 using ''the sandwich theorem'' @JamesJ @satellite73 and others please
i get -6
but i am also going to bet this is not the question
I want to discuss those examples 42-48 if you have time...and if you can see the examples :D
42, I would start like this...
1/sqrt(n^2+1)>1/sqrt(n^2+2)>.....>1/sqrt(n^2+2n)
Hence the sum is bounded by \[ \frac{n}{\sqrt{n^2+1}} > S > \frac{n}{\sqrt{n^2+n}} \] and the limit of both of those is the same.
great, that's what I was going to ask, how do you know that the right term in the denominator is exactly n?
that's a little bit confusing for me in next examples? 1 2 3 and then it finishes with 2n?
ok being a bonehead i cannot deal with infinity first, so to see what is going on i used n = 5 and then maybe it will be clear. you get \[\frac{1}{\sqrt{26}}+\frac{1}{\sqrt{27}}+...+\frac{1}{\sqrt{35}}\] now i can see how to get an upper bound and lower bound
OK
in this case i see that the upper bound is \[\frac{1}{\sqrt{26}}+ ...+\frac{1}{\sqrt{26}}=\frac{5}{\sqrt{26}}\] and similarly the lower bound will be \[\frac{5}{\sqrt{35}}\]
how did you get that 5?
i took five terms all to be the largest
because in the nth expression there are n terms in that expression.
lol except i got largest and smallest backward !!
sorry, couldn't log in
me too, some conection problems
ok well i hope this clears up question 42 jamesj wrote is succinctly
how about example 45?
In other words, consider the nth expression, call it S_n 1/sqrt(n^2 + 1) + 1/sqrt(n^2 + 2) + ...... + 1/sqrt(n^2 + n) there are n terms here. ... oh, ok, you've got it?
yes, I see 1 2 3 ....n so there are n terms
but how would I know the number of terms in ex 45: sorry if I'm boring...:D
#45 looks ill defined to me.
In other words, it is not clear what the terms are.
i guess you keep adding until you get to \[11n^2\]?
hmmm that's the thing that confuses me a lot...
in other examples too, I don't get how can I count the terms...? :(
oh ok. There's 11n^2 of them
not very clear, but i guess it is 1, 2, 3 , ... , n^2 n^2+1, ..., 2n^2 ... 10n^2+1,..., 11n^2 making a total of \[11n^2\] terms
can you somehow explain that to me James, how come 11n^2 when the number are 1,2,3...
you start with 1, you end with 11n^2 so there are 11n^2 terms
what sat73 said. Try it for n = 2 and you'll see the 22 terms
try it with n = 3
if you can't sleep tonight, try it for n = 17
tonight, tomorrow night, ...
haha :D can you be so kind and tell me the number of terms for all other examples...I 'll buy you something :D
does that mean that you will multiply with 11n^2?
for example for number 43, you start with 2 and end with 6n try it with n = 5 and see how many terms you get 2,4,6,8,10,12,...,30 you will see there are 15 terms
where did the 15 come from? \[\frac{6\times 5}{2}\]
I think I get it...
continue please with the rest...:D
so in general were will be for number 43, 3n terms
so I make the lower and the upper bound, and then multiply with the number of terms, that's how I'll make a ''sendwich'' I assume? :D
want to try 44?
yes, that is the idea for all of these i think
for 44, if I take n=3 I get 16 for n=4 I get 25 for n=5 I get 36...so the number of terms is actually n^2+2n+1?
hmm that is not what i got take for example n =5
start with 25,26, 27 , ... , 36 so there are 36 - 25 = 11 terms
you are not starting at 1, you are starting an n^2
OMG I see that...lol :D
for that one since you are starting at n^2 and ending at (n+1)^2 i think there are \[(n+1)^2-n^2=2n+1\] terms
the last one please and I'm done I promise :D
Join our real-time social learning platform and learn together with your friends!