Find a sequence ${a_n}$ such that both $sum {a_n}$ and $sum{frac{1}{n^2 a_n}}$ converge.












2












$begingroup$



Find a sequence ${a_n}$ such that both $sum_1^infty {a_n}$ and
$sum_1^infty {frac{1}{n^2 a_n}}$ converge. If no such sequence
exists, prove that.




Actually the question was for $sum_1^infty {n{a_n}}$ and $sum_1^infty {frac{1}{n^2 a_n}}$. For this problem; If we suppose that both are convergent, then their multiply $sum_1^infty 1/n$ must be convergent and this is a contradiction.



But for $sum_1^infty {a_n}$ and $sum_1^infty {frac{1}{n^2 a_n}}$, if we multiply we get $sum_1^infty 1/n^2$ which is convergent. I tried to find a sequence such that both the series converge but I couldn't find any but also I couldn't prove that there is no such sequence exists.



Edit. $a_n >0$






sequences-and-series convergence







share|cite|improve this question











$endgroup$












  • $begingroup$
    I think that $a_n>0$ should be a condition to make the question really interesting
    $endgroup$
    – ajotatxe
    Jan 7 at 21:08










  • $begingroup$
    @ajotatxe yes. The book I found the first question, said at the first of the series chapter, that for all questions, consider $a_n>0$ and I forgot to mention that.
    $endgroup$
    – amir na
    Jan 7 at 21:23












  • $begingroup$
    With the condition $a_n > 0$ it is a duplicate of math.stackexchange.com/q/1933001/42969.
    $endgroup$
    – Martin R
    Jan 7 at 21:31










  • $begingroup$
    If $a_n>0$, by Cauchy-Schwarz $$sum_{n=1}^{N}a_nsum_{n=1}^{N}frac{1}{n^2 a_n}geq H_N^2geq log^2(N).$$
    $endgroup$
    – Jack D'Aurizio
    Jan 7 at 21:34


















2












$begingroup$



Find a sequence ${a_n}$ such that both $sum_1^infty {a_n}$ and
$sum_1^infty {frac{1}{n^2 a_n}}$ converge. If no such sequence
exists, prove that.




Actually the question was for $sum_1^infty {n{a_n}}$ and $sum_1^infty {frac{1}{n^2 a_n}}$. For this problem; If we suppose that both are convergent, then their multiply $sum_1^infty 1/n$ must be convergent and this is a contradiction.



But for $sum_1^infty {a_n}$ and $sum_1^infty {frac{1}{n^2 a_n}}$, if we multiply we get $sum_1^infty 1/n^2$ which is convergent. I tried to find a sequence such that both the series converge but I couldn't find any but also I couldn't prove that there is no such sequence exists.



Edit. $a_n >0$






sequences-and-series convergence







share|cite|improve this question











$endgroup$












  • $begingroup$
    I think that $a_n>0$ should be a condition to make the question really interesting
    $endgroup$
    – ajotatxe
    Jan 7 at 21:08










  • $begingroup$
    @ajotatxe yes. The book I found the first question, said at the first of the series chapter, that for all questions, consider $a_n>0$ and I forgot to mention that.
    $endgroup$
    – amir na
    Jan 7 at 21:23












  • $begingroup$
    With the condition $a_n > 0$ it is a duplicate of math.stackexchange.com/q/1933001/42969.
    $endgroup$
    – Martin R
    Jan 7 at 21:31










  • $begingroup$
    If $a_n>0$, by Cauchy-Schwarz $$sum_{n=1}^{N}a_nsum_{n=1}^{N}frac{1}{n^2 a_n}geq H_N^2geq log^2(N).$$
    $endgroup$
    – Jack D'Aurizio
    Jan 7 at 21:34
















2












2








2





$begingroup$



Find a sequence ${a_n}$ such that both $sum_1^infty {a_n}$ and
$sum_1^infty {frac{1}{n^2 a_n}}$ converge. If no such sequence
exists, prove that.




Actually the question was for $sum_1^infty {n{a_n}}$ and $sum_1^infty {frac{1}{n^2 a_n}}$. For this problem; If we suppose that both are convergent, then their multiply $sum_1^infty 1/n$ must be convergent and this is a contradiction.



But for $sum_1^infty {a_n}$ and $sum_1^infty {frac{1}{n^2 a_n}}$, if we multiply we get $sum_1^infty 1/n^2$ which is convergent. I tried to find a sequence such that both the series converge but I couldn't find any but also I couldn't prove that there is no such sequence exists.



