Let $langle a_nrangle$ be a sequence where $a_n = sumlimits_j=1^n(-1)^j2/n$ thenLet $(a_n)$ be a sequence of real numbers. Suppose each of the subsequences $(a_2n),(a_2n+1)$ and $(a_3n)$ converges to $p,q$ and $r$If $prodlimits_n(1+a_n)$ converges, does $sumlimits_nfraca_n1+a_n$ converge?Let $a_n rightarrow 0$. Show $sumlimits_n=0^infty (a_n - a_n+1) = a_0$.If $langlea_nrangle$ is convergent with limit l, how would I show that $langler_nrangle$ also converges?Convergence of infinite series for $sum a_n $ and $sum b_n$Let $a_n$ be a sequence of real numbers. which one of the following is always true?If a sequence diverges to infinity then so do all its subsequences. Then why does the sum for $frac1n$ diverge but not $frac1n^2$?Series with $sum a_n$ converges but $sum n a_n^2$ diverges, and $a_n$ is decreasingConvergence of $sumlimits_n=1^inftya_n$ implies convergence of $sumlimits_n=1^inftya_n^sigma_n$ where $sigma_n=fracnn+1$?$a_n$ is an infinite sequence with $sumlimits_n=1^infty a_nleq1$ and $0leq a_n<1$. Prove that $sumlimits_n=1^infty a_n/(a_n-1)$ converges?

Does convergence of polynomials imply that of its coefficients?

The English Debate

Does fire aspect on a sword, destroy mob drops?

Hot air balloons as primitive bombers

Can other pieces capture a threatening piece and prevent a checkmate?

How do you justify more code being written by following clean code practices?

Why does Surtur say that Thor is Asgard's doom?

How to find the largest number(s) in a list of elements, possibly non-unique?

Unfrosted light bulb

Exposing a company lying about themselves in a tightly knit industry: Is my career at risk on the long run?

Does the Shadow Magic sorcerer's Eyes of the Dark feature work on all Darkness spells or just his/her own?

Would mining huge amounts of resources on the Moon change its orbit?

Do people actually use the word "kaputt" in conversation?

What are the rules for concealing thieves' tools (or items in general)?

What will the Frenchman say?

What is the tangent at a sharp point on a curve?

What is it called when someone votes for an option that's not their first choice?

Would this string work as string?

Was World War I a war of liberals against authoritarians?

Can "few" be used as a subject? If so, what is the rule?

Is "inadequate referencing" a euphemism for plagiarism?

Air travel with refrigerated insulin

Why doesn't the chatan sign the ketubah?

Is there any common country to visit for uk and schengen visa?



Let $langle a_nrangle$ be a sequence where $a_n = sumlimits_j=1^n(-1)^j2/n$ then


Let $(a_n)$ be a sequence of real numbers. Suppose each of the subsequences $(a_2n),(a_2n+1)$ and $(a_3n)$ converges to $p,q$ and $r$If $prodlimits_n(1+a_n)$ converges, does $sumlimits_nfraca_n1+a_n$ converge?Let $a_n rightarrow 0$. Show $sumlimits_n=0^infty (a_n - a_n+1) = a_0$.If $langlea_nrangle$ is convergent with limit l, how would I show that $langler_nrangle$ also converges?Convergence of infinite series for $sum a_n $ and $sum b_n$Let $a_n$ be a sequence of real numbers. which one of the following is always true?If a sequence diverges to infinity then so do all its subsequences. Then why does the sum for $frac1n$ diverge but not $frac1n^2$?Series with $sum a_n$ converges but $sum n a_n^2$ diverges, and $a_n$ is decreasingConvergence of $sumlimits_n=1^inftya_n$ implies convergence of $sumlimits_n=1^inftya_n^sigma_n$ where $sigma_n=fracnn+1$?$a_n$ is an infinite sequence with $sumlimits_n=1^infty a_nleq1$ and $0leq a_n<1$. Prove that $sumlimits_n=1^infty a_n/(a_n-1)$ converges?













1












$begingroup$



Let $langle a_nrangle$ be a sequence where $a_n = sumlimits_j=1^n(-1)^j2/n$



  1. is oscillatory


  2. diverges to $+infty$


  3. diverges to $-infty$


  4. converges to $0$




I think by taking subsequences $langle a_2nrangle =(2/n) +(2/n) +ldots +(2/n)$ ($n$-times) $= 2$ and $langle a_2n-1rangle = -2/n -2/n -ldots -2/n$ ($n$-times) $=-2$ which is cunverging to $2$ and $-2$ respectively. So that the sequence is oscillatory. I have doubt taking this type of subsequence is right or wrong.










