Proving that sequence is decreasing












1












$begingroup$


I was looking at the first answer to this question Simple proof of showing the Harmonic number $H_n = Theta (log n)$, which claims that the following sequence is decreasing:
$$
f(n) = H_n - log(n)
$$

where $log$ is the natural log and $H_n = sum_{i = 1}^n frac{1}{i}$.



Here is my attempt to verify this:



Observe that
$$
f(n + 1) - f(n) = H_{n + 1} - log(n + 1) - (H_n - log(n)) = frac{1}{n + 1} + log left(frac{n}{n + 1} right).
$$

But this last term is positive, so it appears that the sequence is increasing! Where is my mistake?










share|cite|improve this question









$endgroup$








  • 3




    $begingroup$
    Welcome to MSE. Note that although $frac{1}{n + 1}$ is positive, $log left(frac{n}{n+1}right)$ is negative as $frac{n}{n+1} lt 1$.
    $endgroup$
    – John Omielan
    Jan 22 at 1:16








  • 3




    $begingroup$
    no, $n/(n+1)$ is smaller than one, so its logarithm is negative.
    $endgroup$
    – Will Jagy
    Jan 22 at 1:17










  • $begingroup$
    @JohnOmielan Thank you. What would be a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:18










  • $begingroup$
    @Submarine I'm not sure what a particularly "good" way to show this inequality is negative, with it depending to a certain extent on what you have learned & know how to use. However, I would use a Taylor expansion of the natural log, in particular, the first one in Taylor Series Expansions of Logarimathic Functions and show the remaining terms are negative. However, this is something I'm not particularly expert at, so perhaps somebody here can give you a better suggestion.
    $endgroup$
    – John Omielan
    Jan 22 at 1:24










  • $begingroup$
    @WillJagy Thank you for the comment. Do you know a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:26
















1












$begingroup$


I was looking at the first answer to this question Simple proof of showing the Harmonic number $H_n = Theta (log n)$, which claims that the following sequence is decreasing:
$$
f(n) = H_n - log(n)
$$

where $log$ is the natural log and $H_n = sum_{i = 1}^n frac{1}{i}$.



Here is my attempt to verify this:



Observe that
$$
f(n + 1) - f(n) = H_{n + 1} - log(n + 1) - (H_n - log(n)) = frac{1}{n + 1} + log left(frac{n}{n + 1} right).
$$

But this last term is positive, so it appears that the sequence is increasing! Where is my mistake?










share|cite|improve this question









$endgroup$








  • 3




    $begingroup$
    Welcome to MSE. Note that although $frac{1}{n + 1}$ is positive, $log left(frac{n}{n+1}right)$ is negative as $frac{n}{n+1} lt 1$.
    $endgroup$
    – John Omielan
    Jan 22 at 1:16








  • 3




    $begingroup$
    no, $n/(n+1)$ is smaller than one, so its logarithm is negative.
    $endgroup$
    – Will Jagy
    Jan 22 at 1:17










  • $begingroup$
    @JohnOmielan Thank you. What would be a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:18










  • $begingroup$
    @Submarine I'm not sure what a particularly "good" way to show this inequality is negative, with it depending to a certain extent on what you have learned & know how to use. However, I would use a Taylor expansion of the natural log, in particular, the first one in Taylor Series Expansions of Logarimathic Functions and show the remaining terms are negative. However, this is something I'm not particularly expert at, so perhaps somebody here can give you a better suggestion.
    $endgroup$
    – John Omielan
    Jan 22 at 1:24










  • $begingroup$
    @WillJagy Thank you for the comment. Do you know a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:26














1












1








1





$begingroup$


I was looking at the first answer to this question Simple proof of showing the Harmonic number $H_n = Theta (log n)$, which claims that the following sequence is decreasing:
$$
f(n) = H_n - log(n)
$$

where $log$ is the natural log and $H_n = sum_{i = 1}^n frac{1}{i}$.



