Evaluating $lim_{ntoinfty}sqrt[n]frac{prod_{k=1}^{n}(2n+k)}{n^n}$











up vote
0
down vote

favorite













How to find $$lim_{ntoinfty} sqrt[n]frac{prod_{k=1}^{n}(2n+k)}{n^n}quad ?$$




Wolfram Alpha says that it's $frac{27}{4{e}}$, but I fail to arrive at this result.



Methods allowed in my class so far are pretty limited - I've tried treating the product in the numerator as a polynomial (it's a product of n linear terms) and finding the coefficient at $n^n$, the highest power - but it seems to be the wrong approach. May anyone help me, please?










share|cite|improve this question




















  • 1




    Looks like a Riemann sum if you take logarithm of $$prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}$$
    – StubbornAtom
    Nov 16 at 3:22












  • Sorry, take logarithm of $$left[prod_{k=1}^nleft( frac{2n+k}{n}right)right]^{1/n} $$ and then take the limit.
    – StubbornAtom
    Nov 16 at 3:30















up vote
0
down vote

favorite













How to find $$lim_{ntoinfty} sqrt[n]frac{prod_{k=1}^{n}(2n+k)}{n^n}quad ?$$




Wolfram Alpha says that it's $frac{27}{4{e}}$, but I fail to arrive at this result.



Methods allowed in my class so far are pretty limited - I've tried treating the product in the numerator as a polynomial (it's a product of n linear terms) and finding the coefficient at $n^n$, the highest power - but it seems to be the wrong approach. May anyone help me, please?










share|cite|improve this question




















  • 1




    Looks like a Riemann sum if you take logarithm of $$prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}$$
    – StubbornAtom
    Nov 16 at 3:22












  • Sorry, take logarithm of $$left[prod_{k=1}^nleft( frac{2n+k}{n}right)right]^{1/n} $$ and then take the limit.
    – StubbornAtom
    Nov 16 at 3:30













up vote
0
down vote

favorite









up vote
0
down vote

favorite












How to find $$lim_{ntoinfty} sqrt[n]frac{prod_{k=1}^{n}(2n+k)}{n^n}quad ?$$




Wolfram Alpha says that it's $frac{27}{4{e}}$, but I fail to arrive at this result.



Methods allowed in my class so far are pretty limited - I've tried treating the product in the numerator as a polynomial (it's a product of n linear terms) and finding the coefficient at $n^n$, the highest power - but it seems to be the wrong approach. May anyone help me, please?










share|cite|improve this question
















How to find $$lim_{ntoinfty} sqrt[n]frac{prod_{k=1}^{n}(2n+k)}{n^n}quad ?$$




Wolfram Alpha says that it's $frac{27}{4{e}}$, but I fail to arrive at this result.



Methods allowed in my class so far are pretty limited - I've tried treating the product in the numerator as a polynomial (it's a product of n linear terms) and finding the coefficient at $n^n$, the highest power - but it seems to be the wrong approach. May anyone help me, please?







calculus real-analysis limits






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 16 at 14:50









StubbornAtom

4,86911137




4,86911137










asked Nov 16 at 3:14









Bag of Chips

864




864








  • 1




    Looks like a Riemann sum if you take logarithm of $$prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}$$
    – StubbornAtom
    Nov 16 at 3:22












  • Sorry, take logarithm of $$left[prod_{k=1}^nleft( frac{2n+k}{n}right)right]^{1/n} $$ and then take the limit.
    – StubbornAtom
    Nov 16 at 3:30














  • 1




    Looks like a Riemann sum if you take logarithm of $$prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}$$
    – StubbornAtom
    Nov 16 at 3:22












  • Sorry, take logarithm of $$left[prod_{k=1}^nleft( frac{2n+k}{n}right)right]^{1/n} $$ and then take the limit.
    – StubbornAtom
    Nov 16 at 3:30








1




1




Looks like a Riemann sum if you take logarithm of $$prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}$$
– StubbornAtom
Nov 16 at 3:22






Looks like a Riemann sum if you take logarithm of $$prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}$$
– StubbornAtom
Nov 16 at 3:22














Sorry, take logarithm of $$left[prod_{k=1}^nleft( frac{2n+k}{n}right)right]^{1/n} $$ and then take the limit.
– StubbornAtom
Nov 16 at 3:30




Sorry, take logarithm of $$left[prod_{k=1}^nleft( frac{2n+k}{n}right)right]^{1/n} $$ and then take the limit.
– StubbornAtom
Nov 16 at 3:30










1 Answer
1






active

oldest

votes

















up vote
5
down vote













Not too bad after taking the log,
$$logleft(lim_{ntoinfty}prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}right) = lim_{ntoinfty}sum_{k=1}^nfrac{1}{n}logleft(2+tfrac{k}{n}right) = int_0^1log(2+x)dx$$
Should be able to do the rest from here.






share|cite|improve this answer





















  • Of course, order of taking log and limit does not matter.
    – StubbornAtom
    Nov 16 at 14:48











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',
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%2f3000668%2fevaluating-lim-n-to-infty-sqrtn-frac-prod-k-1n2nknn%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








up vote
5
down vote













Not too bad after taking the log,
$$logleft(lim_{ntoinfty}prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}right) = lim_{ntoinfty}sum_{k=1}^nfrac{1}{n}logleft(2+tfrac{k}{n}right) = int_0^1log(2+x)dx$$
Should be able to do the rest from here.






share|cite|improve this answer





















  • Of course, order of taking log and limit does not matter.
    – StubbornAtom
    Nov 16 at 14:48















up vote
5
down vote













Not too bad after taking the log,
$$logleft(lim_{ntoinfty}prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}right) = lim_{ntoinfty}sum_{k=1}^nfrac{1}{n}logleft(2+tfrac{k}{n}right) = int_0^1log(2+x)dx$$
Should be able to do the rest from here.






share|cite|improve this answer





















  • Of course, order of taking log and limit does not matter.
    – StubbornAtom
    Nov 16 at 14:48













up vote
5
down vote










up vote
5
down vote









Not too bad after taking the log,
$$logleft(lim_{ntoinfty}prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}right) = lim_{ntoinfty}sum_{k=1}^nfrac{1}{n}logleft(2+tfrac{k}{n}right) = int_0^1log(2+x)dx$$
Should be able to do the rest from here.






share|cite|improve this answer












Not too bad after taking the log,
$$logleft(lim_{ntoinfty}prod_{k=1}^nleft( frac{2n+k}{n}right)^{1/n}right) = lim_{ntoinfty}sum_{k=1}^nfrac{1}{n}logleft(2+tfrac{k}{n}right) = int_0^1log(2+x)dx$$
Should be able to do the rest from here.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 16 at 3:32









Nicholas Parris

1182




1182












  • Of course, order of taking log and limit does not matter.
    – StubbornAtom
    Nov 16 at 14:48


















  • Of course, order of taking log and limit does not matter.
    – StubbornAtom
    Nov 16 at 14:48
















Of course, order of taking log and limit does not matter.
– StubbornAtom
Nov 16 at 14:48




Of course, order of taking log and limit does not matter.
– StubbornAtom
Nov 16 at 14:48


















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3000668%2fevaluating-lim-n-to-infty-sqrtn-frac-prod-k-1n2nknn%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

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei