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)$
Examples of odd-dimensional manifolds that do not admit contact structure
How can I discourage/prevent PCs from using door choke-points?
Draw arrow on sides of triangle
"One can do his homework in the library"
Deleting missing values from a dataset
Do I need to leave some extra space available on the disk which my database log files reside, for log backup operations to successfully occur?
What is the definition of "Natural Selection"?
Rejected in 4th interview round citing insufficient years of experience
Make a transparent 448*448 image
What is the blue range indicating on this manifold pressure gauge?
When two POV characters meet
If Invisibility ends because the original caster casts a non-concentration spell, does Invisibility also end on other targets of the original casting?
What does it mean when multiple 々 marks follow a 、?
Plywood subfloor won't screw down in a trailer home
Excess Zinc in garden soil
Is it true that real estate prices mainly go up?
If the Captain's screens are out, does he switch seats with the co-pilot?
What is the difference between "shut" and "close"?
It's a yearly task, alright
Running a subshell from the middle of the current command
Am I not good enough for you?
What happens with multiple copies of Humility and Glorious Anthem on the battlefield?
Unreachable code, but reachable with exception
Do f-stop and exposure time perfectly cancel?
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)$
$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?
real-analysis
edited Mar 10 at 20:36
Dr. Mathva
2,341526
asked Mar 10 at 20:31
user649882user649882
133
$endgroup$
|
show 3 more comments
$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?
real-analysis
edited Mar 10 at 20:36
Dr. Mathva
2,341526
asked Mar 10 at 20:31
user649882user649882
133
$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
|
show 3 more comments
$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?
real-analysis
edited Mar 10 at 20:36
Dr. Mathva
2,341526
asked Mar 10 at 20:31
user649882user649882
133
$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
real-analysis
edited Mar 10 at 20:36
Dr. Mathva
2,341526
asked Mar 10 at 20:31
user649882user649882
133
edited Mar 10 at 20:36
Dr. Mathva
2,341526
asked Mar 10 at 20:31
user649882user649882
133
edited Mar 10 at 20:36
Dr. Mathva
2,341526
edited Mar 10 at 20:36
Dr. Mathva
2,341526
edited Mar 10 at 20:36
Dr. Mathva
2,341526
2,341526
asked Mar 10 at 20:31
user649882user649882
133
asked Mar 10 at 20:31
user649882user649882
133
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
|
show 3 more comments
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
|
show 3 more comments
3 Answers
3
active
oldest
votes
$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)$.
edited Mar 10 at 20:57
Robert Howard
2,2112933
answered Mar 10 at 20:50
BernardBernard
122k741116
$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
add a comment |
$begingroup$
Hint:
begineqnarray*
fracln nln ln n le fracnln n.
endeqnarray*
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
$endgroup$
add a comment |
$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.)
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
$endgroup$
add a comment |
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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)$.
edited Mar 10 at 20:57
Robert Howard
2,2112933
answered Mar 10 at 20:50
BernardBernard
122k741116
$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
add a comment |
$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)$.
edited Mar 10 at 20:57
Robert Howard
2,2112933
answered Mar 10 at 20:50
BernardBernard
122k741116
$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
add a comment |
$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)$.
edited Mar 10 at 20:57
Robert Howard
2,2112933
answered Mar 10 at 20:50
BernardBernard
122k741116
$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)$.
edited Mar 10 at 20:57
Robert Howard
2,2112933
answered Mar 10 at 20:50
BernardBernard
122k741116
edited Mar 10 at 20:57
Robert Howard
2,2112933
edited Mar 10 at 20:57
Robert Howard
2,2112933
edited Mar 10 at 20:57
Robert Howard
2,2112933
2,2112933
answered Mar 10 at 20:50
BernardBernard
122k741116
answered Mar 10 at 20:50
BernardBernard
122k741116
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
add a comment |
$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
add a comment |
$begingroup$
Hint:
begineqnarray*
fracln nln ln n le fracnln n.
endeqnarray*
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
$endgroup$
add a comment |
$begingroup$
Hint:
begineqnarray*
fracln nln ln n le fracnln n.
endeqnarray*
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
$endgroup$
add a comment |
$begingroup$
Hint:
begineqnarray*
fracln nln ln n le fracnln n.
endeqnarray*
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
$endgroup$
Hint:
begineqnarray*
fracln nln ln n le fracnln n.
endeqnarray*
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
answered Mar 10 at 20:38
Donald SplutterwitDonald Splutterwit
22.9k21446
22.9k21446
add a comment |
add a comment |
$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.)
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
$endgroup$
add a comment |
$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.)
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
$endgroup$
add a comment |
$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.)
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
$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.)
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
answered Mar 10 at 20:59
eyeballfrogeyeballfrog
6,446629
6,446629
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
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