Which is faster? $n^log n$ or $(log n)^n$?Scaleless (or self-similar) function: $sin ( log x)$How to calculate $limlimits_nto infty n^frac log nn^2$?At which parameter value $c>0$ do the number of solutions of $log(1+x^2)=x^c$ change?Degree of smoothness of real functions and Fourier seriesProving exponential is growing faster than polynomialWhy is a double exponential function faster than $x!$?How can we conclude that this series converges faster?Proving $n^epsilon > log(n)$ for sufficiently large $n$For which $p>0$ does $sum_n=3^inftyfraclog(n)n^p$ converge?Little oh notation question: $x^o(1)$

Deleting missing values from a dataset

US to Europe trip with Canada layover- is 52 minutes enough?

It's a yearly task, alright

What wound would be of little consequence to a biped but terrible for a quadruped?

Is "history" a male-biased word ("his+story")?

Decoding assembly instructions in a Game Boy disassembler

What is the blue range indicating on this manifold pressure gauge?

What is the dot in “1.2.4."

Time travel short story where dinosaur doesn't taste like chicken

redhat 7 + How to stop systemctl service permanent

How could a female member of a species produce eggs unto death?

Life insurance that covers only simultaneous/dual deaths

If the Captain's screens are out, does he switch seats with the co-pilot?

How to make readers know that my work has used a hidden constraint?

Is having access to past exams cheating and, if yes, could it be proven just by a good grade?

Want to switch to tankless, but can I use my existing wiring?

Time dilation for a moving electronic clock

Replacing Windows 7 security updates with anti-virus?

Is this animal really missing?

Should we release the security issues we found in our product as CVE or we can just update those on weekly release notes?

Does Linux have system calls to access all the features of the file systems it supports?

My adviser wants to be the first author

Unreachable code, but reachable with exception

Touchscreen-controlled dentist office snowman collector game



Which is faster? $n^log n$ or $(log n)^n$?


Scaleless (or self-similar) function: $sin ( log x)$How to calculate $limlimits_nto infty n^frac log nn^2$?At which parameter value $c>0$ do the number of solutions of $log(1+x^2)=x^c$ change?Degree of smoothness of real functions and Fourier seriesProving exponential is growing faster than polynomialWhy is a double exponential function faster than $x!$?How can we conclude that this series converges faster?Proving $n^epsilon > log(n)$ for sufficiently large $n$For which $p>0$ does $sum_n=3^inftyfraclog(n)n^p$ converge?Little oh notation question: $x^o(1)$













0












$begingroup$


Which is faster? $n^log n$ or $(log n)^n$?



Should I look at the base or at the exponent when I'm confronting two exponential functions?










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    Hint: write both as $e^textsomething$.
    $endgroup$
    – Wojowu
    Mar 10 at 20:32










  • $begingroup$
    @Wojowu in this case $n^logn$ is faster but I checked their graphics and $n^logn$ seems to be slower
    $endgroup$
    – user649882
    Mar 10 at 20:33










  • $begingroup$
    @user649882 Really? $n^log n = 2^log^2 n$, how would it be "faster" than $(log n)^n = 2^nlog n$?
    $endgroup$
    – Clement C.
    Mar 10 at 20:36











  • $begingroup$
    $overbrace fraclog(n)^2n ^frac1nlogleft(color#C00n^log(n)right)to0$ and $overbracelog(log(n))vphantomfrac(n)^2n^frac1nlogleft(color#C00log(n)^nright)toinfty$, so it would seem that $log(n)^n$ grows faster.
    $endgroup$
    – robjohn
    Mar 10 at 20:38











  • $begingroup$
    @ClementC. to see which function is the fastest between two on a graphic like on desmos.com/calculator you have to see which function is closer to the y axis as it grows, am I wrong?
    $endgroup$
    – user649882
    Mar 10 at 20:42















0












$begingroup$


Which is faster? $n^log n$ or $(log n)^n$?



Should I look at the base or at the exponent when I'm confronting two exponential functions?










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    Hint: write both as $e^textsomething$.
    $endgroup$
    – Wojowu
    Mar 10 at 20:32










  • $begingroup$
    @Wojowu in this case $n^logn$ is faster but I checked their graphics and $n^logn$ seems to be slower
    $endgroup$
    – user649882
    Mar 10 at 20:33










  • $begingroup$
    @user649882 Really? $n^log n = 2^log^2 n$, how would it be "faster" than $(log n)^n = 2^nlog n$?
    $endgroup$
    – Clement C.
    Mar 10 at 20:36











  • $begingroup$
    $overbrace fraclog(n)^2n ^frac1nlogleft(color#C00n^log(n)right)to0$ and $overbracelog(log(n))vphantomfrac(n)^2n^frac1nlogleft(color#C00log(n)^nright)toinfty$, so it would seem that $log(n)^n$ grows faster.
    $endgroup$
    – robjohn
    Mar 10 at 20:38











  • $begingroup$
    @ClementC. to see which function is the fastest between two on a graphic like on desmos.com/calculator you have to see which function is closer to the y axis as it grows, am I wrong?
    $endgroup$
    – user649882
    Mar 10 at 20:42













0












0








0





$begingroup$


Which is faster? $n^log n$ or $(log n)^n$?



Should I look at the base or at the exponent when I'm confronting two exponential functions?










share|cite|improve this question











$endgroup$




Which is faster? $n^log n$ or $(log n)^n$?



Should I look at the base or at the exponent when I'm confronting two exponential functions?







real-analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 10 at 20:36









Dr. Mathva

2,316526




2,316526










asked Mar 10 at 20:31









user649882user649882

133




133







  • 2




    $begingroup$
    Hint: write both as $e^textsomething$.
    $endgroup$
    – Wojowu
    Mar 10 at 20:32










  • $begingroup$
    @Wojowu in this case $n^logn$ is faster but I checked their graphics and $n^logn$ seems to be slower
    $endgroup$
    – user649882
    Mar 10 at 20:33










  • $begingroup$
    @user649882 Really? $n^log n = 2^log^2 n$, how would it be "faster" than $(log n)^n = 2^nlog n$?
    $endgroup$
    – Clement C.
    Mar 10 at 20:36











  • $begingroup$
    $overbrace fraclog(n)^2n ^frac1nlogleft(color#C00n^log(n)right)to0$ and $overbracelog(log(n))vphantomfrac(n)^2n^frac1nlogleft(color#C00log(n)^nright)toinfty$, so it would seem that $log(n)^n$ grows faster.
    $endgroup$
    – robjohn
    Mar 10 at 20:38











  • $begingroup$
    @ClementC. to see which function is the fastest between two on a graphic like on desmos.com/calculator you have to see which function is closer to the y axis as it grows, am I wrong?
    $endgroup$
    – user649882
    Mar 10 at 20:42












  • 2




    $begingroup$
    Hint: write both as $e^textsomething$.
    $endgroup$
    – Wojowu
    Mar 10 at 20:32










  • $begingroup$
    @Wojowu in this case $n^logn$ is faster but I checked their graphics and $n^logn$ seems to be slower
    $endgroup$
    – user649882
    Mar 10 at 20:33










  • $begingroup$
    @user649882 Really? $n^log n = 2^log^2 n$, how would it be "faster" than $(log n)^n = 2^nlog n$?
    $endgroup$
    – Clement C.
    Mar 10 at 20:36











  • $begingroup$
    $overbrace fraclog(n)^2n ^frac1nlogleft(color#C00n^log(n)right)to0$ and $overbracelog(log(n))vphantomfrac(n)^2n^frac1nlogleft(color#C00log(n)^nright)toinfty$, so it would seem that $log(n)^n$ grows faster.
    $endgroup$
    – robjohn
    Mar 10 at 20:38











  • $begingroup$
    @ClementC. to see which function is the fastest between two on a graphic like on desmos.com/calculator you have to see which function is closer to the y axis as it grows, am I wrong?
    $endgroup$
    – user649882
    Mar 10 at 20:42







2




2




$begingroup$
Hint: write both as $e^textsomething$.
$endgroup$
– Wojowu
Mar 10 at 20:32




$begingroup$
Hint: write both as $e^textsomething$.
$endgroup$
– Wojowu
Mar 10 at 20:32












$begingroup$
@Wojowu in this case $n^logn$ is faster but I checked their graphics and $n^logn$ seems to be slower
$endgroup$
– user649882
Mar 10 at 20:33




$begingroup$
@Wojowu in this case $n^logn$ is faster but I checked their graphics and $n^logn$ seems to be slower
$endgroup$
– user649882
Mar 10 at 20:33












$begingroup$
@user649882 Really? $n^log n = 2^log^2 n$, how would it be "faster" than $(log n)^n = 2^nlog n$?
$endgroup$
– Clement C.
Mar 10 at 20:36





$begingroup$
@user649882 Really? $n^log n = 2^log^2 n$, how would it be "faster" than $(log n)^n = 2^nlog n$?
$endgroup$
– Clement C.
Mar 10 at 20:36













$begingroup$
$overbrace fraclog(n)^2n ^frac1nlogleft(color#C00n^log(n)right)to0$ and $overbracelog(log(n))vphantomfrac(n)^2n^frac1nlogleft(color#C00log(n)^nright)toinfty$, so it would seem that $log(n)^n$ grows faster.
$endgroup$
– robjohn
Mar 10 at 20:38





$begingroup$
$overbrace fraclog(n)^2n ^frac1nlogleft(color#C00n^log(n)right)to0$ and $overbracelog(log(n))vphantomfrac(n)^2n^frac1nlogleft(color#C00log(n)^nright)toinfty$, so it would seem that $log(n)^n$ grows faster.
$endgroup$
– robjohn
Mar 10 at 20:38













$begingroup$
@ClementC. to see which function is the fastest between two on a graphic like on desmos.com/calculator you have to see which function is closer to the y axis as it grows, am I wrong?
$endgroup$
– user649882
Mar 10 at 20:42




$begingroup$
@ClementC. to see which function is the fastest between two on a graphic like on desmos.com/calculator you have to see which function is closer to the y axis as it grows, am I wrong?
$endgroup$
– user649882
Mar 10 at 20:42










3 Answers
3






active

oldest

votes


















1












$begingroup$

Convert to a standard exponential:
$$n^log n=mathrm e^log^2n, quad (log n)^n=mathrm e^nlog(log n)$$
then check whether $;log^2n=obigl(nlog(log n)bigr):$ or $;nlog(log n)=obigl(log^2nbigr)$.






share|cite|improve this answer











$endgroup$












  • $begingroup$
    is $n^n$ faster than $n^logn$?
    $endgroup$
    – user649882
    Mar 10 at 20:53










  • $begingroup$
    @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
    $endgroup$
    – Sangchul Lee
    Mar 10 at 21:08


















0












$begingroup$

Hint:
begineqnarray*
fracln nln ln n le fracnln n.
endeqnarray*






share|cite|improve this answer









$endgroup$




















    0












    $begingroup$

    If $2le a < b$, then $b^a < a^b$. So $n^log n < (log n)^n$ for all $n>7$.



    (This bound isn't tight--it's actually true for all $n > 5$. But it should still be good enough.)






    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%2f3142857%2fwhich-is-faster-n-log-n-or-log-nn%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









      1












      $begingroup$

      Convert to a standard exponential:
      $$n^log n=mathrm e^log^2n, quad (log n)^n=mathrm e^nlog(log n)$$
      then check whether $;log^2n=obigl(nlog(log n)bigr):$ or $;nlog(log n)=obigl(log^2nbigr)$.






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        is $n^n$ faster than $n^logn$?
        $endgroup$
        – user649882
        Mar 10 at 20:53










      • $begingroup$
        @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
        $endgroup$
        – Sangchul Lee
        Mar 10 at 21:08















      1












      $begingroup$

      Convert to a standard exponential:
      $$n^log n=mathrm e^log^2n, quad (log n)^n=mathrm e^nlog(log n)$$
      then check whether $;log^2n=obigl(nlog(log n)bigr):$ or $;nlog(log n)=obigl(log^2nbigr)$.






      share|cite|improve this answer











      $endgroup$












      • $begingroup$
        is $n^n$ faster than $n^logn$?
        $endgroup$
        – user649882
        Mar 10 at 20:53










      • $begingroup$
        @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
        $endgroup$
        – Sangchul Lee
        Mar 10 at 21:08













      1












      1








      1





      $begingroup$

      Convert to a standard exponential:
      $$n^log n=mathrm e^log^2n, quad (log n)^n=mathrm e^nlog(log n)$$
      then check whether $;log^2n=obigl(nlog(log n)bigr):$ or $;nlog(log n)=obigl(log^2nbigr)$.






      share|cite|improve this answer











      $endgroup$



      Convert to a standard exponential:
      $$n^log n=mathrm e^log^2n, quad (log n)^n=mathrm e^nlog(log n)$$
      then check whether $;log^2n=obigl(nlog(log n)bigr):$ or $;nlog(log n)=obigl(log^2nbigr)$.







      share|cite|improve this answer














      share|cite|improve this answer



      share|cite|improve this answer








      edited Mar 10 at 20:57









      Robert Howard

      2,2112933




      2,2112933










      answered Mar 10 at 20:50









      BernardBernard

      122k741116




      122k741116











      • $begingroup$
        is $n^n$ faster than $n^logn$?
        $endgroup$
        – user649882
        Mar 10 at 20:53










      • $begingroup$
        @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
        $endgroup$
        – Sangchul Lee
        Mar 10 at 21:08
















      • $begingroup$
        is $n^n$ faster than $n^logn$?
        $endgroup$
        – user649882
        Mar 10 at 20:53










      • $begingroup$
        @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
        $endgroup$
        – Sangchul Lee
        Mar 10 at 21:08















      $begingroup$
      is $n^n$ faster than $n^logn$?
      $endgroup$
      – user649882
      Mar 10 at 20:53




      $begingroup$
      is $n^n$ faster than $n^logn$?
      $endgroup$
      – user649882
      Mar 10 at 20:53












      $begingroup$
      @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
      $endgroup$
      – Sangchul Lee
      Mar 10 at 21:08




      $begingroup$
      @user649882, Yes, because the exponent of $n^n$ is much larger than that of $n^log n$.
      $endgroup$
      – Sangchul Lee
      Mar 10 at 21:08











      0












      $begingroup$

      Hint:
      begineqnarray*
      fracln nln ln n le fracnln n.
      endeqnarray*






      share|cite|improve this answer









      $endgroup$

















        0












        $begingroup$

        Hint:
        begineqnarray*
        fracln nln ln n le fracnln n.
        endeqnarray*






        share|cite|improve this answer









        $endgroup$















          0












          0








          0





          $begingroup$

          Hint:
          begineqnarray*
          fracln nln ln n le fracnln n.
          endeqnarray*






          share|cite|improve this answer









          $endgroup$



          Hint:
          begineqnarray*
          fracln nln ln n le fracnln n.
          endeqnarray*







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Mar 10 at 20:38









          Donald SplutterwitDonald Splutterwit

          22.9k21446




          22.9k21446





















              0












              $begingroup$

              If $2le a < b$, then $b^a < a^b$. So $n^log n < (log n)^n$ for all $n>7$.



              (This bound isn't tight--it's actually true for all $n > 5$. But it should still be good enough.)






              share|cite|improve this answer









              $endgroup$

















                0












                $begingroup$

                If $2le a < b$, then $b^a < a^b$. So $n^log n < (log n)^n$ for all $n>7$.



                (This bound isn't tight--it's actually true for all $n > 5$. But it should still be good enough.)






                share|cite|improve this answer









                $endgroup$















                  0












                  0








                  0





                  $begingroup$

                  If $2le a < b$, then $b^a < a^b$. So $n^log n < (log n)^n$ for all $n>7$.



                  (This bound isn't tight--it's actually true for all $n > 5$. But it should still be good enough.)






                  share|cite|improve this answer









                  $endgroup$



                  If $2le a < b$, then $b^a < a^b$. So $n^log n < (log n)^n$ for all $n>7$.



                  (This bound isn't tight--it's actually true for all $n > 5$. But it should still be good enough.)







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Mar 10 at 20:59









                  eyeballfrogeyeballfrog

                  6,446629




                  6,446629



























                      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%2f3142857%2fwhich-is-faster-n-log-n-or-log-nn%23new-answer', 'question_page');

                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

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

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

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