Divergent infinite series $n!e^n/n^n$ - simpler proof of divergence?












1












$begingroup$


$$ sum_{n=1}^infty frac{n!e^n}{n^n} $$
Where $e$ is Euler's number.



Recently on calculus class we were covering convergence tests and my group got stuck with this infinite series. Our calculus teacher told us that it diverges but he doesn't see any elementary way or simple test to prove it. He told us something about Euler's Gamma function and said that he knows it diverges because of Stirling's formula but this is not quite our level yet.



I tried to think about it myself but I established only that this is some kind of an edge case.
We could generalize the problem to series of $frac{n!a^n}{n^n}$.
Then, from the ratio test we know that it converges for $a <e$ and diverges for $a>e$. For $a=e$ the test is inconclusive.
I've also tried to compare it with various divergent series, but nothing worked...



Does anybody have any idea for a simple solution?










share|cite|improve this question











$endgroup$












  • $begingroup$
    It would be sufficient to show that the limit of the expression for $nrightarrow infty$ is not $0$, but I have no simple idea yet.
    $endgroup$
    – Peter
    Jan 11 at 11:20










  • $begingroup$
    Maybe you can use the Stirling's approximation
    $endgroup$
    – Ixion
    Jan 11 at 11:27












  • $begingroup$
    Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem.
    $endgroup$
    – Daniele Tampieri
    Jan 11 at 11:27






  • 2




    $begingroup$
    @Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet."
    $endgroup$
    – Wojowu
    Jan 11 at 11:28










  • $begingroup$
    @Wojowu, ouch, thanks... My bad!
    $endgroup$
    – Ixion
    Jan 11 at 11:29
















1












$begingroup$


$$ sum_{n=1}^infty frac{n!e^n}{n^n} $$
Where $e$ is Euler's number.



Recently on calculus class we were covering convergence tests and my group got stuck with this infinite series. Our calculus teacher told us that it diverges but he doesn't see any elementary way or simple test to prove it. He told us something about Euler's Gamma function and said that he knows it diverges because of Stirling's formula but this is not quite our level yet.



I tried to think about it myself but I established only that this is some kind of an edge case.
We could generalize the problem to series of $frac{n!a^n}{n^n}$.
Then, from the ratio test we know that it converges for $a <e$ and diverges for $a>e$. For $a=e$ the test is inconclusive.
I've also tried to compare it with various divergent series, but nothing worked...



Does anybody have any idea for a simple solution?










share|cite|improve this question











$endgroup$












  • $begingroup$
    It would be sufficient to show that the limit of the expression for $nrightarrow infty$ is not $0$, but I have no simple idea yet.
    $endgroup$
    – Peter
    Jan 11 at 11:20










  • $begingroup$
    Maybe you can use the Stirling's approximation
    $endgroup$
    – Ixion
    Jan 11 at 11:27












  • $begingroup$
    Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem.
    $endgroup$
    – Daniele Tampieri
    Jan 11 at 11:27






  • 2




    $begingroup$
    @Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet."
    $endgroup$
    – Wojowu
    Jan 11 at 11:28










  • $begingroup$
    @Wojowu, ouch, thanks... My bad!
    $endgroup$
    – Ixion
    Jan 11 at 11:29














1












1








1





$begingroup$


$$ sum_{n=1}^infty frac{n!e^n}{n^n} $$
Where $e$ is Euler's number.



Recently on calculus class we were covering convergence tests and my group got stuck with this infinite series. Our calculus teacher told us that it diverges but he doesn't see any elementary way or simple test to prove it. He told us something about Euler's Gamma function and said that he knows it diverges because of Stirling's formula but this is not quite our level yet.



I tried to think about it myself but I established only that this is some kind of an edge case.
We could generalize the problem to series of $frac{n!a^n}{n^n}$.
Then, from the ratio test we know that it converges for $a <e$ and diverges for $a>e$. For $a=e$ the test is inconclusive.
I've also tried to compare it with various divergent series, but nothing worked...



Does anybody have any idea for a simple solution?










share|cite|improve this question











$endgroup$




$$ sum_{n=1}^infty frac{n!e^n}{n^n} $$
Where $e$ is Euler's number.



Recently on calculus class we were covering convergence tests and my group got stuck with this infinite series. Our calculus teacher told us that it diverges but he doesn't see any elementary way or simple test to prove it. He told us something about Euler's Gamma function and said that he knows it diverges because of Stirling's formula but this is not quite our level yet.



I tried to think about it myself but I established only that this is some kind of an edge case.
We could generalize the problem to series of $frac{n!a^n}{n^n}$.
Then, from the ratio test we know that it converges for $a <e$ and diverges for $a>e$. For $a=e$ the test is inconclusive.
I've also tried to compare it with various divergent series, but nothing worked...



Does anybody have any idea for a simple solution?







real-analysis calculus analysis convergence divergent-series






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 11 at 11:27









José Carlos Santos

160k22126232




160k22126232










asked Jan 11 at 11:16









SkyfallSkyfall

234




234












  • $begingroup$
    It would be sufficient to show that the limit of the expression for $nrightarrow infty$ is not $0$, but I have no simple idea yet.
    $endgroup$
    – Peter
    Jan 11 at 11:20










  • $begingroup$
    Maybe you can use the Stirling's approximation
    $endgroup$
    – Ixion
    Jan 11 at 11:27












  • $begingroup$
    Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem.
    $endgroup$
    – Daniele Tampieri
    Jan 11 at 11:27






  • 2




    $begingroup$
    @Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet."
    $endgroup$
    – Wojowu
    Jan 11 at 11:28










  • $begingroup$
    @Wojowu, ouch, thanks... My bad!
    $endgroup$
    – Ixion
    Jan 11 at 11:29


















  • $begingroup$
    It would be sufficient to show that the limit of the expression for $nrightarrow infty$ is not $0$, but I have no simple idea yet.
    $endgroup$
    – Peter
    Jan 11 at 11:20










  • $begingroup$
    Maybe you can use the Stirling's approximation
    $endgroup$
    – Ixion
    Jan 11 at 11:27












  • $begingroup$
    Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem.
    $endgroup$
    – Daniele Tampieri
    Jan 11 at 11:27






  • 2




    $begingroup$
    @Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet."
    $endgroup$
    – Wojowu
    Jan 11 at 11:28










  • $begingroup$
    @Wojowu, ouch, thanks... My bad!
    $endgroup$
    – Ixion
    Jan 11 at 11:29
















$begingroup$
It would be sufficient to show that the limit of the expression for $nrightarrow infty$ is not $0$, but I have no simple idea yet.
$endgroup$
– Peter
Jan 11 at 11:20




$begingroup$
It would be sufficient to show that the limit of the expression for $nrightarrow infty$ is not $0$, but I have no simple idea yet.
$endgroup$
– Peter
Jan 11 at 11:20












$begingroup$
Maybe you can use the Stirling's approximation
$endgroup$
– Ixion
Jan 11 at 11:27






$begingroup$
Maybe you can use the Stirling's approximation
$endgroup$
– Ixion
Jan 11 at 11:27














$begingroup$
Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem.
$endgroup$
– Daniele Tampieri
Jan 11 at 11:27




$begingroup$
Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem.
$endgroup$
– Daniele Tampieri
Jan 11 at 11:27




2




2




$begingroup$
@Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet."
$endgroup$
– Wojowu
Jan 11 at 11:28




$begingroup$
@Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet."
$endgroup$
– Wojowu
Jan 11 at 11:28












$begingroup$
@Wojowu, ouch, thanks... My bad!
$endgroup$
– Ixion
Jan 11 at 11:29




$begingroup$
@Wojowu, ouch, thanks... My bad!
$endgroup$
– Ixion
Jan 11 at 11:29










1 Answer
1






active

oldest

votes


















3












$begingroup$

Note
$$frac{(n+1)!e^{n+1}/(n+1)^{n+1}}{n!e^n/n^n}=frac{(n+1)e}{(n+1)^{n+1}/n^n}=frac{e}{(n+1)^n/n}=frac{e}{(1+1/n)^n}>1$$
since $e>(1+1/n)^n$ for all $n$. It follows that
$$frac{(n+1)!e^{n+1}}{(n+1)^{n+1}}>frac{n!e^n}{n^n},$$
so the terms of this series are increasing, hence do not tend to zero, thus the series is divergent.



Now, perhaps your teacher meant $frac{n^n}{n!e^n}$, as then the series would still be divergent, but the terms do go to zero. However, there is a trick to make it work -- multiply the terms by $n$. By repeating a calculation like above, from $e<(1+1/n)^{n+1}$ it follows that the seqence $ncdotfrac{n^n}{n!e^n}$ is increasing, so all its terms are at least as large as the first one, equal to $1/e$. Hence $frac{n^n}{n!e^n}geqfrac{1}{en}$, and by divergence of harmonic series this series diverges too.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
    $endgroup$
    – Skyfall
    Jan 12 at 9:49










  • $begingroup$
    @Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
    $endgroup$
    – Wojowu
    Jan 12 at 9:55











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%2f3069728%2fdivergent-infinite-series-nen-nn-simpler-proof-of-divergence%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









3












$begingroup$

Note
$$frac{(n+1)!e^{n+1}/(n+1)^{n+1}}{n!e^n/n^n}=frac{(n+1)e}{(n+1)^{n+1}/n^n}=frac{e}{(n+1)^n/n}=frac{e}{(1+1/n)^n}>1$$
since $e>(1+1/n)^n$ for all $n$. It follows that
$$frac{(n+1)!e^{n+1}}{(n+1)^{n+1}}>frac{n!e^n}{n^n},$$
so the terms of this series are increasing, hence do not tend to zero, thus the series is divergent.



Now, perhaps your teacher meant $frac{n^n}{n!e^n}$, as then the series would still be divergent, but the terms do go to zero. However, there is a trick to make it work -- multiply the terms by $n$. By repeating a calculation like above, from $e<(1+1/n)^{n+1}$ it follows that the seqence $ncdotfrac{n^n}{n!e^n}$ is increasing, so all its terms are at least as large as the first one, equal to $1/e$. Hence $frac{n^n}{n!e^n}geqfrac{1}{en}$, and by divergence of harmonic series this series diverges too.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
    $endgroup$
    – Skyfall
    Jan 12 at 9:49










  • $begingroup$
    @Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
    $endgroup$
    – Wojowu
    Jan 12 at 9:55
















3












$begingroup$

Note
$$frac{(n+1)!e^{n+1}/(n+1)^{n+1}}{n!e^n/n^n}=frac{(n+1)e}{(n+1)^{n+1}/n^n}=frac{e}{(n+1)^n/n}=frac{e}{(1+1/n)^n}>1$$
since $e>(1+1/n)^n$ for all $n$. It follows that
$$frac{(n+1)!e^{n+1}}{(n+1)^{n+1}}>frac{n!e^n}{n^n},$$
so the terms of this series are increasing, hence do not tend to zero, thus the series is divergent.



Now, perhaps your teacher meant $frac{n^n}{n!e^n}$, as then the series would still be divergent, but the terms do go to zero. However, there is a trick to make it work -- multiply the terms by $n$. By repeating a calculation like above, from $e<(1+1/n)^{n+1}$ it follows that the seqence $ncdotfrac{n^n}{n!e^n}$ is increasing, so all its terms are at least as large as the first one, equal to $1/e$. Hence $frac{n^n}{n!e^n}geqfrac{1}{en}$, and by divergence of harmonic series this series diverges too.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
    $endgroup$
    – Skyfall
    Jan 12 at 9:49










  • $begingroup$
    @Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
    $endgroup$
    – Wojowu
    Jan 12 at 9:55














3












3








3





$begingroup$

Note
$$frac{(n+1)!e^{n+1}/(n+1)^{n+1}}{n!e^n/n^n}=frac{(n+1)e}{(n+1)^{n+1}/n^n}=frac{e}{(n+1)^n/n}=frac{e}{(1+1/n)^n}>1$$
since $e>(1+1/n)^n$ for all $n$. It follows that
$$frac{(n+1)!e^{n+1}}{(n+1)^{n+1}}>frac{n!e^n}{n^n},$$
so the terms of this series are increasing, hence do not tend to zero, thus the series is divergent.



Now, perhaps your teacher meant $frac{n^n}{n!e^n}$, as then the series would still be divergent, but the terms do go to zero. However, there is a trick to make it work -- multiply the terms by $n$. By repeating a calculation like above, from $e<(1+1/n)^{n+1}$ it follows that the seqence $ncdotfrac{n^n}{n!e^n}$ is increasing, so all its terms are at least as large as the first one, equal to $1/e$. Hence $frac{n^n}{n!e^n}geqfrac{1}{en}$, and by divergence of harmonic series this series diverges too.






share|cite|improve this answer









$endgroup$



Note
$$frac{(n+1)!e^{n+1}/(n+1)^{n+1}}{n!e^n/n^n}=frac{(n+1)e}{(n+1)^{n+1}/n^n}=frac{e}{(n+1)^n/n}=frac{e}{(1+1/n)^n}>1$$
since $e>(1+1/n)^n$ for all $n$. It follows that
$$frac{(n+1)!e^{n+1}}{(n+1)^{n+1}}>frac{n!e^n}{n^n},$$
so the terms of this series are increasing, hence do not tend to zero, thus the series is divergent.



Now, perhaps your teacher meant $frac{n^n}{n!e^n}$, as then the series would still be divergent, but the terms do go to zero. However, there is a trick to make it work -- multiply the terms by $n$. By repeating a calculation like above, from $e<(1+1/n)^{n+1}$ it follows that the seqence $ncdotfrac{n^n}{n!e^n}$ is increasing, so all its terms are at least as large as the first one, equal to $1/e$. Hence $frac{n^n}{n!e^n}geqfrac{1}{en}$, and by divergence of harmonic series this series diverges too.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 11 at 11:27









WojowuWojowu

17.8k22668




17.8k22668












  • $begingroup$
    Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
    $endgroup$
    – Skyfall
    Jan 12 at 9:49










  • $begingroup$
    @Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
    $endgroup$
    – Wojowu
    Jan 12 at 9:55


















  • $begingroup$
    Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
    $endgroup$
    – Skyfall
    Jan 12 at 9:49










  • $begingroup$
    @Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
    $endgroup$
    – Wojowu
    Jan 12 at 9:55
















$begingroup$
Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
$endgroup$
– Skyfall
Jan 12 at 9:49




$begingroup$
Hey, thank you for the answer! Everything here seems working to me. During our classes we were using only versions with limits of all tests. I send your answer to my teacher and his response is that he has to think about it but he thinks there's a loophole here as what you just did is basicly a ratio test and it's inconclusive when the limit of the ratio as n approaches infinity equals 1. He says we have to prove divergence for all terms up to infinity and the limit to infinity here gives you 1 which is making the test inconclusive here.
$endgroup$
– Skyfall
Jan 12 at 9:49












$begingroup$
@Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
$endgroup$
– Wojowu
Jan 12 at 9:55




$begingroup$
@Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>dots>a_1$. Hence $sum_{n=1}^ka_ngeqsum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof.
$endgroup$
– Wojowu
Jan 12 at 9:55


















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%2f3069728%2fdivergent-infinite-series-nen-nn-simpler-proof-of-divergence%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

MongoDB - Not Authorized To Execute Command

Npm cannot find a required file even through it is in the searched directory

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith