Is there a “greatest function” that converges?












14












$begingroup$


We just hit convergence tests in calculus, and learned that $sum_{n=1}^{infty} frac{1}{n^p}$
converges for all $p gt 1$. I thought that this was sort of a "barrier" between what converges and what diverges. Specifically, that setting $a_n=frac{1}{n^{1+epsilon}}$ is sort of the "greatest function" (I'll make this precise later) for which $sum a_n$ converges.



But, I did realize that there are functions that dominate $frac{1}{n^{1+epsilon}}$ but not $frac1n$, such as $frac{1}{nlog(n)}$. Now, the sum of that specific example diverges, but it got me wondering about whether $frac{1}{n}$ is truly the "boundary". So, this leads me to two questions.



1) Is there a function $f$ that dominates $frac{1}{n^p}$ for all $p>1$, meaning: $$lim_{xtoinfty} frac{f(x)}{frac{1}{x^p}}=infty$$
Such that:
$$sum_{n=1}^infty f(n)$$ converges?



2) If so, up to a constant is there a function $g$ such that $sum_{n=1}^infty g(n)$ converges, such that $g$ dominates $f$ for all other functions $f$ such that $sum_{n=1}^infty f(n)$ converges?



I'm just a freshman in high school so I apologize if this is a stupid question.






calculus sequences-and-series convergence







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    I tried to format the question such that it excludes all the "trivial" answers, i.e. "no, because you can just take this function and multiply by any constant to get another function that dominates it and still converges". The constant thing is just excluded by the fact that the limit has to diverge, rather than be equal to some constant, but something similar could still possibly happen. I tried to include a sort of "parameter" on $f$ to patch this, but I couldn't get it formal. But the sort of "philosophy" of the question is about the form of the function, rather than a "cop-out" like that.
    $endgroup$
    – Electric Moccasins
    5 hours ago












  • $begingroup$
    How about $f(x) = frac{1}{xln^2(x)}$ for your first question
    $endgroup$
    – Jakobian
    5 hours ago








  • 3




    $begingroup$
    It's a good question; part of a good answer will surely be to identify the most fruitful way to make the vague intuition behind it more precise.
    $endgroup$
    – Henning Makholm
    5 hours ago






  • 1




    $begingroup$
    From math.stackexchange.com/a/452074/42969: Let $sum_{n=1}^{infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $sum_{n=1}^{infty} C_n$ with much bigger terms in the sense that $lim_{nrightarrowinfty} C_n/c_n = infty$.
    $endgroup$
    – Martin R
    5 hours ago
















14












$begingroup$


We just hit convergence tests in calculus, and learned that $sum_{n=1}^{infty} frac{1}{n^p}$
converges for all $p gt 1$. I thought that this was sort of a "barrier" between what converges and what diverges. Specifically, that setting $a_n=frac{1}{n^{1+epsilon}}$ is sort of the "greatest function" (I'll make this precise later) for which $sum a_n$ converges.



But, I did realize that there are functions that dominate $frac{1}{n^{1+epsilon}}$ but not $frac1n$, such as $frac{1}{nlog(n)}$. Now, the sum of that specific example diverges, but it got me wondering about whether $frac{1}{n}$ is truly the "boundary". So, this leads me to two questions.



1) Is there a function $f$ that dominates $frac{1}{n^p}$ for all $p>1$, meaning: $$lim_{xtoinfty} frac{f(x)}{frac{1}{x^p}}=infty$$
Such that:
$$sum_{n=1}^infty f(n)$$ converges?



2) If so, up to a constant is there a function $g$ such that $sum_{n=1}^infty g(n)$ converges, such that $g$ dominates $f$ for all other functions $f$ such that $sum_{n=1}^infty f(n)$ converges?



I'm just a freshman in high school so I apologize if this is a stupid question.