Here is my attempt to verify this:



Observe that
$$
f(n + 1) - f(n) = H_{n + 1} - log(n + 1) - (H_n - log(n)) = frac{1}{n + 1} + log left(frac{n}{n + 1} right).
$$

But this last term is positive, so it appears that the sequence is increasing! Where is my mistake?










share|cite|improve this question









$endgroup$




I was looking at the first answer to this question Simple proof of showing the Harmonic number $H_n = Theta (log n)$, which claims that the following sequence is decreasing:
$$
f(n) = H_n - log(n)
$$

where $log$ is the natural log and $H_n = sum_{i = 1}^n frac{1}{i}$.



Here is my attempt to verify this:



Observe that
$$
f(n + 1) - f(n) = H_{n + 1} - log(n + 1) - (H_n - log(n)) = frac{1}{n + 1} + log left(frac{n}{n + 1} right).
$$

But this last term is positive, so it appears that the sequence is increasing! Where is my mistake?







real-analysis






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 22 at 1:14









SubmarineSubmarine

61




61








  • 3




    $begingroup$
    Welcome to MSE. Note that although $frac{1}{n + 1}$ is positive, $log left(frac{n}{n+1}right)$ is negative as $frac{n}{n+1} lt 1$.
    $endgroup$
    – John Omielan
    Jan 22 at 1:16








  • 3




    $begingroup$
    no, $n/(n+1)$ is smaller than one, so its logarithm is negative.
    $endgroup$
    – Will Jagy
    Jan 22 at 1:17










  • $begingroup$
    @JohnOmielan Thank you. What would be a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:18










  • $begingroup$
    @Submarine I'm not sure what a particularly "good" way to show this inequality is negative, with it depending to a certain extent on what you have learned & know how to use. However, I would use a Taylor expansion of the natural log, in particular, the first one in Taylor Series Expansions of Logarimathic Functions and show the remaining terms are negative. However, this is something I'm not particularly expert at, so perhaps somebody here can give you a better suggestion.
    $endgroup$
    – John Omielan
    Jan 22 at 1:24










  • $begingroup$
    @WillJagy Thank you for the comment. Do you know a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:26














  • 3




    $begingroup$
    Welcome to MSE. Note that although $frac{1}{n + 1}$ is positive, $log left(frac{n}{n+1}right)$ is negative as $frac{n}{n+1} lt 1$.
    $endgroup$
    – John Omielan
    Jan 22 at 1:16








  • 3




    $begingroup$
    no, $n/(n+1)$ is smaller than one, so its logarithm is negative.
    $endgroup$
    – Will Jagy
    Jan 22 at 1:17










  • $begingroup$
    @JohnOmielan Thank you. What would be a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:18










  • $begingroup$
    @Submarine I'm not sure what a particularly "good" way to show this inequality is negative, with it depending to a certain extent on what you have learned & know how to use. However, I would use a Taylor expansion of the natural log, in particular, the first one in Taylor Series Expansions of Logarimathic Functions and show the remaining terms are negative. However, this is something I'm not particularly expert at, so perhaps somebody here can give you a better suggestion.
    $endgroup$
    – John Omielan
    Jan 22 at 1:24










  • $begingroup$
    @WillJagy Thank you for the comment. Do you know a good way to show that this inequality is negative?
    $endgroup$
    – Submarine
    Jan 22 at 1:26








3




3




$begingroup$
Welcome to MSE. Note that although $frac{1}{n + 1}$ is positive, $log left(frac{n}{n+1}right)$ is negative as $frac{n}{n+1} lt 1$.
$endgroup$
– John Omielan
Jan 22 at 1:16






$begingroup$
Welcome to MSE. Note that although $frac{1}{n + 1}$ is positive, $log left(frac{n}{n+1}right)$ is negative as $frac{n}{n+1} lt 1$.
$endgroup$
– John Omielan
Jan 22 at 1:16






3




3




