Zarkon last one!
I can already feel my brain shutting down ;)
mine shutdown like 3 hours ago
Part A's easy
yes...i get 65/24
1+1+1/2+1/6+1/24
YAY :D
part b looks like induction
part b is definitely induction ... this property could be used to show that 2<e<3
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
Prof Zarkon I need your inputs on another problem, i have pinged you from the relevant thread. Please do check it :)
btw for part c the upper bound is \( 3\).
ty guys, i can die a peaceful death now, knowing that 9.3 is finally done...
when (exactly) are you going to die? :P
not any time soon, hopefully.
Join our real-time social learning platform and learn together with your friends!