Proving little o by first principles












0














I'm trying to prove that $15n+7$ is $o(nlog n)$ (by first principles, i.e. no limits).



My idea is to solve for n to determine $n_0$ and then work backwards from there. But I can't seem to find a way.



$15n+7 < cnlog n$



$7 < n(clog n-15)$



I got stuck here.










share|cite|improve this question
















bumped to the homepage by Community 2 days ago


This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.




















    0














    I'm trying to prove that $15n+7$ is $o(nlog n)$ (by first principles, i.e. no limits).



    My idea is to solve for n to determine $n_0$ and then work backwards from there. But I can't seem to find a way.



    $15n+7 < cnlog n$



    $7 < n(clog n-15)$



    I got stuck here.










    share|cite|improve this question
















    bumped to the homepage by Community 2 days ago


    This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.


















      0












      0








      0







      I'm trying to prove that $15n+7$ is $o(nlog n)$ (by first principles, i.e. no limits).



      My idea is to solve for n to determine $n_0$ and then work backwards from there. But I can't seem to find a way.



      $15n+7 < cnlog n$



      $7 < n(clog n-15)$



      I got stuck here.










      share|cite|improve this question















      I'm trying to prove that $15n+7$ is $o(nlog n)$ (by first principles, i.e. no limits).



      My idea is to solve for n to determine $n_0$ and then work backwards from there. But I can't seem to find a way.



      $15n+7 < cnlog n$



      $7 < n(clog n-15)$



      I got stuck here.







      asymptotics






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Aug 5 '16 at 3:59









      Kenny Lau

      19.8k2159




      19.8k2159










      asked Aug 5 '16 at 3:52









      P-LP-L

      274




      274





      bumped to the homepage by Community 2 days ago


      This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.







      bumped to the homepage by Community 2 days ago


      This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
























          2 Answers
          2






          active

          oldest

          votes


















          0














          If $15n+7$ is $o(n log n)$ then



          $$15n+7 < cn log_2n$$



          for every $n geq n_0$ for some positive real $c$ and $n_0$.



          $$7 < n(clog_2n - 15)$$



          If we chose $n_0 = 1$ then this would change to $7 < -15$ which is false, so we need a larger $n$. Let's do $n_0 geq 2$.



          $$7 < 2(c - 15) = 2c - 30$$



          And $7 < 2c -30$ is true for $c > 18.5$, so the proof is complete.






          share|cite|improve this answer





























            0














            The problem is to prove that
            $$
            bigg( frac{15n + 7}{nlog n} bigg) to 0
            $$
            as $n to infty$;
            for then we have by definition $15n + 7$ is $o(nlog n)$.



            If $n > 1$, then
            $$
            frac{15n + 7}{nlog n} = frac{15}{log n} + frac{7}{nlog n} < frac{15}{log n} + frac{7}{(log n)^{2}}.
            $$
            Let $varepsilon > 0$. Note that we have
            $$
            frac{15}{log n} < frac{varepsilon}{2}
            $$
            if $n > e^{30/varepsilon} =: n_{1}$ and that we have
            $$
            frac{7}{(log n)^{2}} < frac{varepsilon}{2}
            $$
            if $n > e^{sqrt{14/varepsilon}} =: n_{2}$.
            So taking $n_{0} := max { 1, n_{1}, n_{2} }$ suffices.






            share|cite|improve this answer





















              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%2f1883014%2fproving-little-o-by-first-principles%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









              0














              If $15n+7$ is $o(n log n)$ then



              $$15n+7 < cn log_2n$$



              for every $n geq n_0$ for some positive real $c$ and $n_0$.



              $$7 < n(clog_2n - 15)$$



              If we chose $n_0 = 1$ then this would change to $7 < -15$ which is false, so we need a larger $n$. Let's do $n_0 geq 2$.



              $$7 < 2(c - 15) = 2c - 30$$



              And $7 < 2c -30$ is true for $c > 18.5$, so the proof is complete.






              share|cite|improve this answer


























                0














                If $15n+7$ is $o(n log n)$ then



                $$15n+7 < cn log_2n$$



                for every $n geq n_0$ for some positive real $c$ and $n_0$.



                $$7 < n(clog_2n - 15)$$



                If we chose $n_0 = 1$ then this would change to $7 < -15$ which is false, so we need a larger $n$. Let's do $n_0 geq 2$.



                $$7 < 2(c - 15) = 2c - 30$$



                And $7 < 2c -30$ is true for $c > 18.5$, so the proof is complete.






                share|cite|improve this answer
























                  0












                  0








                  0






                  If $15n+7$ is $o(n log n)$ then



                  $$15n+7 < cn log_2n$$



                  for every $n geq n_0$ for some positive real $c$ and $n_0$.



                  $$7 < n(clog_2n - 15)$$



                  If we chose $n_0 = 1$ then this would change to $7 < -15$ which is false, so we need a larger $n$. Let's do $n_0 geq 2$.



                  $$7 < 2(c - 15) = 2c - 30$$



                  And $7 < 2c -30$ is true for $c > 18.5$, so the proof is complete.






                  share|cite|improve this answer












                  If $15n+7$ is $o(n log n)$ then



                  $$15n+7 < cn log_2n$$



                  for every $n geq n_0$ for some positive real $c$ and $n_0$.



                  $$7 < n(clog_2n - 15)$$



                  If we chose $n_0 = 1$ then this would change to $7 < -15$ which is false, so we need a larger $n$. Let's do $n_0 geq 2$.



                  $$7 < 2(c - 15) = 2c - 30$$



                  And $7 < 2c -30$ is true for $c > 18.5$, so the proof is complete.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Aug 5 '16 at 4:30









                  Sean HillSean Hill

                  320212




                  320212























                      0














                      The problem is to prove that
                      $$
                      bigg( frac{15n + 7}{nlog n} bigg) to 0
                      $$
                      as $n to infty$;
                      for then we have by definition $15n + 7$ is $o(nlog n)$.



                      If $n > 1$, then
                      $$
                      frac{15n + 7}{nlog n} = frac{15}{log n} + frac{7}{nlog n} < frac{15}{log n} + frac{7}{(log n)^{2}}.
                      $$
                      Let $varepsilon > 0$. Note that we have
                      $$
                      frac{15}{log n} < frac{varepsilon}{2}
                      $$
                      if $n > e^{30/varepsilon} =: n_{1}$ and that we have
                      $$
                      frac{7}{(log n)^{2}} < frac{varepsilon}{2}
                      $$
                      if $n > e^{sqrt{14/varepsilon}} =: n_{2}$.
                      So taking $n_{0} := max { 1, n_{1}, n_{2} }$ suffices.






                      share|cite|improve this answer


























                        0














                        The problem is to prove that
                        $$
                        bigg( frac{15n + 7}{nlog n} bigg) to 0
                        $$
                        as $n to infty$;
                        for then we have by definition $15n + 7$ is $o(nlog n)$.



                        If $n > 1$, then
                        $$
                        frac{15n + 7}{nlog n} = frac{15}{log n} + frac{7}{nlog n} < frac{15}{log n} + frac{7}{(log n)^{2}}.
                        $$
                        Let $varepsilon > 0$. Note that we have
                        $$
                        frac{15}{log n} < frac{varepsilon}{2}
                        $$
                        if $n > e^{30/varepsilon} =: n_{1}$ and that we have
                        $$
                        frac{7}{(log n)^{2}} < frac{varepsilon}{2}
                        $$
                        if $n > e^{sqrt{14/varepsilon}} =: n_{2}$.
                        So taking $n_{0} := max { 1, n_{1}, n_{2} }$ suffices.






                        share|cite|improve this answer
























                          0












                          0








                          0






                          The problem is to prove that
                          $$
                          bigg( frac{15n + 7}{nlog n} bigg) to 0
                          $$
                          as $n to infty$;
                          for then we have by definition $15n + 7$ is $o(nlog n)$.



                          If $n > 1$, then
                          $$
                          frac{15n + 7}{nlog n} = frac{15}{log n} + frac{7}{nlog n} < frac{15}{log n} + frac{7}{(log n)^{2}}.
                          $$
                          Let $varepsilon > 0$. Note that we have
                          $$
                          frac{15}{log n} < frac{varepsilon}{2}
                          $$
                          if $n > e^{30/varepsilon} =: n_{1}$ and that we have
                          $$
                          frac{7}{(log n)^{2}} < frac{varepsilon}{2}
                          $$
                          if $n > e^{sqrt{14/varepsilon}} =: n_{2}$.
                          So taking $n_{0} := max { 1, n_{1}, n_{2} }$ suffices.






                          share|cite|improve this answer












                          The problem is to prove that
                          $$
                          bigg( frac{15n + 7}{nlog n} bigg) to 0
                          $$
                          as $n to infty$;
                          for then we have by definition $15n + 7$ is $o(nlog n)$.



                          If $n > 1$, then
                          $$
                          frac{15n + 7}{nlog n} = frac{15}{log n} + frac{7}{nlog n} < frac{15}{log n} + frac{7}{(log n)^{2}}.
                          $$
                          Let $varepsilon > 0$. Note that we have
                          $$
                          frac{15}{log n} < frac{varepsilon}{2}
                          $$
                          if $n > e^{30/varepsilon} =: n_{1}$ and that we have
                          $$
                          frac{7}{(log n)^{2}} < frac{varepsilon}{2}
                          $$
                          if $n > e^{sqrt{14/varepsilon}} =: n_{2}$.
                          So taking $n_{0} := max { 1, n_{1}, n_{2} }$ suffices.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Aug 5 '16 at 4:49









                          Gary MooreGary Moore

                          17.2k21545




                          17.2k21545






























                              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.





                              Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                              Please pay close attention to the following guidance:


                              • 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.


                              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%2f1883014%2fproving-little-o-by-first-principles%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

                              Berounka

                              Sphinx de Gizeh

                              Different font size/position of beamer's navigation symbols template's content depending on regular/plain...