Prove whether $f(n)$ is $O$, $o$, $Omega$, $omega$ or $Theta$ of $g(n)$. The 2019 Stack Overflow Developer Survey Results Are Inpredicting runtime of $mathcalO(n log(n))$ algorithm, one “input size to runtime” pair is givenHow to prove that $lim_xto infty x/2^x = 0$Using Big-O to analyze an algorithm's effectivenessConverting a CFG to Chomsky Normal FormRecurrence Relation - $T(n) = 4T(n/2) + n^2log n$ - Solve using the tree methodProve whether $f(n)$ is $O$, $o$, $Omega$, $omega$ or $Theta$ of $g(n)$ for given $f$ and $g$Determining whether $g(n)$ is $O(f(n))$Prove that among any set of 34 different positive integers that are at most 99, there is always a pair of numbers that differ by at most 2.Proving $log^n(n)=omega(n^log(n)) $Is this solution correct? Prove whether $f(n)$ is $O$, $o$, $Omega$, $omega$ or $Theta$ of $g(n)$
Inverse Relationship Between Precision and Recall
Why was M87 targeted for the Event Horizon Telescope instead of Sagittarius A*?
Match Roman Numerals
How to notate time signature switching consistently every measure
Pokemon Turn Based battle (Python)
Correct punctuation for showing a character's confusion
Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?
How to type a long/em dash `—`
Worn-tile Scrabble
Dropping list elements from nested list after evaluation
Can we generate random numbers using irrational numbers like π and e?
Falsification in Math vs Science
writing variables above the numbers in tikz picture
If a sorcerer casts the Banishment spell on a PC while in Avernus, does the PC return to their home plane?
Why can't devices on different VLANs, but on the same subnet, communicate?
I am an eight letter word. What am I?
Why couldn't they take pictures of a closer black hole?
How can I add encounters in the Lost Mine of Phandelver campaign without giving PCs too much XP?
Geography at the pixel level
Why does the nucleus not repel itself?
Does HR tell a hiring manager about salary negotiations?
Can there be female White Walkers?
Can withdrawing asylum be illegal?
What is this business jet?
Prove whether $f(n)$ is $O$, $o$, $Omega$, $omega$ or $Theta$ of $g(n)$.
The 2019 Stack Overflow Developer Survey Results Are Inpredicting runtime of $mathcalO(n log(n))$ algorithm, one “input size to runtime” pair is givenHow to prove that $lim_xto infty x/2^x = 0$Using Big-O to analyze an algorithm's effectivenessConverting a CFG to Chomsky Normal FormRecurrence Relation - $T(n) = 4T(n/2) + n^2log n$ - Solve using the tree methodProve whether $f(n)$ is $O$, $o$, $Omega$, $omega$ or $Theta$ of $g(n)$ for given $f$ and $g$Determining whether $g(n)$ is $O(f(n))$Prove that among any set of 34 different positive integers that are at most 99, there is always a pair of numbers that differ by at most 2.Proving $log^n(n)=omega(n^log(n)) $Is this solution correct? Prove whether $f(n)$ is $O$, $o$, $Omega$, $omega$ or $Theta$ of $g(n)$
$begingroup$
$f(n) = e^n ln(n)$,
$g(n) = 2^n log(n)$
log can be assumed to be base $2$.
Alright so I put this in the form $f(n) / g(n)$ and then used L'Hôpital's rule giving me
$$ frac dfrace^nn +ln(n)e^n dfrac2^nnln(2) +n2^n-1log(n) $$
and I'm pretty sure if I did this right that it's still of the form infinity/infinity and will continue to be even if I differentiate again.
I think the solution has to do something with getting the exponent of $n2^n-1$ to 0 by differentiating over and over. But I'm not sure how to get a solution from this.
discrete-mathematics asymptotics computer-science
asked Mar 24 at 5:33
BrownieBrownie
3327
$endgroup$
add a comment |
$begingroup$
$f(n) = e^n ln(n)$,
$g(n) = 2^n log(n)$
log can be assumed to be base $2$.
Alright so I put this in the form $f(n) / g(n)$ and then used L'Hôpital's rule giving me
$$ frac dfrace^nn +ln(n)e^n dfrac2^nnln(2) +n2^n-1log(n) $$
and I'm pretty sure if I did this right that it's still of the form infinity/infinity and will continue to be even if I differentiate again.
I think the solution has to do something with getting the exponent of $n2^n-1$ to 0 by differentiating over and over. But I'm not sure how to get a solution from this.
discrete-mathematics asymptotics computer-science
asked Mar 24 at 5:33
BrownieBrownie
3327
$endgroup$
add a comment |
$begingroup$
$f(n) = e^n ln(n)$,
$g(n) = 2^n log(n)$
log can be assumed to be base $2$.
Alright so I put this in the form $f(n) / g(n)$ and then used L'Hôpital's rule giving me
$$ frac dfrace^nn +ln(n)e^n dfrac2^nnln(2) +n2^n-1log(n) $$
and I'm pretty sure if I did this right that it's still of the form infinity/infinity and will continue to be even if I differentiate again.
I think the solution has to do something with getting the exponent of $n2^n-1$ to 0 by differentiating over and over. But I'm not sure how to get a solution from this.
discrete-mathematics asymptotics computer-science
asked Mar 24 at 5:33
BrownieBrownie
3327
$endgroup$
$f(n) = e^n ln(n)$,
$g(n) = 2^n log(n)$
log can be assumed to be base $2$.
Alright so I put this in the form $f(n) / g(n)$ and then used L'Hôpital's rule giving me
$$ frac dfrace^nn +ln(n)e^n dfrac2^nnln(2) +n2^n-1log(n) $$
and I'm pretty sure if I did this right that it's still of the form infinity/infinity and will continue to be even if I differentiate again.
I think the solution has to do something with getting the exponent of $n2^n-1$ to 0 by differentiating over and over. But I'm not sure how to get a solution from this.
discrete-mathematics asymptotics computer-science
discrete-mathematics asymptotics computer-science
asked Mar 24 at 5:33
BrownieBrownie
3327
asked Mar 24 at 5:33
BrownieBrownie
3327
edited Mar 24 at 5:53
Brownie
asked Mar 24 at 5:33
BrownieBrownie
3327
asked Mar 24 at 5:33
BrownieBrownie
3327
asked Mar 24 at 5:33
BrownieBrownie
3327
3327
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
We can compute
$$lim_n frace^nln n2^nlog n = lim_n bigg[left(frace2right)^n cdot fracln 2 ln nln nbigg] = infty.$$
Edit: To deal with the logarithms, you can use the identity
$$log_b x = fracln xln b.$$
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
$endgroup$
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
1
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
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%2f3160145%2fprove-whether-fn-is-o-o-omega-omega-or-theta-of-gn%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
We can compute
$$lim_n frace^nln n2^nlog n = lim_n bigg[left(frace2right)^n cdot fracln 2 ln nln nbigg] = infty.$$
Edit: To deal with the logarithms, you can use the identity
$$log_b x = fracln xln b.$$
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
$endgroup$
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
1
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
add a comment |
$begingroup$
We can compute
$$lim_n frace^nln n2^nlog n = lim_n bigg[left(frace2right)^n cdot fracln 2 ln nln nbigg] = infty.$$
Edit: To deal with the logarithms, you can use the identity
$$log_b x = fracln xln b.$$
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
$endgroup$
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
1
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
add a comment |
$begingroup$
We can compute
$$lim_n frace^nln n2^nlog n = lim_n bigg[left(frace2right)^n cdot fracln 2 ln nln nbigg] = infty.$$
Edit: To deal with the logarithms, you can use the identity
$$log_b x = fracln xln b.$$
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
$endgroup$
We can compute
$$lim_n frace^nln n2^nlog n = lim_n bigg[left(frace2right)^n cdot fracln 2 ln nln nbigg] = infty.$$
Edit: To deal with the logarithms, you can use the identity
$$log_b x = fracln xln b.$$
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
edited Mar 24 at 6:17
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
answered Mar 24 at 5:56
Gary MoonGary Moon
921127
921127
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
1
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
add a comment |
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
1
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
$begingroup$
So I get that you split e^n and 2^n off separately. I'm not sure what math you did on ln(n) /log(n) though. Did you differentiate?
$endgroup$
– Brownie
Mar 24 at 6:08
1
1
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
$begingroup$
@Brownie I added an edit to (hopefully) address your question.
$endgroup$
– Gary Moon
Mar 24 at 6:12
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%2f3160145%2fprove-whether-fn-is-o-o-omega-omega-or-theta-of-gn%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