Edit. $a_n >0$






sequences-and-series convergence







share|cite|improve this question











$endgroup$





Find a sequence ${a_n}$ such that both $sum_1^infty {a_n}$ and
$sum_1^infty {frac{1}{n^2 a_n}}$ converge. If no such sequence
exists, prove that.




Actually the question was for $sum_1^infty {n{a_n}}$ and $sum_1^infty {frac{1}{n^2 a_n}}$. For this problem; If we suppose that both are convergent, then their multiply $sum_1^infty 1/n$ must be convergent and this is a contradiction.



But for $sum_1^infty {a_n}$ and $sum_1^infty {frac{1}{n^2 a_n}}$, if we multiply we get $sum_1^infty 1/n^2$ which is convergent. I tried to find a sequence such that both the series converge but I couldn't find any but also I couldn't prove that there is no such sequence exists.



Edit. $a_n >0$






sequences-and-series convergence




sequences-and-series convergence






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 7 at 21:23







amir na

















asked Jan 7 at 21:01









amir naamir na

1657




1657












  • $begingroup$
    I think that $a_n>0$ should be a condition to make the question really interesting
    $endgroup$
    – ajotatxe
    Jan 7 at 21:08










  • $begingroup$
    @ajotatxe yes. The book I found the first question, said at the first of the series chapter, that for all questions, consider $a_n>0$ and I forgot to mention that.
    $endgroup$
    – amir na
    Jan 7 at 21:23












  • $begingroup$
    With the condition $a_n > 0$ it is a duplicate of math.stackexchange.com/q/1933001/42969.
    $endgroup$
    – Martin R
    Jan 7 at 21:31










  • $begingroup$
    If $a_n>0$, by Cauchy-Schwarz $$sum_{n=1}^{N}a_nsum_{n=1}^{N}frac{1}{n^2 a_n}geq H_N^2geq log^2(N).$$
    $endgroup$
    – Jack D'Aurizio
    Jan 7 at 21:34




















  • $begingroup$
    I think that $a_n>0$ should be a condition to make the question really interesting
    $endgroup$
    – ajotatxe
    Jan 7 at 21:08










  • $begingroup$
    @ajotatxe yes. The book I found the first question, said at the first of the series chapter, that for all questions, consider $a_n>0$ and I forgot to mention that.
    $endgroup$
    – amir na
    Jan 7 at 21:23












  • $begingroup$
    With the condition $a_n > 0$ it is a duplicate of math.stackexchange.com/q/1933001/42969.
    $endgroup$
    – Martin R
    Jan 7 at 21:31










  • $begingroup$
    If $a_n>0$, by Cauchy-Schwarz $$sum_{n=1}^{N}a_nsum_{n=1}^{N}frac{1}{n^2 a_n}geq H_N^2geq log^2(N).$$
    $endgroup$
    – Jack D'Aurizio
    Jan 7 at 21:34


















$begingroup$
I think that $a_n>0$ should be a condition to make the question really interesting
$endgroup$
– ajotatxe
Jan 7 at 21:08




$begingroup$
I think that $a_n>0$ should be a condition to make the question really interesting
$endgroup$
– ajotatxe
Jan 7 at 21:08












$begingroup$
@ajotatxe yes. The book I found the first question, said at the first of the series chapter, that for all questions, consider $a_n>0$ and I forgot to mention that.
$endgroup$
– amir na
Jan 7 at 21:23






$begingroup$
@ajotatxe yes. The book I found the first question, said at the first of the series chapter, that for all questions, consider $a_n>0$ and I forgot to mention that.
$endgroup$
– amir na
Jan 7 at 21:23














$begingroup$
With the condition $a_n > 0$ it is a duplicate of math.stackexchange.com/q/1933001/42969.
$endgroup$
– Martin R
Jan 7 at 21:31




$begingroup$
With the condition $a_n > 0$ it is a duplicate of math.stackexchange.com/q/1933001/42969.
$endgroup$
– Martin R
Jan 7 at 21:31












$begingroup$
If $a_n>0$, by Cauchy-Schwarz $$sum_{n=1}^{N}a_nsum_{n=1}^{N}frac{1}{n^2 a_n}geq H_N^2geq log^2(N).$$
$endgroup$
– Jack D'Aurizio
Jan 7 at 21:34