$begingroup$
no, $n/(n+1)$ is smaller than one, so its logarithm is negative.
$endgroup$
– Will Jagy
Jan 22 at 1:17




$begingroup$
no, $n/(n+1)$ is smaller than one, so its logarithm is negative.
$endgroup$
– Will Jagy
Jan 22 at 1:17












$begingroup$
@JohnOmielan Thank you. What would be a good way to show that this inequality is negative?
$endgroup$
– Submarine
Jan 22 at 1:18




$begingroup$
@JohnOmielan Thank you. What would be a good way to show that this inequality is negative?
$endgroup$
– Submarine
Jan 22 at 1:18












$begingroup$
@Submarine I'm not sure what a particularly "good" way to show this inequality is negative, with it depending to a certain extent on what you have learned & know how to use. However, I would use a Taylor expansion of the natural log, in particular, the first one in Taylor Series Expansions of Logarimathic Functions and show the remaining terms are negative. However, this is something I'm not particularly expert at, so perhaps somebody here can give you a better suggestion.
$endgroup$
– John Omielan
Jan 22 at 1:24




$begingroup$
@Submarine I'm not sure what a particularly "good" way to show this inequality is negative, with it depending to a certain extent on what you have learned & know how to use. However, I would use a Taylor expansion of the natural log, in particular, the first one in Taylor Series Expansions of Logarimathic Functions and show the remaining terms are negative. However, this is something I'm not particularly expert at, so perhaps somebody here can give you a better suggestion.
$endgroup$
– John Omielan
Jan 22 at 1:24












$begingroup$
@WillJagy Thank you for the comment. Do you know a good way to show that this inequality is negative?
$endgroup$
– Submarine
Jan 22 at 1:26




$begingroup$
@WillJagy Thank you for the comment. Do you know a good way to show that this inequality is negative?
$endgroup$
– Submarine
Jan 22 at 1:26










2 Answers
2






active

oldest

votes


















2












$begingroup$

Hint:



$$frac{1}{n+1} < int_n^{n+1} frac{dt}{t} = log (n+1) - log n \ implies frac{1}{n+1} -log (n+1) < - log n$$






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    As the other comments noted, although $frac{n}{n+1}$ is positive, it is also less than 1 so its natural logarithm must be negative.
    Thus, the problem comes down to showing that
    $$frac{1}{x} + lnBig(frac{x-1}{x}Big)<0$$
    That is equivalent to
    $$f(x)=frac{1}{x} - lnBig(frac{x}{x-1}Big) < 0.$$
    It's easy to see that
    $$lim_{x to infty} f(x) = 0$$
    and also that
    $$f^prime (x) = frac{1}{x^2(x-1)},$$
    which is positive for all $x<1$. Thus, $f$ is a strictly inscreasing function. As such, $max(f(x))=lim_{xtoinfty}f(x)=0$.



    Additionally, $f$ is not defined at $x=0$ so $f$ must be strictly negative.






    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%2f3082632%2fproving-that-sequence-is-decreasing%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









      2












      $begingroup$

      Hint:



      $$frac{1}{n+1} < int_n^{n+1} frac{dt}{t} = log (n+1) - log n \ implies frac{1}{n+1} -log (n+1) < - log n$$






      share|cite|improve this answer









      $endgroup$


















        2












        $begingroup$

        Hint:



        $$frac{1}{n+1} < int_n^{n+1} frac{dt}{t} = log (n+1) - log n \ implies frac{1}{n+1} -log (n+1) < - log n$$






        share|cite|improve this answer









        $endgroup$
















          2












          2








          2





          $begingroup$

          Hint:



          $$frac{1}{n+1} < int_n^{n+1} frac{dt}{t} = log (n+1) - log n \ implies frac{1}{n+1} -log (n+1) < - log n$$






          share|cite|improve this answer









          $endgroup$



          Hint:



          $$frac{1}{n+1} < int_n^{n+1} frac{dt}{t} = log (n+1) - log n \ implies frac{1}{n+1} -log (n+1) < - log n$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 22 at 1:29









          RRLRRL

          52.4k42573




          52.4k42573























              0












              $begingroup$

              As the other comments noted, although $frac{n}{n+1}$ is positive, it is also less than 1 so its natural logarithm must be negative.
              Thus, the problem comes down to showing that
              $$frac{1}{x} + lnBig(frac{x-1}{x}Big)<0$$
              That is equivalent to
              $$f(x)=frac{1}{x} - lnBig(frac{x}{x-1}Big) < 0.$$
              It's easy to see that
              $$lim_{x to infty} f(x) = 0$$
              and also that
              $$f^prime (x) = frac{1}{x^2(x-1)},$$
              which is positive for all $x<1$. Thus, $f$ is a strictly inscreasing function. As such, $max(f(x))=lim_{xtoinfty}f(x)=0$.



              Additionally, $f$ is not defined at $x=0$ so $f$ must be strictly negative.






              share|cite|improve this answer









              $endgroup$


















                0












                $begingroup$

                As the other comments noted, although $frac{n}{n+1}$ is positive, it is also less than 1 so its natural logarithm must be negative.
                Thus, the problem comes down to showing that
                $$frac{1}{x} + lnBig(frac{x-1}{x}Big)<0$$
                That is equivalent to
                $$f(x)=frac{1}{x} - lnBig(frac{x}{x-1}Big) < 0.$$
                It's easy to see that
                $$lim_{x to infty} f(x) = 0$$
                and also that
                $$f^prime (x) = frac{1}{x^2(x-1)},$$
                which is positive for all $x<1$. Thus, $f$ is a strictly inscreasing function. As such, $max(f(x))=lim_{xtoinfty}f(x)=0$.



                Additionally, $f$ is not defined at $x=0$ so $f$ must be strictly negative.






                share|cite|improve this answer









                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  As the other comments noted, although $frac{n}{n+1}$ is positive, it is also less than 1 so its natural logarithm must be negative.
                  Thus, the problem comes down to showing that
                  $$frac{1}{x} + lnBig(frac{x-1}{x}Big)<0$$
                  That is equivalent to
                  $$f(x)=frac{1}{x} - lnBig(frac{x}{x-1}Big) < 0.$$
                  It's easy to see that
                  $$lim_{x to infty} f(x) = 0$$
                  and also that
                  $$f^prime (x) = frac{1}{x^2(x-1)},$$
                  which is positive for all $x<1$. Thus, $f$ is a strictly inscreasing function. As such, $max(f(x))=lim_{xtoinfty}f(x)=0$.



                  Additionally, $f$ is not defined at $x=0$ so $f$ must be strictly negative.






                  share|cite|improve this answer









                  $endgroup$



                  As the other comments noted, although $frac{n}{n+1}$ is positive, it is also less than 1 so its natural logarithm must be negative.
                  Thus, the problem comes down to showing that
                  $$frac{1}{x} + lnBig(frac{x-1}{x}Big)<0$$
                  That is equivalent to
                  $$f(x)=frac{1}{x} - lnBig(frac{x}{x-1}Big) < 0.$$
                  It's easy to see that
                  $$lim_{x to infty} f(x) = 0$$
                  and also that
                  $$f^prime (x) = frac{1}{x^2(x-1)},$$
                  which is positive for all $x<1$. Thus, $f$ is a strictly inscreasing function. As such, $max(f(x))=lim_{xtoinfty}f(x)=0$.



                  Additionally, $f$ is not defined at $x=0$ so $f$ must be strictly negative.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 22 at 2:00









                  LorenzoLorenzo

                  1011




                  1011






























                      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%2f3082632%2fproving-that-sequence-is-decreasing%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

                      MongoDB - Not Authorized To Execute Command

                      How to fix TextFormField cause rebuild widget in Flutter

                      Npm cannot find a required file even through it is in the searched directory