How does the binomial expansion of $(1+(1/n))^n$ equal to the partial sum sequence of $(1/n!)$? The Next CEO of Stack OverflowHow to prove that $log(x)<x$ when $x>1$?Sequence sum question: $sum_n=0^inftynk^n$How to prove series expansion for incomplete gamma function?Computing partial sumCalculate the sumHow to compute sum of sum (linear analysis)What does this binomial sum equal?Finding the sum of this series $sum (alpha x)^n$Please help me evaluate the following infinite sum: $sumlimits_k=1^inftyfrac1p_k(p_k-1)$Find the sum of the series $sum_k=1^infty frac 1(k)(k+2)(k+4)$.Peculiar Sum regarding the Reciprocal Binomial Coefficients
How to Implement Deterministic Encryption Safely in .NET
Would a completely good Muggle be able to use a wand?
Won the lottery - how do I keep the money?
Is there such a thing as a proper verb, like a proper noun?
Expectation in a stochastic differential equation
Audio Conversion With ADS1243
Is French Guiana a (hard) EU border?
Can this note be analyzed as a non-chord tone?
What does "shotgun unity" refer to here in this sentence?
free fall ellipse or parabola?
Purpose of level-shifter with same in and out voltages
What day is it again?
Calculate the Mean mean of two numbers
Can I board the first leg of the flight without having final country's visa?
Can someone explain this formula for calculating Manhattan distance?
Is it professional to write unrelated content in an almost-empty email?
Help/tips for a first time writer?
How to get the last not-null value in an ordered column of a huge table?
My ex-girlfriend uses my Apple ID to login to her iPad, do I have to give her my Apple ID password to reset it?
Does destroying a Lich's phylactery destroy the soul within it?
Why is information "lost" when it got into a black hole?
Decide between Polyglossia and Babel for LuaLaTeX in 2019
Pulling the principal components out of a DimensionReducerFunction?
Is it ok to trim down a tube patch?
How does the binomial expansion of $(1+(1/n))^n$ equal to the partial sum sequence of $(1/n!)$?
The Next CEO of Stack OverflowHow to prove that $log(x)<x$ when $x>1$?Sequence sum question: $sum_n=0^inftynk^n$How to prove series expansion for incomplete gamma function?Computing partial sumCalculate the sumHow to compute sum of sum (linear analysis)What does this binomial sum equal?Finding the sum of this series $sum (alpha x)^n$Please help me evaluate the following infinite sum: $sumlimits_k=1^inftyfrac1p_k(p_k-1)$Find the sum of the series $sum_k=1^infty frac 1(k)(k+2)(k+4)$.Peculiar Sum regarding the Reciprocal Binomial Coefficients
$begingroup$
I'm kind of confused, because I'm not sure how this expression
$$
sum_k=0^n fracn!k!(n-k)!n^k
$$
simplifies to $$
sum_k=0^n frac1k!
$$
Could anybody help me out?
sequences-and-series
$endgroup$
|
show 7 more comments
$begingroup$
I'm kind of confused, because I'm not sure how this expression
$$
sum_k=0^n fracn!k!(n-k)!n^k
$$
simplifies to $$
sum_k=0^n frac1k!
$$
Could anybody help me out?
sequences-and-series
$endgroup$
$begingroup$
What you've written doesn't make much sense as the "simplified expression" has $n$ as the index so it goes to $infty$.
$endgroup$
– Klint Qinami
Aug 20 '16 at 18:05
$begingroup$
It does not. Moreover (though it is not the crucial fact), the second sum is $+infty$, because $k$ does not depend on $n$.
$endgroup$
– user228113
Aug 20 '16 at 18:05
$begingroup$
"k" is the index in both expressions, my bad. Just edited it.
$endgroup$
– Matt24
Aug 20 '16 at 18:11
$begingroup$
In the first expression the sum goes up to $n$. In the limit $ntoinfty$ it converges to the second expression. Also each term $n choose k frac1n^k$ converges to $frac1k!$.
$endgroup$
– sometempname
Aug 20 '16 at 18:15
$begingroup$
@sometempname Hold on, how is the limit of the first expression 1/k! ?
$endgroup$
– Matt24
Aug 20 '16 at 18:25
|
show 7 more comments
$begingroup$
I'm kind of confused, because I'm not sure how this expression
$$
sum_k=0^n fracn!k!(n-k)!n^k
$$
simplifies to $$
sum_k=0^n frac1k!
$$
Could anybody help me out?
sequences-and-series
$endgroup$
I'm kind of confused, because I'm not sure how this expression
$$
sum_k=0^n fracn!k!(n-k)!n^k
$$
simplifies to $$
sum_k=0^n frac1k!
$$
Could anybody help me out?
sequences-and-series
sequences-and-series
edited Aug 20 '16 at 23:17
Michael Hardy
1
1
asked Aug 20 '16 at 17:55
Matt24Matt24
420517
420517
$begingroup$
What you've written doesn't make much sense as the "simplified expression" has $n$ as the index so it goes to $infty$.
$endgroup$
– Klint Qinami
Aug 20 '16 at 18:05
$begingroup$
It does not. Moreover (though it is not the crucial fact), the second sum is $+infty$, because $k$ does not depend on $n$.
$endgroup$
– user228113
Aug 20 '16 at 18:05
$begingroup$
"k" is the index in both expressions, my bad. Just edited it.
$endgroup$
– Matt24
Aug 20 '16 at 18:11
$begingroup$
In the first expression the sum goes up to $n$. In the limit $ntoinfty$ it converges to the second expression. Also each term $n choose k frac1n^k$ converges to $frac1k!$.
$endgroup$
– sometempname
Aug 20 '16 at 18:15
$begingroup$
@sometempname Hold on, how is the limit of the first expression 1/k! ?
$endgroup$
– Matt24
Aug 20 '16 at 18:25
|
show 7 more comments
$begingroup$
What you've written doesn't make much sense as the "simplified expression" has $n$ as the index so it goes to $infty$.
$endgroup$
– Klint Qinami
Aug 20 '16 at 18:05
$begingroup$
It does not. Moreover (though it is not the crucial fact), the second sum is $+infty$, because $k$ does not depend on $n$.
$endgroup$
– user228113
Aug 20 '16 at 18:05
$begingroup$
"k" is the index in both expressions, my bad. Just edited it.
$endgroup$
– Matt24
Aug 20 '16 at 18:11
$begingroup$
In the first expression the sum goes up to $n$. In the limit $ntoinfty$ it converges to the second expression. Also each term $n choose k frac1n^k$ converges to $frac1k!$.
$endgroup$
– sometempname
Aug 20 '16 at 18:15
$begingroup$
@sometempname Hold on, how is the limit of the first expression 1/k! ?
$endgroup$
– Matt24
Aug 20 '16 at 18:25
$begingroup$
What you've written doesn't make much sense as the "simplified expression" has $n$ as the index so it goes to $infty$.
$endgroup$
– Klint Qinami
Aug 20 '16 at 18:05
$begingroup$
What you've written doesn't make much sense as the "simplified expression" has $n$ as the index so it goes to $infty$.
$endgroup$
– Klint Qinami
Aug 20 '16 at 18:05
$begingroup$
It does not. Moreover (though it is not the crucial fact), the second sum is $+infty$, because $k$ does not depend on $n$.
$endgroup$
– user228113
Aug 20 '16 at 18:05
$begingroup$
It does not. Moreover (though it is not the crucial fact), the second sum is $+infty$, because $k$ does not depend on $n$.
$endgroup$
– user228113
Aug 20 '16 at 18:05
$begingroup$
"k" is the index in both expressions, my bad. Just edited it.
$endgroup$
– Matt24
Aug 20 '16 at 18:11
$begingroup$
"k" is the index in both expressions, my bad. Just edited it.
$endgroup$
– Matt24
Aug 20 '16 at 18:11
$begingroup$
In the first expression the sum goes up to $n$. In the limit $ntoinfty$ it converges to the second expression. Also each term $n choose k frac1n^k$ converges to $frac1k!$.
$endgroup$
– sometempname
Aug 20 '16 at 18:15
$begingroup$
In the first expression the sum goes up to $n$. In the limit $ntoinfty$ it converges to the second expression. Also each term $n choose k frac1n^k$ converges to $frac1k!$.
$endgroup$
– sometempname
Aug 20 '16 at 18:15
$begingroup$
@sometempname Hold on, how is the limit of the first expression 1/k! ?
$endgroup$
– Matt24
Aug 20 '16 at 18:25
$begingroup$
@sometempname Hold on, how is the limit of the first expression 1/k! ?
$endgroup$
– Matt24
Aug 20 '16 at 18:25
|
show 7 more comments
2 Answers
2
active
oldest
votes
$begingroup$
As Clement C. already noted, the two expressions are not equivalent. Here, we show that, in fact, $left(1+frac1nright)^nle sum_k=0^n frac1k!$ for all $nge 1$. Moreover, we show that as $nto infty$, both terms of interest approach the same value. To that end, we proceed.
First, note that using the binomial theorem, we can write
$$beginalign
left(1+frac1nright)^n&=sum_k=0^n binomnkfrac1n^k\\
&=sum_k=0^n frac1k!fracn!n^k(n-k)!\\
&=sum_k=0^n frac1k!fracn(n-1)(n-2)cdots (n-k+1)n^k\\
&=sum_k=0^n frac1k!left(frac nnright)left(fracn-1nright)left(fracn-2nright)cdots left(fracn-k+1nright)\\
&=sum_k=0^n frac1k!left(1-frac1nright)left(1-frac2nright)cdots left(1-frack-1nright)tag 1
endalign$$
Second, since all of the parenthetical terms in $(1)$ are less than $1$, we arrive at the first coveted relationship
$$bbox[5px,border:2px solid #C0A000]left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 2$$
for all $nge 1$.
Next, note that since all of the terms in the binomial expansion are positive, we have for any integer $0le p<n$
$$left(1+frac1nright)^n ge sum_k=0^p binomnkfrac1n^k tag 3$$
Putting $(2)$ and $(3)$ together yields
$$sum_k=0^p binomnkfrac1n^k le left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 4$$
Since $left(1+frac1nright)^n$ is monotonically increasing (SEE THIS ANSWER) and bounded above by the convergent series $sum_k=0^infty frac1k!$, its limit exists. Similarly, the sum on the left-hand side of $(4)$ is monotonically increasing in $n$ and bounded above. Therefore, we may take the limit of $(4)$. Proceeding, we find
$$sum_k=0^p frac1k! le lim_nto inftyleft(1+frac1nright)^n le sum_k=0^inftyfrac1k! tag 5$$
for all $p$. Since the inequality on the left-hand side of $(5)$ is true fo all $p$, we can let $pto infty$ to reveal the coveted result
$$bbox[5px,border:2px solid #C0A000]lim_nto inftyleft(1+frac1nright)^n=sum_k=0^infty frac1k!$$
$endgroup$
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
add a comment |
$begingroup$
tl;dr: the two are not equal, but have the same limit when $n$ goes to $infty$.
First: You cannot "simplify the first to get the second." The two expressions are not equal.
Compute the first few terms to check that. I am lazy, so asked a software program to do it for me. The ratio of their first 10 terms (obtained with Mathematica):
N[Table[(Sum[1/(k!), k, 0, n]/Sum[n!/(k! (n - k)! n^k), k, 0, n]), n, 1, 10] ]
1., 1.11111, 1.125, 1.10933, 1.09177, 1.0779, 1.06745, 1.05943,
1.05312, 1.04802
A plot (ditto)
DiscretePlot[Sum[1/(k!), k, 0, n], Sum[n!/(k! (n - k)! n^k), k, 0, n], n, 1, 100]

However, the two expressions do have the same limit when $ntoinfty$, namely $e$.
For the first, it is trivial based on the series definition of $e$:
$$
sum_k=0^n frac1k! xrightarrow[ntoinfty] sum_k=0^infty frac1k! = e
$$
For the second, observe that by the Binomial theorem
$$
sum_k=0^n fracn!k!(n-k)! frac1n^k
= sum_k=0^n binomnkfrac1n^k
= left(1+frac1nright)^n xrightarrow[ntoinfty] e
$$
where the last step is a standard limit (or, for some, this is the definition of $e$).
$endgroup$
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
add a comment |
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%2f1898281%2fhow-does-the-binomial-expansion-of-11-nn-equal-to-the-partial-sum-sequen%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
As Clement C. already noted, the two expressions are not equivalent. Here, we show that, in fact, $left(1+frac1nright)^nle sum_k=0^n frac1k!$ for all $nge 1$. Moreover, we show that as $nto infty$, both terms of interest approach the same value. To that end, we proceed.
First, note that using the binomial theorem, we can write
$$beginalign
left(1+frac1nright)^n&=sum_k=0^n binomnkfrac1n^k\\
&=sum_k=0^n frac1k!fracn!n^k(n-k)!\\
&=sum_k=0^n frac1k!fracn(n-1)(n-2)cdots (n-k+1)n^k\\
&=sum_k=0^n frac1k!left(frac nnright)left(fracn-1nright)left(fracn-2nright)cdots left(fracn-k+1nright)\\
&=sum_k=0^n frac1k!left(1-frac1nright)left(1-frac2nright)cdots left(1-frack-1nright)tag 1
endalign$$
Second, since all of the parenthetical terms in $(1)$ are less than $1$, we arrive at the first coveted relationship
$$bbox[5px,border:2px solid #C0A000]left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 2$$
for all $nge 1$.
Next, note that since all of the terms in the binomial expansion are positive, we have for any integer $0le p<n$
$$left(1+frac1nright)^n ge sum_k=0^p binomnkfrac1n^k tag 3$$
Putting $(2)$ and $(3)$ together yields
$$sum_k=0^p binomnkfrac1n^k le left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 4$$
Since $left(1+frac1nright)^n$ is monotonically increasing (SEE THIS ANSWER) and bounded above by the convergent series $sum_k=0^infty frac1k!$, its limit exists. Similarly, the sum on the left-hand side of $(4)$ is monotonically increasing in $n$ and bounded above. Therefore, we may take the limit of $(4)$. Proceeding, we find
$$sum_k=0^p frac1k! le lim_nto inftyleft(1+frac1nright)^n le sum_k=0^inftyfrac1k! tag 5$$
for all $p$. Since the inequality on the left-hand side of $(5)$ is true fo all $p$, we can let $pto infty$ to reveal the coveted result
$$bbox[5px,border:2px solid #C0A000]lim_nto inftyleft(1+frac1nright)^n=sum_k=0^infty frac1k!$$
$endgroup$
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
add a comment |
$begingroup$
As Clement C. already noted, the two expressions are not equivalent. Here, we show that, in fact, $left(1+frac1nright)^nle sum_k=0^n frac1k!$ for all $nge 1$. Moreover, we show that as $nto infty$, both terms of interest approach the same value. To that end, we proceed.
First, note that using the binomial theorem, we can write
$$beginalign
left(1+frac1nright)^n&=sum_k=0^n binomnkfrac1n^k\\
&=sum_k=0^n frac1k!fracn!n^k(n-k)!\\
&=sum_k=0^n frac1k!fracn(n-1)(n-2)cdots (n-k+1)n^k\\
&=sum_k=0^n frac1k!left(frac nnright)left(fracn-1nright)left(fracn-2nright)cdots left(fracn-k+1nright)\\
&=sum_k=0^n frac1k!left(1-frac1nright)left(1-frac2nright)cdots left(1-frack-1nright)tag 1
endalign$$
Second, since all of the parenthetical terms in $(1)$ are less than $1$, we arrive at the first coveted relationship
$$bbox[5px,border:2px solid #C0A000]left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 2$$
for all $nge 1$.
Next, note that since all of the terms in the binomial expansion are positive, we have for any integer $0le p<n$
$$left(1+frac1nright)^n ge sum_k=0^p binomnkfrac1n^k tag 3$$
Putting $(2)$ and $(3)$ together yields
$$sum_k=0^p binomnkfrac1n^k le left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 4$$
Since $left(1+frac1nright)^n$ is monotonically increasing (SEE THIS ANSWER) and bounded above by the convergent series $sum_k=0^infty frac1k!$, its limit exists. Similarly, the sum on the left-hand side of $(4)$ is monotonically increasing in $n$ and bounded above. Therefore, we may take the limit of $(4)$. Proceeding, we find
$$sum_k=0^p frac1k! le lim_nto inftyleft(1+frac1nright)^n le sum_k=0^inftyfrac1k! tag 5$$
for all $p$. Since the inequality on the left-hand side of $(5)$ is true fo all $p$, we can let $pto infty$ to reveal the coveted result
$$bbox[5px,border:2px solid #C0A000]lim_nto inftyleft(1+frac1nright)^n=sum_k=0^infty frac1k!$$
$endgroup$
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
add a comment |
$begingroup$
As Clement C. already noted, the two expressions are not equivalent. Here, we show that, in fact, $left(1+frac1nright)^nle sum_k=0^n frac1k!$ for all $nge 1$. Moreover, we show that as $nto infty$, both terms of interest approach the same value. To that end, we proceed.
First, note that using the binomial theorem, we can write
$$beginalign
left(1+frac1nright)^n&=sum_k=0^n binomnkfrac1n^k\\
&=sum_k=0^n frac1k!fracn!n^k(n-k)!\\
&=sum_k=0^n frac1k!fracn(n-1)(n-2)cdots (n-k+1)n^k\\
&=sum_k=0^n frac1k!left(frac nnright)left(fracn-1nright)left(fracn-2nright)cdots left(fracn-k+1nright)\\
&=sum_k=0^n frac1k!left(1-frac1nright)left(1-frac2nright)cdots left(1-frack-1nright)tag 1
endalign$$
Second, since all of the parenthetical terms in $(1)$ are less than $1$, we arrive at the first coveted relationship
$$bbox[5px,border:2px solid #C0A000]left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 2$$
for all $nge 1$.
Next, note that since all of the terms in the binomial expansion are positive, we have for any integer $0le p<n$
$$left(1+frac1nright)^n ge sum_k=0^p binomnkfrac1n^k tag 3$$
Putting $(2)$ and $(3)$ together yields
$$sum_k=0^p binomnkfrac1n^k le left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 4$$
Since $left(1+frac1nright)^n$ is monotonically increasing (SEE THIS ANSWER) and bounded above by the convergent series $sum_k=0^infty frac1k!$, its limit exists. Similarly, the sum on the left-hand side of $(4)$ is monotonically increasing in $n$ and bounded above. Therefore, we may take the limit of $(4)$. Proceeding, we find
$$sum_k=0^p frac1k! le lim_nto inftyleft(1+frac1nright)^n le sum_k=0^inftyfrac1k! tag 5$$
for all $p$. Since the inequality on the left-hand side of $(5)$ is true fo all $p$, we can let $pto infty$ to reveal the coveted result
$$bbox[5px,border:2px solid #C0A000]lim_nto inftyleft(1+frac1nright)^n=sum_k=0^infty frac1k!$$
$endgroup$
As Clement C. already noted, the two expressions are not equivalent. Here, we show that, in fact, $left(1+frac1nright)^nle sum_k=0^n frac1k!$ for all $nge 1$. Moreover, we show that as $nto infty$, both terms of interest approach the same value. To that end, we proceed.
First, note that using the binomial theorem, we can write
$$beginalign
left(1+frac1nright)^n&=sum_k=0^n binomnkfrac1n^k\\
&=sum_k=0^n frac1k!fracn!n^k(n-k)!\\
&=sum_k=0^n frac1k!fracn(n-1)(n-2)cdots (n-k+1)n^k\\
&=sum_k=0^n frac1k!left(frac nnright)left(fracn-1nright)left(fracn-2nright)cdots left(fracn-k+1nright)\\
&=sum_k=0^n frac1k!left(1-frac1nright)left(1-frac2nright)cdots left(1-frack-1nright)tag 1
endalign$$
Second, since all of the parenthetical terms in $(1)$ are less than $1$, we arrive at the first coveted relationship
$$bbox[5px,border:2px solid #C0A000]left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 2$$
for all $nge 1$.
Next, note that since all of the terms in the binomial expansion are positive, we have for any integer $0le p<n$
$$left(1+frac1nright)^n ge sum_k=0^p binomnkfrac1n^k tag 3$$
Putting $(2)$ and $(3)$ together yields
$$sum_k=0^p binomnkfrac1n^k le left(1+frac1nright)^n le sum_k=0^nfrac1k! tag 4$$
Since $left(1+frac1nright)^n$ is monotonically increasing (SEE THIS ANSWER) and bounded above by the convergent series $sum_k=0^infty frac1k!$, its limit exists. Similarly, the sum on the left-hand side of $(4)$ is monotonically increasing in $n$ and bounded above. Therefore, we may take the limit of $(4)$. Proceeding, we find
$$sum_k=0^p frac1k! le lim_nto inftyleft(1+frac1nright)^n le sum_k=0^inftyfrac1k! tag 5$$
for all $p$. Since the inequality on the left-hand side of $(5)$ is true fo all $p$, we can let $pto infty$ to reveal the coveted result
$$bbox[5px,border:2px solid #C0A000]lim_nto inftyleft(1+frac1nright)^n=sum_k=0^infty frac1k!$$
edited Mar 19 at 16:56
answered Aug 20 '16 at 23:04
Mark ViolaMark Viola
134k1278176
134k1278176
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
add a comment |
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Wow, thank you too for your reply! It's quite informative, this is definitely going to help me out a lot.
$endgroup$
– Matt24
Aug 21 '16 at 14:43
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
Nice answer. $$
$endgroup$
– Clement C.
Aug 21 '16 at 14:54
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@ClementC. Thank you! Very much appreciative. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:14
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
$begingroup$
@Matt24 You're welcome. My pleasure. -Mark
$endgroup$
– Mark Viola
Aug 21 '16 at 15:15
add a comment |
$begingroup$
tl;dr: the two are not equal, but have the same limit when $n$ goes to $infty$.
First: You cannot "simplify the first to get the second." The two expressions are not equal.
Compute the first few terms to check that. I am lazy, so asked a software program to do it for me. The ratio of their first 10 terms (obtained with Mathematica):
N[Table[(Sum[1/(k!), k, 0, n]/Sum[n!/(k! (n - k)! n^k), k, 0, n]), n, 1, 10] ]
1., 1.11111, 1.125, 1.10933, 1.09177, 1.0779, 1.06745, 1.05943,
1.05312, 1.04802
A plot (ditto)
DiscretePlot[Sum[1/(k!), k, 0, n], Sum[n!/(k! (n - k)! n^k), k, 0, n], n, 1, 100]

However, the two expressions do have the same limit when $ntoinfty$, namely $e$.
For the first, it is trivial based on the series definition of $e$:
$$
sum_k=0^n frac1k! xrightarrow[ntoinfty] sum_k=0^infty frac1k! = e
$$
For the second, observe that by the Binomial theorem
$$
sum_k=0^n fracn!k!(n-k)! frac1n^k
= sum_k=0^n binomnkfrac1n^k
= left(1+frac1nright)^n xrightarrow[ntoinfty] e
$$
where the last step is a standard limit (or, for some, this is the definition of $e$).
$endgroup$
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
add a comment |
$begingroup$
tl;dr: the two are not equal, but have the same limit when $n$ goes to $infty$.
First: You cannot "simplify the first to get the second." The two expressions are not equal.
Compute the first few terms to check that. I am lazy, so asked a software program to do it for me. The ratio of their first 10 terms (obtained with Mathematica):
N[Table[(Sum[1/(k!), k, 0, n]/Sum[n!/(k! (n - k)! n^k), k, 0, n]), n, 1, 10] ]
1., 1.11111, 1.125, 1.10933, 1.09177, 1.0779, 1.06745, 1.05943,
1.05312, 1.04802
A plot (ditto)
DiscretePlot[Sum[1/(k!), k, 0, n], Sum[n!/(k! (n - k)! n^k), k, 0, n], n, 1, 100]

However, the two expressions do have the same limit when $ntoinfty$, namely $e$.
For the first, it is trivial based on the series definition of $e$:
$$
sum_k=0^n frac1k! xrightarrow[ntoinfty] sum_k=0^infty frac1k! = e
$$
For the second, observe that by the Binomial theorem
$$
sum_k=0^n fracn!k!(n-k)! frac1n^k
= sum_k=0^n binomnkfrac1n^k
= left(1+frac1nright)^n xrightarrow[ntoinfty] e
$$
where the last step is a standard limit (or, for some, this is the definition of $e$).
$endgroup$
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
add a comment |
$begingroup$
tl;dr: the two are not equal, but have the same limit when $n$ goes to $infty$.
First: You cannot "simplify the first to get the second." The two expressions are not equal.
Compute the first few terms to check that. I am lazy, so asked a software program to do it for me. The ratio of their first 10 terms (obtained with Mathematica):
N[Table[(Sum[1/(k!), k, 0, n]/Sum[n!/(k! (n - k)! n^k), k, 0, n]), n, 1, 10] ]
1., 1.11111, 1.125, 1.10933, 1.09177, 1.0779, 1.06745, 1.05943,
1.05312, 1.04802
A plot (ditto)
DiscretePlot[Sum[1/(k!), k, 0, n], Sum[n!/(k! (n - k)! n^k), k, 0, n], n, 1, 100]

However, the two expressions do have the same limit when $ntoinfty$, namely $e$.
For the first, it is trivial based on the series definition of $e$:
$$
sum_k=0^n frac1k! xrightarrow[ntoinfty] sum_k=0^infty frac1k! = e
$$
For the second, observe that by the Binomial theorem
$$
sum_k=0^n fracn!k!(n-k)! frac1n^k
= sum_k=0^n binomnkfrac1n^k
= left(1+frac1nright)^n xrightarrow[ntoinfty] e
$$
where the last step is a standard limit (or, for some, this is the definition of $e$).
$endgroup$
tl;dr: the two are not equal, but have the same limit when $n$ goes to $infty$.
First: You cannot "simplify the first to get the second." The two expressions are not equal.
Compute the first few terms to check that. I am lazy, so asked a software program to do it for me. The ratio of their first 10 terms (obtained with Mathematica):
N[Table[(Sum[1/(k!), k, 0, n]/Sum[n!/(k! (n - k)! n^k), k, 0, n]), n, 1, 10] ]
1., 1.11111, 1.125, 1.10933, 1.09177, 1.0779, 1.06745, 1.05943,
1.05312, 1.04802
A plot (ditto)
DiscretePlot[Sum[1/(k!), k, 0, n], Sum[n!/(k! (n - k)! n^k), k, 0, n], n, 1, 100]

However, the two expressions do have the same limit when $ntoinfty$, namely $e$.
For the first, it is trivial based on the series definition of $e$:
$$
sum_k=0^n frac1k! xrightarrow[ntoinfty] sum_k=0^infty frac1k! = e
$$
For the second, observe that by the Binomial theorem
$$
sum_k=0^n fracn!k!(n-k)! frac1n^k
= sum_k=0^n binomnkfrac1n^k
= left(1+frac1nright)^n xrightarrow[ntoinfty] e
$$
where the last step is a standard limit (or, for some, this is the definition of $e$).
edited Aug 20 '16 at 19:21
answered Aug 20 '16 at 19:16
Clement C.Clement C.
51k34093
51k34093
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
add a comment |
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Awesome answer, thanks! I should've realized they weren't equal, what my professor must've said was that their limits were the same (and I didn't keep track of that).
$endgroup$
– Matt24
Aug 20 '16 at 19:39
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Glad I could help!
$endgroup$
– Clement C.
Aug 20 '16 at 19:40
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
$begingroup$
Nicely written. +1
$endgroup$
– Mark Viola
Aug 20 '16 at 20:39
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%2f1898281%2fhow-does-the-binomial-expansion-of-11-nn-equal-to-the-partial-sum-sequen%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

$begingroup$
What you've written doesn't make much sense as the "simplified expression" has $n$ as the index so it goes to $infty$.
$endgroup$
– Klint Qinami
Aug 20 '16 at 18:05
$begingroup$
It does not. Moreover (though it is not the crucial fact), the second sum is $+infty$, because $k$ does not depend on $n$.
$endgroup$
– user228113
Aug 20 '16 at 18:05
$begingroup$
"k" is the index in both expressions, my bad. Just edited it.
$endgroup$
– Matt24
Aug 20 '16 at 18:11
$begingroup$
In the first expression the sum goes up to $n$. In the limit $ntoinfty$ it converges to the second expression. Also each term $n choose k frac1n^k$ converges to $frac1k!$.
$endgroup$
– sometempname
Aug 20 '16 at 18:15
$begingroup$
@sometempname Hold on, how is the limit of the first expression 1/k! ?
$endgroup$
– Matt24
Aug 20 '16 at 18:25