$begingroup$
If $a_n>0$, by Cauchy-Schwarz $$sum_{n=1}^{N}a_nsum_{n=1}^{N}frac{1}{n^2 a_n}geq H_N^2geq log^2(N).$$
$endgroup$
– Jack D'Aurizio
Jan 7 at 21:34












3 Answers
3






active

oldest

votes


















4












$begingroup$

The answer is yes, an example is
$$a_n = frac{(-1)^n}{n}$$
However, there is no such a sequence with positive terms.
Indeed, if you suppsose that both $sum a_n$ and $sumfrac{1}{n^2a_n}$ are convergent and with positive terms, then you have by the AM-GM inequality
$$sum frac{1}{n}=sum sqrt{a_n cdot frac{1}{n^2a_n}} le sum frac{1}{2} left(a_n + frac{1}{n^2a_n} right) < +infty$$
which implies that the harmonic series is convergent: a contradiction.






share|cite|improve this answer









$endgroup$





















    5












    $begingroup$

    Perhaps a bit too trivial?



    $a_n=(-1)^n(1/n)$






    share|cite|improve this answer









    $endgroup$





















      5












      $begingroup$

      The above answer shows that if the $a_n$s are allowed to change sign, then the sum may converge. However, if the $a_n$s are all positive, then by the Cauchy-Schwarz inequality,



      begin{align*}
      sum_{n=1}^kfrac{1}{n}&=sum_{n= 1}^kfrac{sqrt{a_n}}{sqrt{n^2a_n}}\
      &leq left(sum_{n =1}^ka_nright)^{1/2}left(sum_{n= 1}^kfrac{1}{n^2a_n}right)^{1/2}
      end{align*}



      Since $sum_{n=1}^kfrac{1}{n}toinfty$ as $ktoinfty$, one of $sum a_n$ and $sum frac{1}{n^2a_n}$ must diverge.






      share|cite|improve this answer









      $endgroup$














        Your Answer








        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%2f3065483%2ffind-a-sequence-a-n-such-that-both-sum-a-n-and-sum-frac1n2-a-n%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        4












        $begingroup$

        The answer is yes, an example is
        $$a_n = frac{(-1)^n}{n}$$
        However, there is no such a sequence with positive terms.
        Indeed, if you suppsose that both $sum a_n$ and $sumfrac{1}{n^2a_n}$ are convergent and with positive terms, then you have by the AM-GM inequality
        $$sum frac{1}{n}=sum sqrt{a_n cdot frac{1}{n^2a_n}} le sum frac{1}{2} left(a_n + frac{1}{n^2a_n} right) < +infty$$
        which implies that the harmonic series is convergent: a contradiction.






        share|cite|improve this answer









        $endgroup$


















          4












          $begingroup$

          The answer is yes, an example is
          $$a_n = frac{(-1)^n}{n}$$
          However, there is no such a sequence with positive terms.
          Indeed, if you suppsose that both $sum a_n$ and $sumfrac{1}{n^2a_n}$ are convergent and with positive terms, then you have by the AM-GM inequality
          $$sum frac{1}{n}=sum sqrt{a_n cdot frac{1}{n^2a_n}} le sum frac{1}{2} left(a_n + frac{1}{n^2a_n} right) < +infty$$
          which implies that the harmonic series is convergent: a contradiction.






          share|cite|improve this answer









          $endgroup$
















            4












            4








            4





            $begingroup$

            The answer is yes, an example is
            $$a_n = frac{(-1)^n}{n}$$
            However, there is no such a sequence with positive terms.
            Indeed, if you suppsose that both $sum a_n$ and $sumfrac{1}{n^2a_n}$ are convergent and with positive terms, then you have by the AM-GM inequality
            $$sum frac{1}{n}=sum sqrt{a_n cdot frac{1}{n^2a_n}} le sum frac{1}{2} left(a_n + frac{1}{n^2a_n} right) < +infty$$
            which implies that the harmonic series is convergent: a contradiction.






            share|cite|improve this answer









            $endgroup$



            The answer is yes, an example is
            $$a_n = frac{(-1)^n}{n}$$
            However, there is no such a sequence with positive terms.
            Indeed, if you suppsose that both $sum a_n$ and $sumfrac{1}{n^2a_n}$ are convergent and with positive terms, then you have by the AM-GM inequality
            $$sum frac{1}{n}=sum sqrt{a_n cdot frac{1}{n^2a_n}} le sum frac{1}{2} left(a_n + frac{1}{n^2a_n} right) < +infty$$
            which implies that the harmonic series is convergent: a contradiction.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 7 at 21:15









            CrostulCrostul

            28.2k22352




            28.2k22352























                5












                $begingroup$

                Perhaps a bit too trivial?



                $a_n=(-1)^n(1/n)$






                share|cite|improve this answer









                $endgroup$


















                  5












                  $begingroup$

                  Perhaps a bit too trivial?



                  $a_n=(-1)^n(1/n)$






                  share|cite|improve this answer









                  $endgroup$
















                    5












                    5








                    5





                    $begingroup$

                    Perhaps a bit too trivial?



                    $a_n=(-1)^n(1/n)$






                    share|cite|improve this answer









                    $endgroup$



                    Perhaps a bit too trivial?



                    $a_n=(-1)^n(1/n)$







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Jan 7 at 21:06









                    Peter SzilasPeter Szilas

                    12k2822




                    12k2822























                        5












                        $begingroup$

                        The above answer shows that if the $a_n$s are allowed to change sign, then the sum may converge. However, if the $a_n$s are all positive, then by the Cauchy-Schwarz inequality,



                        begin{align*}
                        sum_{n=1}^kfrac{1}{n}&=sum_{n= 1}^kfrac{sqrt{a_n}}{sqrt{n^2a_n}}\
                        &leq left(sum_{n =1}^ka_nright)^{1/2}left(sum_{n= 1}^kfrac{1}{n^2a_n}right)^{1/2}
                        end{align*}



                        Since $sum_{n=1}^kfrac{1}{n}toinfty$ as $ktoinfty$, one of $sum a_n$ and $sum frac{1}{n^2a_n}$ must diverge.






                        share|cite|improve this answer









                        $endgroup$


















                          5












                          $begingroup$

                          The above answer shows that if the $a_n$s are allowed to change sign, then the sum may converge. However, if the $a_n$s are all positive, then by the Cauchy-Schwarz inequality,



                          begin{align*}
                          sum_{n=1}^kfrac{1}{n}&=sum_{n= 1}^kfrac{sqrt{a_n}}{sqrt{n^2a_n}}\
                          &leq left(sum_{n =1}^ka_nright)^{1/2}left(sum_{n= 1}^kfrac{1}{n^2a_n}right)^{1/2}
                          end{align*}



                          Since $sum_{n=1}^kfrac{1}{n}toinfty$ as $ktoinfty$, one of $sum a_n$ and $sum frac{1}{n^2a_n}$ must diverge.






                          share|cite|improve this answer









                          $endgroup$
















                            5












                            5








                            5





                            $begingroup$

                            The above answer shows that if the $a_n$s are allowed to change sign, then the sum may converge. However, if the $a_n$s are all positive, then by the Cauchy-Schwarz inequality,



                            begin{align*}
                            sum_{n=1}^kfrac{1}{n}&=sum_{n= 1}^kfrac{sqrt{a_n}}{sqrt{n^2a_n}}\
                            &leq left(sum_{n =1}^ka_nright)^{1/2}left(sum_{n= 1}^kfrac{1}{n^2a_n}right)^{1/2}
                            end{align*}



                            Since $sum_{n=1}^kfrac{1}{n}toinfty$ as $ktoinfty$, one of $sum a_n$ and $sum frac{1}{n^2a_n}$ must diverge.






                            share|cite|improve this answer









                            $endgroup$



                            The above answer shows that if the $a_n$s are allowed to change sign, then the sum may converge. However, if the $a_n$s are all positive, then by the Cauchy-Schwarz inequality,



                            begin{align*}
                            sum_{n=1}^kfrac{1}{n}&=sum_{n= 1}^kfrac{sqrt{a_n}}{sqrt{n^2a_n}}\
                            &leq left(sum_{n =1}^ka_nright)^{1/2}left(sum_{n= 1}^kfrac{1}{n^2a_n}right)^{1/2}
                            end{align*}



                            Since $sum_{n=1}^kfrac{1}{n}toinfty$ as $ktoinfty$, one of $sum a_n$ and $sum frac{1}{n^2a_n}$ must diverge.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Jan 7 at 21:15









                            Nathaniel BNathaniel B

                            851616




                            851616






























                                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%2f3065483%2ffind-a-sequence-a-n-such-that-both-sum-a-n-and-sum-frac1n2-a-n%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

                                Probability when a professor distributes a quiz and homework assignment to a class of n students.

                                Image
                                0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
                                Read more

                                Aardman Animations

                                Image
                                Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
                                Read more

                                Are they similar matrix

                                Image
                                0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
                                Read more