calculus sequences-and-series convergence







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    I tried to format the question such that it excludes all the "trivial" answers, i.e. "no, because you can just take this function and multiply by any constant to get another function that dominates it and still converges". The constant thing is just excluded by the fact that the limit has to diverge, rather than be equal to some constant, but something similar could still possibly happen. I tried to include a sort of "parameter" on $f$ to patch this, but I couldn't get it formal. But the sort of "philosophy" of the question is about the form of the function, rather than a "cop-out" like that.
    $endgroup$
    – Electric Moccasins
    5 hours ago












  • $begingroup$
    How about $f(x) = frac{1}{xln^2(x)}$ for your first question
    $endgroup$
    – Jakobian
    5 hours ago








  • 3




    $begingroup$
    It's a good question; part of a good answer will surely be to identify the most fruitful way to make the vague intuition behind it more precise.
    $endgroup$
    – Henning Makholm
    5 hours ago






  • 1




    $begingroup$
    From math.stackexchange.com/a/452074/42969: Let $sum_{n=1}^{infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $sum_{n=1}^{infty} C_n$ with much bigger terms in the sense that $lim_{nrightarrowinfty} C_n/c_n = infty$.
    $endgroup$
    – Martin R
    5 hours ago














14












14








14


1



$begingroup$


We just hit convergence tests in calculus, and learned that $sum_{n=1}^{infty} frac{1}{n^p}$
converges for all $p gt 1$. I thought that this was sort of a "barrier" between what converges and what diverges. Specifically, that setting $a_n=frac{1}{n^{1+epsilon}}$ is sort of the "greatest function" (I'll make this precise later) for which $sum a_n$ converges.



But, I did realize that there are functions that dominate $frac{1}{n^{1+epsilon}}$ but not $frac1n$, such as $frac{1}{nlog(n)}$. Now, the sum of that specific example diverges, but it got me wondering about whether $frac{1}{n}$ is truly the "boundary". So, this leads me to two questions.



1) Is there a function $f$ that dominates $frac{1}{n^p}$ for all $p>1$, meaning: $$lim_{xtoinfty} frac{f(x)}{frac{1}{x^p}}=infty$$
Such that:
$$sum_{n=1}^infty f(n)$$ converges?



2) If so, up to a constant is there a function $g$ such that $sum_{n=1}^infty g(n)$ converges, such that $g$ dominates $f$ for all other functions $f$ such that $sum_{n=1}^infty f(n)$ converges?



I'm just a freshman in high school so I apologize if this is a stupid question.






calculus sequences-and-series convergence







share|cite|improve this question









$endgroup$




We just hit convergence tests in calculus, and learned that $sum_{n=1}^{infty} frac{1}{n^p}$
converges for all $p gt 1$. I thought that this was sort of a "barrier" between what converges and what diverges. Specifically, that setting $a_n=frac{1}{n^{1+epsilon}}$ is sort of the "greatest function" (I'll make this precise later) for which $sum a_n$ converges.



But, I did realize that there are functions that dominate $frac{1}{n^{1+epsilon}}$ but not $frac1n$, such as $frac{1}{nlog(n)}$. Now, the sum of that specific example diverges, but it got me wondering about whether $frac{1}{n}$ is truly the "boundary". So, this leads me to two questions.



1) Is there a function $f$ that dominates $frac{1}{n^p}$ for all $p>1$, meaning: $$lim_{xtoinfty} frac{f(x)}{frac{1}{x^p}}=infty$$
Such that:
$$sum_{n=1}^infty f(n)$$ converges?



2) If so, up to a constant is there a function $g$ such that $sum_{n=1}^infty g(n)$ converges, such that $g$ dominates $f$ for all other functions $f$ such that $sum_{n=1}^infty f(n)$ converges?



I'm just a freshman in high school so I apologize if this is a stupid question.






calculus sequences-and-series convergence




calculus sequences-and-series convergence






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 5 hours ago









Electric MoccasinsElectric Moccasins

963




