Proving convergence of sequence with fraction sums [closed]












0














How do I prove convergence of this sequence (or prove that it doesn't exist)?



$$a_n=frac1{4+log 1}+frac1{4^2+log 2}+frac1{4^3+log 3}+ldots+frac1{4^n+log n}$$










share|cite|improve this question















closed as off-topic by T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber Nov 30 '18 at 3:03


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber

If this question can be reworded to fit the rules in the help center, please edit the question.













  • The sequence is bounded and monotone increasing therefore it is convergent.
    – MotylaNogaTomkaMazura
    Nov 29 '18 at 21:06
















0














How do I prove convergence of this sequence (or prove that it doesn't exist)?



$$a_n=frac1{4+log 1}+frac1{4^2+log 2}+frac1{4^3+log 3}+ldots+frac1{4^n+log n}$$










share|cite|improve this question















closed as off-topic by T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber Nov 30 '18 at 3:03


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber

If this question can be reworded to fit the rules in the help center, please edit the question.













  • The sequence is bounded and monotone increasing therefore it is convergent.
    – MotylaNogaTomkaMazura
    Nov 29 '18 at 21:06














0












0








0







How do I prove convergence of this sequence (or prove that it doesn't exist)?



$$a_n=frac1{4+log 1}+frac1{4^2+log 2}+frac1{4^3+log 3}+ldots+frac1{4^n+log n}$$










share|cite|improve this question















How do I prove convergence of this sequence (or prove that it doesn't exist)?



$$a_n=frac1{4+log 1}+frac1{4^2+log 2}+frac1{4^3+log 3}+ldots+frac1{4^n+log n}$$







sequences-and-series






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 29 '18 at 21:06









gimusi

1




1










asked Nov 29 '18 at 21:00









sydsyd

52




52




closed as off-topic by T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber Nov 30 '18 at 3:03


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber

If this question can be reworded to fit the rules in the help center, please edit the question.




closed as off-topic by T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber Nov 30 '18 at 3:03


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – T. Bongers, Scientifica, KReiser, Paul Plummer, Alexander Gruber

If this question can be reworded to fit the rules in the help center, please edit the question.












  • The sequence is bounded and monotone increasing therefore it is convergent.
    – MotylaNogaTomkaMazura
    Nov 29 '18 at 21:06


















  • The sequence is bounded and monotone increasing therefore it is convergent.
    – MotylaNogaTomkaMazura
    Nov 29 '18 at 21:06
















The sequence is bounded and monotone increasing therefore it is convergent.
– MotylaNogaTomkaMazura
Nov 29 '18 at 21:06




The sequence is bounded and monotone increasing therefore it is convergent.
– MotylaNogaTomkaMazura
Nov 29 '18 at 21:06










2 Answers
2






active

oldest

votes


















2














HINT



We have that



$$left(frac1{4^n+log n}right)sim frac1{4^n}$$






share|cite|improve this answer





























    -1














    Your sequence is increasing :



    $$a_{n+1}-a_n=frac{1}{4^{n+1}+ln(n+1)}>0.$$



    on the other hand,



    $$a_n=sum_{k=1}^nfrac{1}{4^k+ln(k)}le sum_{k=1}^nfrac{1}{4^k}$$



    $$implies a_nle frac 14frac{1-frac{1}{4^n}}{1-frac 14}$$



    $$implies a_nle frac 13$$
    Hence, it is convergent.






    share|cite|improve this answer























    • Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
      – syd
      Nov 29 '18 at 21:24










    • @syd Yes, we compare with something we know.
      – hamam_Abdallah
      Nov 29 '18 at 21:26


















    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    2














    HINT



    We have that



    $$left(frac1{4^n+log n}right)sim frac1{4^n}$$






    share|cite|improve this answer


























      2














      HINT



      We have that



      $$left(frac1{4^n+log n}right)sim frac1{4^n}$$






      share|cite|improve this answer
























        2












        2








        2






        HINT



        We have that



        $$left(frac1{4^n+log n}right)sim frac1{4^n}$$






        share|cite|improve this answer












        HINT



        We have that



        $$left(frac1{4^n+log n}right)sim frac1{4^n}$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 29 '18 at 21:05









        gimusigimusi

        1




        1























            -1














            Your sequence is increasing :



            $$a_{n+1}-a_n=frac{1}{4^{n+1}+ln(n+1)}>0.$$



            on the other hand,



            $$a_n=sum_{k=1}^nfrac{1}{4^k+ln(k)}le sum_{k=1}^nfrac{1}{4^k}$$



            $$implies a_nle frac 14frac{1-frac{1}{4^n}}{1-frac 14}$$



            $$implies a_nle frac 13$$
            Hence, it is convergent.






            share|cite|improve this answer























            • Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
              – syd
              Nov 29 '18 at 21:24










            • @syd Yes, we compare with something we know.
              – hamam_Abdallah
              Nov 29 '18 at 21:26
















            -1














            Your sequence is increasing :



            $$a_{n+1}-a_n=frac{1}{4^{n+1}+ln(n+1)}>0.$$



            on the other hand,



            $$a_n=sum_{k=1}^nfrac{1}{4^k+ln(k)}le sum_{k=1}^nfrac{1}{4^k}$$



            $$implies a_nle frac 14frac{1-frac{1}{4^n}}{1-frac 14}$$



            $$implies a_nle frac 13$$
            Hence, it is convergent.






            share|cite|improve this answer























            • Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
              – syd
              Nov 29 '18 at 21:24










            • @syd Yes, we compare with something we know.
              – hamam_Abdallah
              Nov 29 '18 at 21:26














            -1












            -1








            -1






            Your sequence is increasing :



            $$a_{n+1}-a_n=frac{1}{4^{n+1}+ln(n+1)}>0.$$



            on the other hand,



            $$a_n=sum_{k=1}^nfrac{1}{4^k+ln(k)}le sum_{k=1}^nfrac{1}{4^k}$$



            $$implies a_nle frac 14frac{1-frac{1}{4^n}}{1-frac 14}$$



            $$implies a_nle frac 13$$
            Hence, it is convergent.






            share|cite|improve this answer














            Your sequence is increasing :



            $$a_{n+1}-a_n=frac{1}{4^{n+1}+ln(n+1)}>0.$$



            on the other hand,



            $$a_n=sum_{k=1}^nfrac{1}{4^k+ln(k)}le sum_{k=1}^nfrac{1}{4^k}$$



            $$implies a_nle frac 14frac{1-frac{1}{4^n}}{1-frac 14}$$



            $$implies a_nle frac 13$$
            Hence, it is convergent.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Nov 30 '18 at 13:07

























            answered Nov 29 '18 at 21:11









            hamam_Abdallahhamam_Abdallah

            38k21634




            38k21634












            • Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
              – syd
              Nov 29 '18 at 21:24










            • @syd Yes, we compare with something we know.
              – hamam_Abdallah
              Nov 29 '18 at 21:26


















            • Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
              – syd
              Nov 29 '18 at 21:24










            • @syd Yes, we compare with something we know.
              – hamam_Abdallah
              Nov 29 '18 at 21:26
















            Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
            – syd
            Nov 29 '18 at 21:24




            Thank you very much! So we're comparing it with a geometrical series which sum we know and then it must be smaller than that. It's that the approach we usually take when we deal with sequences given with sums of fractions?
            – syd
            Nov 29 '18 at 21:24












            @syd Yes, we compare with something we know.
            – hamam_Abdallah
            Nov 29 '18 at 21:26




            @syd Yes, we compare with something we know.
            – hamam_Abdallah
            Nov 29 '18 at 21:26



            Popular posts from this blog

            Bundesstraße 106

            Verónica Boquete

            Ida-Boy-Ed-Garten