Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (bahrom7893):

Zarkon last one!

OpenStudy (zarkon):

I can already feel my brain shutting down ;)

OpenStudy (bahrom7893):

mine shutdown like 3 hours ago

OpenStudy (bahrom7893):

Part A's easy

OpenStudy (zarkon):

yes...i get 65/24

OpenStudy (bahrom7893):

1+1+1/2+1/6+1/24

OpenStudy (anonymous):

YAY :D

OpenStudy (zarkon):

part b looks like induction

OpenStudy (anonymous):

part b is definitely induction ... this property could be used to show that 2<e<3

OpenStudy (zarkon):

for n=1 we have 1/1!=1 and 1/2^(1-1)=1/1=1 \(1\le 1\) so the basis step holds assume \[\frac{1}{k!}\le\frac{1}{2^{k-1}}\] is true for some \(k\) then \[\frac{1}{(k+1)!}=\frac{1}{k!}\frac{1}{k+1}\le\frac{1}{2^{k-1}}\frac{1}{k+1}\] since \(\frac{1}{2}\ge\frac{1}{n+1}\) for \(n\ge1\) we have \[\frac{1}{2^{k-1}}\frac{1}{k+1}\le\frac{1}{2^{k-1}}\frac{1}{2}=\frac{1}{2^{k}}\] QED

OpenStudy (anonymous):

Prof Zarkon I need your inputs on another problem, i have pinged you from the relevant thread. Please do check it :)

OpenStudy (anonymous):

btw for part c the upper bound is \( 3\).

OpenStudy (bahrom7893):

ty guys, i can die a peaceful death now, knowing that 9.3 is finally done...

OpenStudy (anonymous):

when (exactly) are you going to die? :P

OpenStudy (bahrom7893):

not any time soon, hopefully.

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!