963








  • 1




    $begingroup$
    I tried to format the question such that it excludes all the "trivial" answers, i.e. "no, because you can just take this function and multiply by any constant to get another function that dominates it and still converges". The constant thing is just excluded by the fact that the limit has to diverge, rather than be equal to some constant, but something similar could still possibly happen. I tried to include a sort of "parameter" on $f$ to patch this, but I couldn't get it formal. But the sort of "philosophy" of the question is about the form of the function, rather than a "cop-out" like that.
    $endgroup$
    – Electric Moccasins
    5 hours ago












  • $begingroup$
    How about $f(x) = frac{1}{xln^2(x)}$ for your first question
    $endgroup$
    – Jakobian
    5 hours ago








  • 3




    $begingroup$
    It's a good question; part of a good answer will surely be to identify the most fruitful way to make the vague intuition behind it more precise.
    $endgroup$
    – Henning Makholm
    5 hours ago






  • 1




    $begingroup$
    From math.stackexchange.com/a/452074/42969: Let $sum_{n=1}^{infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $sum_{n=1}^{infty} C_n$ with much bigger terms in the sense that $lim_{nrightarrowinfty} C_n/c_n = infty$.
    $endgroup$
    – Martin R
    5 hours ago














  • 1




    $begingroup$
    I tried to format the question such that it excludes all the "trivial" answers, i.e. "no, because you can just take this function and multiply by any constant to get another function that dominates it and still converges". The constant thing is just excluded by the fact that the limit has to diverge, rather than be equal to some constant, but something similar could still possibly happen. I tried to include a sort of "parameter" on $f$ to patch this, but I couldn't get it formal. But the sort of "philosophy" of the question is about the form of the function, rather than a "cop-out" like that.
    $endgroup$
    – Electric Moccasins
    5 hours ago












  • $begingroup$
    How about $f(x) = frac{1}{xln^2(x)}$ for your first question
    $endgroup$
    – Jakobian
    5 hours ago








  • 3




    $begingroup$
    It's a good question; part of a good answer will surely be to identify the most fruitful way to make the vague intuition behind it more precise.
    $endgroup$
    – Henning Makholm
    5 hours ago






  • 1




    $begingroup$
    From math.stackexchange.com/a/452074/42969: Let $sum_{n=1}^{infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $sum_{n=1}^{infty} C_n$ with much bigger terms in the sense that $lim_{nrightarrowinfty} C_n/c_n = infty$.
    $endgroup$
    – Martin R
    5 hours ago








1




1




$begingroup$
I tried to format the question such that it excludes all the "trivial" answers, i.e. "no, because you can just take this function and multiply by any constant to get another function that dominates it and still converges". The constant thing is just excluded by the fact that the limit has to diverge, rather than be equal to some constant, but something similar could still possibly happen. I tried to include a sort of "parameter" on $f$ to patch this, but I couldn't get it formal. But the sort of "philosophy" of the question is about the form of the function, rather than a "cop-out" like that.
$endgroup$
– Electric Moccasins
5 hours ago






$begingroup$
I tried to format the question such that it excludes all the "trivial" answers, i.e. "no, because you can just take this function and multiply by any constant to get another function that dominates it and still converges". The constant thing is just excluded by the fact that the limit has to diverge, rather than be equal to some constant, but something similar could still possibly happen. I tried to include a sort of "parameter" on $f$ to patch this, but I couldn't get it formal. But the sort of "philosophy" of the question is about the form of the function, rather than a "cop-out" like that.
$endgroup$
– Electric Moccasins
5 hours ago














$begingroup$
How about $f(x) = frac{1}{xln^2(x)}$ for your first question
$endgroup$
– Jakobian
5 hours ago






$begingroup$
How about $f(x) = frac{1}{xln^2(x)}$ for your first question
$endgroup$
– Jakobian
5 hours ago






3




3




$begingroup$
It's a good question; part of a good answer will surely be to identify the most fruitful way to make the vague intuition behind it more precise.
$endgroup$
– Henning Makholm
5 hours ago




$begingroup$
It's a good question; part of a good answer will surely be to identify the most fruitful way to make the vague intuition behind it more precise.
$endgroup$
– Henning Makholm
5 hours ago




1




1




$begingroup$
From math.stackexchange.com/a/452074/42969: Let $sum_{n=1}^{infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $sum_{n=1}^{infty} C_n$ with much bigger terms in the sense that $lim_{nrightarrowinfty} C_n/c_n = infty$.
$endgroup$
– Martin R
5 hours ago




$begingroup$
From math.stackexchange.com/a/452074/42969: Let $sum_{n=1}^{infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $sum_{n=1}^{infty} C_n$ with much bigger terms in the sense that $lim_{nrightarrowinfty} C_n/c_n = infty$.
$endgroup$
– Martin R
5 hours ago










2 Answers
2






active

oldest

votes


















6












$begingroup$

1) Yes, $f(n)=frac{1}{n(ln{n})^2}$.



2) No. Assume $f geq 0$ and $sum_{n geq 1}{f(n)} < infty$.



Then there exists an increasing sequence $N_n$ and some constant $C > 0$ such that $sum_{N_n+1}^{N_{n+1}}{f(k)} leq C2^{-n}$.



Then set $g(n)=(p+1)f(n)$, where $N_p < n leq N_{p+1}$.



Then $sum_{N_n+1}^{N_{n+1}}{g(k)} leq C(n+1)2^{-n}$, thus $sum_{n geq 1}{g(n)}$ is finite and $g(n) >> f(n)$.






share|cite|improve this answer











$endgroup$





















    3












    $begingroup$

    1) $$f(n) = frac{1}{n log(n)^2}$$



    2) No. Given any $g > 0$ such that $sum_n g(n)$ converges, there is an increasing sequence $M_k$ such that $$sum_{n ge M_k} g(n) < 2^{-k}$$

    Then
    $ sum_n g(n) h(n)$ converges, where $h(n) = k$ for $M_k le n < M_{k+1}$.






    share|cite|improve this answer









    $endgroup$









    • 1




      $begingroup$
      If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
      $endgroup$
      – orlp
      5 hours ago












    • $begingroup$
      Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
      $endgroup$
      – Electric Moccasins
      1 hour ago










    • $begingroup$
      @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
      $endgroup$
      – Solomonoff's Secret
      47 mins ago












    • $begingroup$
      @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
      $endgroup$
      – Electric Moccasins
      56 secs ago













    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%2f3101694%2fis-there-a-greatest-function-that-converges%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    6












    $begingroup$

    1) Yes, $f(n)=frac{1}{n(ln{n})^2}$.



    2) No. Assume $f geq 0$ and $sum_{n geq 1}{f(n)} < infty$.



    Then there exists an increasing sequence $N_n$ and some constant $C > 0$ such that $sum_{N_n+1}^{N_{n+1}}{f(k)} leq C2^{-n}$.



    Then set $g(n)=(p+1)f(n)$, where $N_p < n leq N_{p+1}$.



    Then $sum_{N_n+1}^{N_{n+1}}{g(k)} leq C(n+1)2^{-n}$, thus $sum_{n geq 1}{g(n)}$ is finite and $g(n) >> f(n)$.






    share|cite|improve this answer











    $endgroup$


















      6












      $begingroup$

      1) Yes, $f(n)=frac{1}{n(ln{n})^2}$.



      2) No. Assume $f geq 0$ and $sum_{n geq 1}{f(n)} < infty$.



      Then there exists an increasing sequence $N_n$ and some constant $C > 0$ such that $sum_{N_n+1}^{N_{n+1}}{f(k)} leq C2^{-n}$.



      Then set $g(n)=(p+1)f(n)$, where $N_p < n leq N_{p+1}$.



      Then $sum_{N_n+1}^{N_{n+1}}{g(k)} leq C(n+1)2^{-n}$, thus $sum_{n geq 1}{g(n)}$ is finite and $g(n) >> f(n)$.






      share|cite|improve this answer











      $endgroup$
















        6












        6








        6





        $begingroup$

        1) Yes, $f(n)=frac{1}{n(ln{n})^2}$.



        2) No. Assume $f geq 0$ and $sum_{n geq 1}{f(n)} < infty$.



        Then there exists an increasing sequence $N_n$ and some constant $C > 0$ such that $sum_{N_n+1}^{N_{n+1}}{f(k)} leq C2^{-n}$.



        Then set $g(n)=(p+1)f(n)$, where $N_p < n leq N_{p+1}$.



        Then $sum_{N_n+1}^{N_{n+1}}{g(k)} leq C(n+1)2^{-n}$, thus $sum_{n geq 1}{g(n)}$ is finite and $g(n) >> f(n)$.






        share|cite|improve this answer











        $endgroup$



        1) Yes, $f(n)=frac{1}{n(ln{n})^2}$.



        2) No. Assume $f geq 0$ and $sum_{n geq 1}{f(n)} < infty$.



        Then there exists an increasing sequence $N_n$ and some constant $C > 0$ such that $sum_{N_n+1}^{N_{n+1}}{f(k)} leq C2^{-n}$.



        Then set $g(n)=(p+1)f(n)$, where $N_p < n leq N_{p+1}$.



        Then $sum_{N_n+1}^{N_{n+1}}{g(k)} leq C(n+1)2^{-n}$, thus $sum_{n geq 1}{g(n)}$ is finite and $g(n) >> f(n)$.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 56 mins ago









        user12345

        2,0231515




        2,0231515










        answered 5 hours ago









        MindlackMindlack

        3,60517




        3,60517























            3












            $begingroup$

            1) $$f(n) = frac{1}{n log(n)^2}$$



            2) No. Given any $g > 0$ such that $sum_n g(n)$ converges, there is an increasing sequence $M_k$ such that $$sum_{n ge M_k} g(n) < 2^{-k}$$

            Then
            $ sum_n g(n) h(n)$ converges, where $h(n) = k$ for $M_k le n < M_{k+1}$.






            share|cite|improve this answer









            $endgroup$









            • 1




              $begingroup$
              If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
              $endgroup$
              – orlp
              5 hours ago












            • $begingroup$
              Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
              $endgroup$
              – Electric Moccasins
              1 hour ago










            • $begingroup$
              @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
              $endgroup$
              – Solomonoff's Secret
              47 mins ago












            • $begingroup$
              @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
              $endgroup$
              – Electric Moccasins
              56 secs ago


















            3












            $begingroup$

            1) $$f(n) = frac{1}{n log(n)^2}$$



            2) No. Given any $g > 0$ such that $sum_n g(n)$ converges, there is an increasing sequence $M_k$ such that $$sum_{n ge M_k} g(n) < 2^{-k}$$

            Then
            $ sum_n g(n) h(n)$ converges, where $h(n) = k$ for $M_k le n < M_{k+1}$.






            share|cite|improve this answer









            $endgroup$









            • 1




              $begingroup$
              If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
              $endgroup$
              – orlp
              5 hours ago












            • $begingroup$
              Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
              $endgroup$
              – Electric Moccasins
              1 hour ago










            • $begingroup$
              @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
              $endgroup$
              – Solomonoff's Secret
              47 mins ago












            • $begingroup$
              @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
              $endgroup$
              – Electric Moccasins
              56 secs ago
















            3












            3








            3





            $begingroup$

            1) $$f(n) = frac{1}{n log(n)^2}$$



            2) No. Given any $g > 0$ such that $sum_n g(n)$ converges, there is an increasing sequence $M_k$ such that $$sum_{n ge M_k} g(n) < 2^{-k}$$

            Then
            $ sum_n g(n) h(n)$ converges, where $h(n) = k$ for $M_k le n < M_{k+1}$.






            share|cite|improve this answer









            $endgroup$



            1) $$f(n) = frac{1}{n log(n)^2}$$



            2) No. Given any $g > 0$ such that $sum_n g(n)$ converges, there is an increasing sequence $M_k$ such that $$sum_{n ge M_k} g(n) < 2^{-k}$$

            Then
            $ sum_n g(n) h(n)$ converges, where $h(n) = k$ for $M_k le n < M_{k+1}$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 5 hours ago









            Robert IsraelRobert Israel

            322k23212465




            322k23212465








            • 1




              $begingroup$
              If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
              $endgroup$
              – orlp
              5 hours ago












            • $begingroup$
              Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
              $endgroup$
              – Electric Moccasins
              1 hour ago










            • $begingroup$
              @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
              $endgroup$
              – Solomonoff's Secret
              47 mins ago












            • $begingroup$
              @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
              $endgroup$
              – Electric Moccasins
              56 secs ago
















            • 1




              $begingroup$
              If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
              $endgroup$
              – orlp
              5 hours ago












            • $begingroup$
              Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
              $endgroup$
              – Electric Moccasins
              1 hour ago










            • $begingroup$
              @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
              $endgroup$
              – Solomonoff's Secret
              47 mins ago












            • $begingroup$
              @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
              $endgroup$
              – Electric Moccasins
              56 secs ago










            1




            1




            $begingroup$
            If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
            $endgroup$
            – orlp
            5 hours ago






            $begingroup$
            If we're being pedantic you need $f(n) = dfrac{1}{nlog(n+1)^2}$ (or something similar) to prevent division by zero.
            $endgroup$
            – orlp
            5 hours ago














            $begingroup$
            Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
            $endgroup$
            – Electric Moccasins
            1 hour ago




            $begingroup$
            Can you expand on how you know $sum g(n)h(n)$ converges? Just trying to wrap my head around this
            $endgroup$
            – Electric Moccasins
            1 hour ago












            $begingroup$
            @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
            $endgroup$
            – Solomonoff's Secret
            47 mins ago






            $begingroup$
            @ElectricMoccasins Because $sum g(n) h(n) le sum k 2^{-k}$, which converges.
            $endgroup$
            – Solomonoff's Secret
            47 mins ago














            $begingroup$
            @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
            $endgroup$
            – Electric Moccasins
            56 secs ago






            $begingroup$
            @Solomonoff'sSecret Ok, I'm really not sure how you're getting that inequality. I get the inequality in Prof. Isreal's answer, but not how it translates to the one you said. Sorry, this is my first ever brush with "hard math".
            $endgroup$
            – Electric Moccasins
            56 secs ago




















            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%2f3101694%2fis-there-a-greatest-function-that-converges%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

            Magento 2 controller redirect on button click in phtml file

            Image
            0 I want to redirect customer using controller when button is clicked in one of my phtml files. So far I got, controller: public function execute(){ return $this->addToCart(); } public function addToCart(){ // some logic $this->_redirect('checkout/cart/index'); } The above is working fine (redirecting) when you access the controller via URL (www.mydomain.com/batchorder/index/addtocart). And here is my .phtml file: $("#addToCart").click(function(){ let controllerUrl = "<?php echo $block-getUrl('batchorder/index/addtocart'); ?>" $.post(controllerUrl, { "products": JSON.stringify(sideCart.SideCartProducts) }) The post request returns my logic as it should, however, it is not redirecting. Anyone can help? ...
            Read more

            Polycentropodidae

            Image
            Polycentropodidae Plectrocnemia conspersa Siyentipiko nga pagklasipika Ginhadi-an: Animalia Phylum: Arthropoda Ubosphylum: Hexapoda Klase: Insecta Orden: Trichoptera Labawbanay: Hydropsychoidea Banay: Polycentropodidae Binomial nga ngaran Polycentropodidae An Polycentropodidae [1] in uska familia han Insecta. An Polycentropodidae in nahilalakip ha familia nga Hydropsychoidea, ordo nga Trichoptera, classis nga Insecta, punoan nga Arthropoda, ngan regnum nga Animalia. [1] An familia nga Polycentropodidae in naglalakip hin 660 ka mga species, sumala ha Catalogue of Life [1] . An kladograma hini sumala ha Catalogue of Life [1] : Hydropsychoidea   Polycentropodidae  Adectophylax Antillopsyche Cernotina Cyrnellus Cyrnodes Cyrnopsis Cyrnus Eodipseudopsis Eoneureclipsis Holocentropus Kambaitipsyche Neucentropus ...
            Read more