share|cite|improve this question











$endgroup$
















    1












    $begingroup$



    Let $langle a_nrangle$ be a sequence where $a_n = sumlimits_j=1^n(-1)^j2/n$



    1. is oscillatory


    2. diverges to $+infty$


    3. diverges to $-infty$


    4. converges to $0$




    I think by taking subsequences $langle a_2nrangle =(2/n) +(2/n) +ldots +(2/n)$ ($n$-times) $= 2$ and $langle a_2n-1rangle = -2/n -2/n -ldots -2/n$ ($n$-times) $=-2$ which is cunverging to $2$ and $-2$ respectively. So that the sequence is oscillatory. I have doubt taking this type of subsequence is right or wrong.










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$



      Let $langle a_nrangle$ be a sequence where $a_n = sumlimits_j=1^n(-1)^j2/n$



      1. is oscillatory


      2. diverges to $+infty$


      3. diverges to $-infty$


      4. converges to $0$




      I think by taking subsequences $langle a_2nrangle =(2/n) +(2/n) +ldots +(2/n)$ ($n$-times) $= 2$ and $langle a_2n-1rangle = -2/n -2/n -ldots -2/n$ ($n$-times) $=-2$ which is cunverging to $2$ and $-2$ respectively. So that the sequence is oscillatory. I have doubt taking this type of subsequence is right or wrong.










      share|cite|improve this question











      $endgroup$





      Let $langle a_nrangle$ be a sequence where $a_n = sumlimits_j=1^n(-1)^j2/n$



      1. is oscillatory


      2. diverges to $+infty$


      3. diverges to $-infty$


      4. converges to $0$




      I think by taking subsequences $langle a_2nrangle =(2/n) +(2/n) +ldots +(2/n)$ ($n$-times) $= 2$ and $langle a_2n-1rangle = -2/n -2/n -ldots -2/n$ ($n$-times) $=-2$ which is cunverging to $2$ and $-2$ respectively. So that the sequence is oscillatory. I have doubt taking this type of subsequence is right or wrong.







      real-analysis sequences-and-series






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 13 at 10:18









      rtybase

      11.5k31534




      11.5k31534










      asked Mar 13 at 8:37









      800123800123

      73




      73




















          4 Answers
          4






          active

          oldest

          votes


















          1












          $begingroup$

          The correct answer is 4). Write down the sums $sumlimits_k=1^n (-1)^k$ and convince yourself that these are bounded. So if you multiply these by $frac 2n $ and let $n to infty$ you get $0$.






          share|cite|improve this answer









          $endgroup$




















            1












            $begingroup$

            We have $a_n=frac2nsum_j=1^n(-1)^j=frac1n cdot (1-(-1)^n+1)$ and



            $|a_n| le 2/n.$ for all $n$



            Can you proceed ?






            share|cite|improve this answer











            $endgroup$












            • $begingroup$
              this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
              $endgroup$
              – 800123
              Mar 13 at 11:04


















            0












            $begingroup$

            1)$a_n= (-2/n)$, $n$ is odd.



            2) $a_n=0$, $n$ is even.



            1')$lim_ k rightarrow infty a_2k+1 =0$, $k=0,1,2,..;$



            2')$ lim_l rightarrow infty a_2l=0, l=1,2,3,...;$



            Lemma:



            The $2$ subsequences $a_2l, a_2k+1$,



            $l=1,2,..,$ $k=0,1,2,..,$



            converge to $0$, hence $a_n$ converges to $0$.



            Can you prove the Lemma?






            share|cite|improve this answer









            $endgroup$




















              0












              $begingroup$

              $$a_n = sumlimits_j=1^n(-1)^j2/n\to a_2k=0\,\a_2k+1=-2over 2k+1$$then this sequence oscillatorily converges to 0.






              share|cite|improve this answer









              $endgroup$












                Your Answer





                StackExchange.ifUsing("editor", function ()
                return StackExchange.using("mathjaxEditing", function ()
                StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
                StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
                );
                );
                , "mathjax-editing");

                StackExchange.ready(function()
                var channelOptions =
                tags: "".split(" "),
                id: "69"
                ;
                initTagRenderer("".split(" "), "".split(" "), channelOptions);

                StackExchange.using("externalEditor", function()
                // Have to fire editor after snippets, if snippets enabled
                if (StackExchange.settings.snippets.snippetsEnabled)
                StackExchange.using("snippets", function()
                createEditor();
                );

                else
                createEditor();

                );

                function createEditor()
                StackExchange.prepareEditor(
                heartbeatType: 'answer',
                autoActivateHeartbeat: false,
                convertImagesToLinks: true,
                noModals: true,
                showLowRepImageUploadWarning: true,
                reputationToPostImages: 10,
                bindNavPrevention: true,
                postfix: "",
                imageUploader:
                brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
                contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
                allowUrls: true
                ,
                noCode: true, onDemand: true,
                discardSelector: ".discard-answer"
                ,immediatelyShowMarkdownHelp:true
                );



                );













                draft saved

                draft discarded


















                StackExchange.ready(
                function ()
                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146277%2flet-langle-a-n-rangle-be-a-sequence-where-a-n-sum-limits-j-1n-1j%23new-answer', 'question_page');

                );

                Post as a guest















                Required, but never shown

























                4 Answers
                4






                active

                oldest

                votes








                4 Answers
                4






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                1












                $begingroup$

                The correct answer is 4). Write down the sums $sumlimits_k=1^n (-1)^k$ and convince yourself that these are bounded. So if you multiply these by $frac 2n $ and let $n to infty$ you get $0$.






                share|cite|improve this answer









                $endgroup$

















                  1












                  $begingroup$

                  The correct answer is 4). Write down the sums $sumlimits_k=1^n (-1)^k$ and convince yourself that these are bounded. So if you multiply these by $frac 2n $ and let $n to infty$ you get $0$.






                  share|cite|improve this answer









                  $endgroup$















                    1












                    1








                    1





                    $begingroup$

                    The correct answer is 4). Write down the sums $sumlimits_k=1^n (-1)^k$ and convince yourself that these are bounded. So if you multiply these by $frac 2n $ and let $n to infty$ you get $0$.






                    share|cite|improve this answer









                    $endgroup$



                    The correct answer is 4). Write down the sums $sumlimits_k=1^n (-1)^k$ and convince yourself that these are bounded. So if you multiply these by $frac 2n $ and let $n to infty$ you get $0$.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Mar 13 at 8:42









                    Kavi Rama MurthyKavi Rama Murthy

                    68.1k53068




                    68.1k53068





















                        1












                        $begingroup$

                        We have $a_n=frac2nsum_j=1^n(-1)^j=frac1n cdot (1-(-1)^n+1)$ and



                        $|a_n| le 2/n.$ for all $n$



                        Can you proceed ?






                        share|cite|improve this answer











                        $endgroup$












                        • $begingroup$
                          this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
                          $endgroup$
                          – 800123
                          Mar 13 at 11:04















                        1












                        $begingroup$

                        We have $a_n=frac2nsum_j=1^n(-1)^j=frac1n cdot (1-(-1)^n+1)$ and



                        $|a_n| le 2/n.$ for all $n$



                        Can you proceed ?






                        share|cite|improve this answer











                        $endgroup$












                        • $begingroup$
                          this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
                          $endgroup$
                          – 800123
                          Mar 13 at 11:04













                        1












                        1








                        1





                        $begingroup$

                        We have $a_n=frac2nsum_j=1^n(-1)^j=frac1n cdot (1-(-1)^n+1)$ and



                        $|a_n| le 2/n.$ for all $n$



                        Can you proceed ?






                        share|cite|improve this answer











                        $endgroup$



                        We have $a_n=frac2nsum_j=1^n(-1)^j=frac1n cdot (1-(-1)^n+1)$ and



                        $|a_n| le 2/n.$ for all $n$



                        Can you proceed ?







                        share|cite|improve this answer














                        share|cite|improve this answer



                        share|cite|improve this answer








                        edited Mar 13 at 9:11

























                        answered Mar 13 at 8:43









                        FredFred

                        48.5k1849




                        48.5k1849











                        • $begingroup$
                          this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
                          $endgroup$
                          – 800123
                          Mar 13 at 11:04
















                        • $begingroup$
                          this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
                          $endgroup$
                          – 800123
                          Mar 13 at 11:04















                        $begingroup$
                        this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
                        $endgroup$
                        – 800123
                        Mar 13 at 11:04




                        $begingroup$
                        this means $-2/nleq a_nleq2/n$ then by sandwitch theorem $<a_n> converges to 0
                        $endgroup$
                        – 800123
                        Mar 13 at 11:04











                        0












                        $begingroup$

                        1)$a_n= (-2/n)$, $n$ is odd.



                        2) $a_n=0$, $n$ is even.



                        1')$lim_ k rightarrow infty a_2k+1 =0$, $k=0,1,2,..;$



                        2')$ lim_l rightarrow infty a_2l=0, l=1,2,3,...;$



                        Lemma:



                        The $2$ subsequences $a_2l, a_2k+1$,



                        $l=1,2,..,$ $k=0,1,2,..,$



                        converge to $0$, hence $a_n$ converges to $0$.



                        Can you prove the Lemma?






                        share|cite|improve this answer









                        $endgroup$

















                          0












                          $begingroup$

                          1)$a_n= (-2/n)$, $n$ is odd.



                          2) $a_n=0$, $n$ is even.



                          1')$lim_ k rightarrow infty a_2k+1 =0$, $k=0,1,2,..;$



                          2')$ lim_l rightarrow infty a_2l=0, l=1,2,3,...;$



                          Lemma:



                          The $2$ subsequences $a_2l, a_2k+1$,



                          $l=1,2,..,$ $k=0,1,2,..,$



                          converge to $0$, hence $a_n$ converges to $0$.



                          Can you prove the Lemma?






                          share|cite|improve this answer









                          $endgroup$















                            0












                            0








                            0





                            $begingroup$

                            1)$a_n= (-2/n)$, $n$ is odd.



                            2) $a_n=0$, $n$ is even.



                            1')$lim_ k rightarrow infty a_2k+1 =0$, $k=0,1,2,..;$



                            2')$ lim_l rightarrow infty a_2l=0, l=1,2,3,...;$



                            Lemma:



                            The $2$ subsequences $a_2l, a_2k+1$,



                            $l=1,2,..,$ $k=0,1,2,..,$



                            converge to $0$, hence $a_n$ converges to $0$.



                            Can you prove the Lemma?






                            share|cite|improve this answer









                            $endgroup$



                            1)$a_n= (-2/n)$, $n$ is odd.



                            2) $a_n=0$, $n$ is even.



                            1')$lim_ k rightarrow infty a_2k+1 =0$, $k=0,1,2,..;$



                            2')$ lim_l rightarrow infty a_2l=0, l=1,2,3,...;$



                            Lemma:



                            The $2$ subsequences $a_2l, a_2k+1$,



                            $l=1,2,..,$ $k=0,1,2,..,$



                            converge to $0$, hence $a_n$ converges to $0$.



                            Can you prove the Lemma?







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Mar 13 at 9:02









                            Peter SzilasPeter Szilas

                            11.6k2822




                            11.6k2822





















                                0












                                $begingroup$

                                $$a_n = sumlimits_j=1^n(-1)^j2/n\to a_2k=0\,\a_2k+1=-2over 2k+1$$then this sequence oscillatorily converges to 0.






                                share|cite|improve this answer









                                $endgroup$

















                                  0












                                  $begingroup$

                                  $$a_n = sumlimits_j=1^n(-1)^j2/n\to a_2k=0\,\a_2k+1=-2over 2k+1$$then this sequence oscillatorily converges to 0.






                                  share|cite|improve this answer









                                  $endgroup$















                                    0












                                    0








                                    0





                                    $begingroup$

                                    $$a_n = sumlimits_j=1^n(-1)^j2/n\to a_2k=0\,\a_2k+1=-2over 2k+1$$then this sequence oscillatorily converges to 0.






                                    share|cite|improve this answer









                                    $endgroup$



                                    $$a_n = sumlimits_j=1^n(-1)^j2/n\to a_2k=0\,\a_2k+1=-2over 2k+1$$then this sequence oscillatorily converges to 0.







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered Mar 13 at 11:58









                                    Mostafa AyazMostafa Ayaz

                                    16.5k3939




                                    16.5k3939



























                                        draft saved

                                        draft discarded
















































                                        Thanks for contributing an answer to Mathematics Stack Exchange!


                                        • Please be sure to answer the question. Provide details and share your research!

                                        But avoid


                                        • Asking for help, clarification, or responding to other answers.

                                        • Making statements based on opinion; back them up with references or personal experience.

                                        Use MathJax to format equations. MathJax reference.


                                        To learn more, see our tips on writing great answers.




                                        draft saved


                                        draft discarded














                                        StackExchange.ready(
                                        function ()
                                        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146277%2flet-langle-a-n-rangle-be-a-sequence-where-a-n-sum-limits-j-1n-1j%23new-answer', 'question_page');

                                        );

                                        Post as a guest















                                        Required, but never shown





















































                                        Required, but never shown














                                        Required, but never shown












                                        Required, but never shown







                                        Required, but never shown

































                                        Required, but never shown














                                        Required, but never shown












                                        Required, but never shown







                                        Required, but never shown







                                        Popular posts from this blog

                                        How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

                                        random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

                                        Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye