Processing math: 30%
Rational Solver
+1 vote
438 views

in Real Analysis by Professor | 438 views

1 Answer

+1 vote
Best answer

Let us first note that for n=2m,m>1 we have

bn=12nk=3(1)k1k

and for n=2m1,m>1 we have

bn=nk=3(1)k1k

It follows that lim. So option1 is not correct.

Now note that 

\left(\frac{1}{3}+\frac{1}{5}+\cdots+\frac{1}{2m-1}\right)-\left(\frac{1}{4}+\frac 16+\cdots+\frac{1}{2m}\right)>\left(\frac 13-\frac 14\right)

\left(\frac{1}{3}+\frac{1}{5}+\cdots+\frac{1}{2m-1}\right)-\left(\frac{1}{4}+\frac 16+\cdots+\frac{1}{2m-2}\right)>0

It follows that for m>1 we have b_{2m-1}>0\quad \text{and}\quad b_{2m}>\frac 12+k,\qquad \text{for some } k>0

It follows that \limsup b_n\geq \frac 12. Thus Option 2 is a correct choice. 

As \limsup b_n\geq \frac 12, the option 4 is also not correct. To argue option 3 is not correct, note that  \{b_n\} is a sequence of nonnegative number and so \liminf b_n\geq  0.

by Professor
Welcome to Rational Solver, where you can ask questions and receive answers from other members of the community.
76 questions
33 answers
2 comments
1,801 users