Scary looking limit with an elegant answer Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar ManaraEvaluating a limit with variable in the exponentFinding a limit with squeeze theoremCalculate the limit.Limit of function with 0/0Evaluating the limit of $lim_xtoinfty(sqrtfracx^3x+2-x)$.Limit using l'hospitalProblem with finding a limit of a tricky functionCan I take limits under a limit?Limit answer not matchingLimit $lim_ntoinfty n^2left(sqrt1+frac1n+sqrt1-frac1n-2right)$
Will I lose my paid in full property
Do I need to protect SFP ports and optics from dust/contaminants? If so, how?
Passing args from the bash script to the function in the script
Is it acceptable to use working hours to read general interest books?
Did the Roman Empire have penal colonies?
Married in secret, can marital status in passport be changed at a later date?
What to do with someone that cheated their way through university and a PhD program?
Mistake in years of experience in resume?
Co-worker works way more than he should
How would this chord from "Rocket Man" be analyzed?
Contradiction proof for inequality of P and NP?
What's parked in Mil Moscow helicopter plant?
Expansion//Explosion and Siren Stormtamer
Prove the alternating sum of a decreasing sequence converging to 0 is Cauchy.
Why does the Cisco show run command not show the full version, while the show version command does?
What is the least dense liquid under normal conditions?
With indentation set to `0em`, when using a line break, there is still an indentation of a size of a space
Why isn't everyone flabbergasted about Bran's "gift"?
Additive group of local rings
Can you stand up from being prone using Skirmisher outside of your turn?
As an international instructor, should I openly talk about my accent?
Can I criticise the more senior developers around me for not writing clean code?
My admission is revoked after accepting the admission offer
What ability score does a Hexblade's Pact Weapon use for attack and damage when wielded by another character?
Scary looking limit with an elegant answer
Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar ManaraEvaluating a limit with variable in the exponentFinding a limit with squeeze theoremCalculate the limit.Limit of function with 0/0Evaluating the limit of $lim_xtoinfty(sqrtfracx^3x+2-x)$.Limit using l'hospitalProblem with finding a limit of a tricky functionCan I take limits under a limit?Limit answer not matchingLimit $lim_ntoinfty n^2left(sqrt1+frac1n+sqrt1-frac1n-2right)$
$begingroup$
This problem was posted half a year ago by Pierre Mounir on a Facebook group and until now it received no answers. Since most of his problems that I saw were amazing I can bet this one it's worth the time. Wolfram returns the answer to be $2$, which is quite elegant for it's look.
I remembered about it yesterday and gave a try again taking for simplicity $k=1$ (I had no chance with a bigger number).
Also my whole idea was to somehow get to a point where I can use $limlimits_fto 0fraca^f-1f=ln a$, thus I started as:
$$lim_nto infty frac5^fracn!(2n)!-4^frac1n!3^fracn!(2n)!-2^frac1n!=lim_nto infty left(frac42right)^frac1n!left(frac5^fracn!(2n)!4^frac1n!-1right)left(frac3^fracn!(2n)!2^frac1n!-1right)^-1$$
$$=lim_nto infty underbracesqrt[n!]2_to 1left(sqrt[n!]frac5^frac1(2n)!4-1right)left(sqrt[n!]frac3^frac1(2n)!2-1right)^-1$$
Well, yes $frac5^frac1(2n)!4$ and the other one in the denominator equals to $1$, but still I don't see how to use that limit. Also I tried to take a logarithm on both sides or to use L'hospital, but looks like a dead end.
I would love if someone can spot the trick for solving this limit and land some help.
limits factorial
$endgroup$
add a comment |
$begingroup$
This problem was posted half a year ago by Pierre Mounir on a Facebook group and until now it received no answers. Since most of his problems that I saw were amazing I can bet this one it's worth the time. Wolfram returns the answer to be $2$, which is quite elegant for it's look.
I remembered about it yesterday and gave a try again taking for simplicity $k=1$ (I had no chance with a bigger number).
Also my whole idea was to somehow get to a point where I can use $limlimits_fto 0fraca^f-1f=ln a$, thus I started as:
$$lim_nto infty frac5^fracn!(2n)!-4^frac1n!3^fracn!(2n)!-2^frac1n!=lim_nto infty left(frac42right)^frac1n!left(frac5^fracn!(2n)!4^frac1n!-1right)left(frac3^fracn!(2n)!2^frac1n!-1right)^-1$$
$$=lim_nto infty underbracesqrt[n!]2_to 1left(sqrt[n!]frac5^frac1(2n)!4-1right)left(sqrt[n!]frac3^frac1(2n)!2-1right)^-1$$
Well, yes $frac5^frac1(2n)!4$ and the other one in the denominator equals to $1$, but still I don't see how to use that limit. Also I tried to take a logarithm on both sides or to use L'hospital, but looks like a dead end.
I would love if someone can spot the trick for solving this limit and land some help.
limits factorial
$endgroup$
1
$begingroup$
Maybe it could be a good idea to use Stirling, just to spot what the limit is?
$endgroup$
– Crostul
Apr 20 at 12:23
2
$begingroup$
If the given expression is $(a-b) /(c-d) $ then $a, b, c, d$ tend to $1$ and hence they can be replaced by their logs.
$endgroup$
– Paramanand Singh
Apr 20 at 12:34
3
$begingroup$
The answer easily comes to be 2 via logs. One just needs to prove that $(n!) ^2 k /(2kn)!to 0$ which is sort of not that difficult.
$endgroup$
– Paramanand Singh
Apr 20 at 12:40
3
$begingroup$
A pedantic answerer could go ahead and use Stirling's formula, since the forbidden usage is misspelled Strirling's.
$endgroup$
– GEdgar
Apr 20 at 12:59
add a comment |
$begingroup$
This problem was posted half a year ago by Pierre Mounir on a Facebook group and until now it received no answers. Since most of his problems that I saw were amazing I can bet this one it's worth the time. Wolfram returns the answer to be $2$, which is quite elegant for it's look.
I remembered about it yesterday and gave a try again taking for simplicity $k=1$ (I had no chance with a bigger number).
Also my whole idea was to somehow get to a point where I can use $limlimits_fto 0fraca^f-1f=ln a$, thus I started as:
$$lim_nto infty frac5^fracn!(2n)!-4^frac1n!3^fracn!(2n)!-2^frac1n!=lim_nto infty left(frac42right)^frac1n!left(frac5^fracn!(2n)!4^frac1n!-1right)left(frac3^fracn!(2n)!2^frac1n!-1right)^-1$$
$$=lim_nto infty underbracesqrt[n!]2_to 1left(sqrt[n!]frac5^frac1(2n)!4-1right)left(sqrt[n!]frac3^frac1(2n)!2-1right)^-1$$
Well, yes $frac5^frac1(2n)!4$ and the other one in the denominator equals to $1$, but still I don't see how to use that limit. Also I tried to take a logarithm on both sides or to use L'hospital, but looks like a dead end.
I would love if someone can spot the trick for solving this limit and land some help.
limits factorial
$endgroup$
This problem was posted half a year ago by Pierre Mounir on a Facebook group and until now it received no answers. Since most of his problems that I saw were amazing I can bet this one it's worth the time. Wolfram returns the answer to be $2$, which is quite elegant for it's look.
I remembered about it yesterday and gave a try again taking for simplicity $k=1$ (I had no chance with a bigger number).
Also my whole idea was to somehow get to a point where I can use $limlimits_fto 0fraca^f-1f=ln a$, thus I started as:
$$lim_nto infty frac5^fracn!(2n)!-4^frac1n!3^fracn!(2n)!-2^frac1n!=lim_nto infty left(frac42right)^frac1n!left(frac5^fracn!(2n)!4^frac1n!-1right)left(frac3^fracn!(2n)!2^frac1n!-1right)^-1$$
$$=lim_nto infty underbracesqrt[n!]2_to 1left(sqrt[n!]frac5^frac1(2n)!4-1right)left(sqrt[n!]frac3^frac1(2n)!2-1right)^-1$$
Well, yes $frac5^frac1(2n)!4$ and the other one in the denominator equals to $1$, but still I don't see how to use that limit. Also I tried to take a logarithm on both sides or to use L'hospital, but looks like a dead end.
I would love if someone can spot the trick for solving this limit and land some help.
limits factorial
limits factorial
asked Apr 20 at 12:18
ZackyZacky
8,16511162
8,16511162
1
$begingroup$
Maybe it could be a good idea to use Stirling, just to spot what the limit is?
$endgroup$
– Crostul
Apr 20 at 12:23
2
$begingroup$
If the given expression is $(a-b) /(c-d) $ then $a, b, c, d$ tend to $1$ and hence they can be replaced by their logs.
$endgroup$
– Paramanand Singh
Apr 20 at 12:34
3
$begingroup$
The answer easily comes to be 2 via logs. One just needs to prove that $(n!) ^2 k /(2kn)!to 0$ which is sort of not that difficult.
$endgroup$
– Paramanand Singh
Apr 20 at 12:40
3
$begingroup$
A pedantic answerer could go ahead and use Stirling's formula, since the forbidden usage is misspelled Strirling's.
$endgroup$
– GEdgar
Apr 20 at 12:59
add a comment |
1
$begingroup$
Maybe it could be a good idea to use Stirling, just to spot what the limit is?
$endgroup$
– Crostul
Apr 20 at 12:23
2
$begingroup$
If the given expression is $(a-b) /(c-d) $ then $a, b, c, d$ tend to $1$ and hence they can be replaced by their logs.
$endgroup$
– Paramanand Singh
Apr 20 at 12:34
3
$begingroup$
The answer easily comes to be 2 via logs. One just needs to prove that $(n!) ^2 k /(2kn)!to 0$ which is sort of not that difficult.
$endgroup$
– Paramanand Singh
Apr 20 at 12:40
3
$begingroup$
A pedantic answerer could go ahead and use Stirling's formula, since the forbidden usage is misspelled Strirling's.
$endgroup$
– GEdgar
Apr 20 at 12:59
1
1
$begingroup$
Maybe it could be a good idea to use Stirling, just to spot what the limit is?
$endgroup$
– Crostul
Apr 20 at 12:23
$begingroup$
Maybe it could be a good idea to use Stirling, just to spot what the limit is?
$endgroup$
– Crostul
Apr 20 at 12:23
2
2
$begingroup$
If the given expression is $(a-b) /(c-d) $ then $a, b, c, d$ tend to $1$ and hence they can be replaced by their logs.
$endgroup$
– Paramanand Singh
Apr 20 at 12:34
$begingroup$
If the given expression is $(a-b) /(c-d) $ then $a, b, c, d$ tend to $1$ and hence they can be replaced by their logs.
$endgroup$
– Paramanand Singh
Apr 20 at 12:34
3
3
$begingroup$
The answer easily comes to be 2 via logs. One just needs to prove that $(n!) ^2 k /(2kn)!to 0$ which is sort of not that difficult.
$endgroup$
– Paramanand Singh
Apr 20 at 12:40
$begingroup$
The answer easily comes to be 2 via logs. One just needs to prove that $(n!) ^2 k /(2kn)!to 0$ which is sort of not that difficult.
$endgroup$
– Paramanand Singh
Apr 20 at 12:40
3
3
$begingroup$
A pedantic answerer could go ahead and use Stirling's formula, since the forbidden usage is misspelled Strirling's.
$endgroup$
– GEdgar
Apr 20 at 12:59
$begingroup$
A pedantic answerer could go ahead and use Stirling's formula, since the forbidden usage is misspelled Strirling's.
$endgroup$
– GEdgar
Apr 20 at 12:59
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is an expansion of my comment into an answer.
If the expression under limit is of the form $(A-B) /(C-D) $ then all of $A, B, C, D$ tend to $1$ and we can write $$A-B=Bcdotfracexp(log A-log B) - 1log A - log B cdot(log A - log B) $$ The first two factors tend to $1$ and hence the numerator can be replaced by $log A-log B$. Proceeding in similar manner we see that the expression under limit can be simplified greatly as each term gets replaced by its logarithm.
The resulting expression is $$fracalog 5-2blog 2alog 3 - blog 2$$ where $a=(n!) ^k /(2kn)!,b=(n!)^-k$ and clearly $a/b=(n!) ^2k/(2kn)!$ tends to $0$ so that the desired limit is $2$.
The limiting behavior of $a_n=(n!) ^2 k /(2kn)!$ can be concluded via ratio test. We have $$fraca_n+1a_n =frac(n+1)^2k(2kn+1)cdots(2kn+2k)tofrac1(2k)^2k<1$$ and hence $a_nto 0$.
$endgroup$
1
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
1
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
1
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
1
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
add a comment |
Your Answer
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%2f3194635%2fscary-looking-limit-with-an-elegant-answer%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$
This is an expansion of my comment into an answer.
If the expression under limit is of the form $(A-B) /(C-D) $ then all of $A, B, C, D$ tend to $1$ and we can write $$A-B=Bcdotfracexp(log A-log B) - 1log A - log B cdot(log A - log B) $$ The first two factors tend to $1$ and hence the numerator can be replaced by $log A-log B$. Proceeding in similar manner we see that the expression under limit can be simplified greatly as each term gets replaced by its logarithm.
The resulting expression is $$fracalog 5-2blog 2alog 3 - blog 2$$ where $a=(n!) ^k /(2kn)!,b=(n!)^-k$ and clearly $a/b=(n!) ^2k/(2kn)!$ tends to $0$ so that the desired limit is $2$.
The limiting behavior of $a_n=(n!) ^2 k /(2kn)!$ can be concluded via ratio test. We have $$fraca_n+1a_n =frac(n+1)^2k(2kn+1)cdots(2kn+2k)tofrac1(2k)^2k<1$$ and hence $a_nto 0$.
$endgroup$
1
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
1
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
1
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
1
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
add a comment |
$begingroup$
This is an expansion of my comment into an answer.
If the expression under limit is of the form $(A-B) /(C-D) $ then all of $A, B, C, D$ tend to $1$ and we can write $$A-B=Bcdotfracexp(log A-log B) - 1log A - log B cdot(log A - log B) $$ The first two factors tend to $1$ and hence the numerator can be replaced by $log A-log B$. Proceeding in similar manner we see that the expression under limit can be simplified greatly as each term gets replaced by its logarithm.
The resulting expression is $$fracalog 5-2blog 2alog 3 - blog 2$$ where $a=(n!) ^k /(2kn)!,b=(n!)^-k$ and clearly $a/b=(n!) ^2k/(2kn)!$ tends to $0$ so that the desired limit is $2$.
The limiting behavior of $a_n=(n!) ^2 k /(2kn)!$ can be concluded via ratio test. We have $$fraca_n+1a_n =frac(n+1)^2k(2kn+1)cdots(2kn+2k)tofrac1(2k)^2k<1$$ and hence $a_nto 0$.
$endgroup$
1
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
1
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
1
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
1
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
add a comment |
$begingroup$
This is an expansion of my comment into an answer.
If the expression under limit is of the form $(A-B) /(C-D) $ then all of $A, B, C, D$ tend to $1$ and we can write $$A-B=Bcdotfracexp(log A-log B) - 1log A - log B cdot(log A - log B) $$ The first two factors tend to $1$ and hence the numerator can be replaced by $log A-log B$. Proceeding in similar manner we see that the expression under limit can be simplified greatly as each term gets replaced by its logarithm.
The resulting expression is $$fracalog 5-2blog 2alog 3 - blog 2$$ where $a=(n!) ^k /(2kn)!,b=(n!)^-k$ and clearly $a/b=(n!) ^2k/(2kn)!$ tends to $0$ so that the desired limit is $2$.
The limiting behavior of $a_n=(n!) ^2 k /(2kn)!$ can be concluded via ratio test. We have $$fraca_n+1a_n =frac(n+1)^2k(2kn+1)cdots(2kn+2k)tofrac1(2k)^2k<1$$ and hence $a_nto 0$.
$endgroup$
This is an expansion of my comment into an answer.
If the expression under limit is of the form $(A-B) /(C-D) $ then all of $A, B, C, D$ tend to $1$ and we can write $$A-B=Bcdotfracexp(log A-log B) - 1log A - log B cdot(log A - log B) $$ The first two factors tend to $1$ and hence the numerator can be replaced by $log A-log B$. Proceeding in similar manner we see that the expression under limit can be simplified greatly as each term gets replaced by its logarithm.
The resulting expression is $$fracalog 5-2blog 2alog 3 - blog 2$$ where $a=(n!) ^k /(2kn)!,b=(n!)^-k$ and clearly $a/b=(n!) ^2k/(2kn)!$ tends to $0$ so that the desired limit is $2$.
The limiting behavior of $a_n=(n!) ^2 k /(2kn)!$ can be concluded via ratio test. We have $$fraca_n+1a_n =frac(n+1)^2k(2kn+1)cdots(2kn+2k)tofrac1(2k)^2k<1$$ and hence $a_nto 0$.
edited Apr 20 at 13:05
answered Apr 20 at 12:52
Paramanand SinghParamanand Singh
51.7k560171
51.7k560171
1
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
1
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
1
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
1
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
add a comment |
1
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
1
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
1
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
1
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
1
1
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
$begingroup$
And "$(n!) ^2k/(2kn)!$ tends to zero" does not require Stirling's formula.
$endgroup$
– GEdgar
Apr 20 at 12:58
1
1
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
$begingroup$
@GEdgar: I did not check that but it appears one can use ratio test or something similar to conclude that it tends to $0$.
$endgroup$
– Paramanand Singh
Apr 20 at 12:59
1
1
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
@GEdgar: finally added a demonstration via ratio test.
$endgroup$
– Paramanand Singh
Apr 20 at 13:05
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
$begingroup$
Uff, I should remove scary from the name since you made it look easy. I didn't realise how useful is to write $frac5^fracn!(2n)!4^frac1n!$ in the $e^log $ form. There I too tried to get into that special limit from, but taking into $limlimits_f(x)to 0fraca^f(x)-1f(x),,$ the $f(x)$ term as $log A-log B$ was clearly what I needed, thanks alot!
$endgroup$
– Zacky
Apr 20 at 13:14
1
1
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
$begingroup$
@Zacky: I am sure it would appear damn scary to many people.
$endgroup$
– Paramanand Singh
Apr 20 at 13:15
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%2f3194635%2fscary-looking-limit-with-an-elegant-answer%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
1
$begingroup$
Maybe it could be a good idea to use Stirling, just to spot what the limit is?
$endgroup$
– Crostul
Apr 20 at 12:23
2
$begingroup$
If the given expression is $(a-b) /(c-d) $ then $a, b, c, d$ tend to $1$ and hence they can be replaced by their logs.
$endgroup$
– Paramanand Singh
Apr 20 at 12:34
3
$begingroup$
The answer easily comes to be 2 via logs. One just needs to prove that $(n!) ^2 k /(2kn)!to 0$ which is sort of not that difficult.
$endgroup$
– Paramanand Singh
Apr 20 at 12:40
3
$begingroup$
A pedantic answerer could go ahead and use Stirling's formula, since the forbidden usage is misspelled Strirling's.
$endgroup$
– GEdgar
Apr 20 at 12:59