Finding sum to infinity [duplicate]
Clash Royale CLAN TAG#URR8PPP
$begingroup$
This question already has an answer here:
What's the value of $sumlimits_k=1^inftyfrack^2k!$?
5 answers
I am trying to find what this value will converge to
$$sum_n = 1^ inftyfracn^2n!$$
I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.
Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?
calculus sequences-and-series taylor-expansion
$endgroup$
marked as duplicate by lab bhattacharjee
StackExchange.ready(function()
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();
);
);
);
Jan 19 at 4:04
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
$begingroup$
This question already has an answer here:
What's the value of $sumlimits_k=1^inftyfrack^2k!$?
5 answers
I am trying to find what this value will converge to
$$sum_n = 1^ inftyfracn^2n!$$
I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.
Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?
calculus sequences-and-series taylor-expansion
$endgroup$
marked as duplicate by lab bhattacharjee
StackExchange.ready(function()
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();
);
);
);
Jan 19 at 4:04
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
$begingroup$
In general, $$ sum_n=0^infty fracn^kn! = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
Jan 19 at 2:43
$begingroup$
If $R>0$ and a power series $sum_j=0^inftya_jx^j$ converges to $f(x)$ for each $xin (-R,R)$ then $f$ is differentiable on $(-R,R)$ and $sum_j=1^inftyja_jx^j-1 =f'(x)$ for all $(-R,R).$ Notice also that the previous sentence now applies with $f$ replaced by $f'$. For example, for $|x|<2$ let $f(x) =1/(1-x)=sum_j=0^inftyx^j .$ Then $sum_j=1^inftyjx^j-1=f'(x)=1/(1-x)^2,$ and $sum_j=2^inftyj(j-1)x^j-2=f''(x)=2/(1-x)^3.$
$endgroup$
– DanielWainfleet
Jan 19 at 3:33
$begingroup$
See : math.stackexchange.com/questions/1711318/…
$endgroup$
– lab bhattacharjee
Jan 19 at 4:05
add a comment |
$begingroup$
This question already has an answer here:
What's the value of $sumlimits_k=1^inftyfrack^2k!$?
5 answers
I am trying to find what this value will converge to
$$sum_n = 1^ inftyfracn^2n!$$
I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.
Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?
calculus sequences-and-series taylor-expansion
$endgroup$
This question already has an answer here:
What's the value of $sumlimits_k=1^inftyfrack^2k!$?
5 answers
I am trying to find what this value will converge to
$$sum_n = 1^ inftyfracn^2n!$$
I tried using the Taylor series for $e^x$ but couldn’t figure out how to manipulate it to get the above expression, can someone help me out.
Edit: I have seen the solution, the manipulation required didn’t come to me, is there any resource that you guys can tell me about where I can find/practice more questions like this?
This question already has an answer here:
What's the value of $sumlimits_k=1^inftyfrack^2k!$?
5 answers
calculus sequences-and-series taylor-expansion
calculus sequences-and-series taylor-expansion
edited Jan 19 at 2:53
user601297
asked Jan 19 at 2:32
user601297user601297
31419
31419
marked as duplicate by lab bhattacharjee
StackExchange.ready(function()
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();
);
);
);
Jan 19 at 4:04
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
marked as duplicate by lab bhattacharjee
StackExchange.ready(function()
if (StackExchange.options.isMobile) return;
$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');
$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();
);
);
);
Jan 19 at 4:04
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
$begingroup$
In general, $$ sum_n=0^infty fracn^kn! = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
Jan 19 at 2:43
$begingroup$
If $R>0$ and a power series $sum_j=0^inftya_jx^j$ converges to $f(x)$ for each $xin (-R,R)$ then $f$ is differentiable on $(-R,R)$ and $sum_j=1^inftyja_jx^j-1 =f'(x)$ for all $(-R,R).$ Notice also that the previous sentence now applies with $f$ replaced by $f'$. For example, for $|x|<2$ let $f(x) =1/(1-x)=sum_j=0^inftyx^j .$ Then $sum_j=1^inftyjx^j-1=f'(x)=1/(1-x)^2,$ and $sum_j=2^inftyj(j-1)x^j-2=f''(x)=2/(1-x)^3.$
$endgroup$
– DanielWainfleet
Jan 19 at 3:33
$begingroup$
See : math.stackexchange.com/questions/1711318/…
$endgroup$
– lab bhattacharjee
Jan 19 at 4:05
add a comment |
$begingroup$
In general, $$ sum_n=0^infty fracn^kn! = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
Jan 19 at 2:43
$begingroup$
If $R>0$ and a power series $sum_j=0^inftya_jx^j$ converges to $f(x)$ for each $xin (-R,R)$ then $f$ is differentiable on $(-R,R)$ and $sum_j=1^inftyja_jx^j-1 =f'(x)$ for all $(-R,R).$ Notice also that the previous sentence now applies with $f$ replaced by $f'$. For example, for $|x|<2$ let $f(x) =1/(1-x)=sum_j=0^inftyx^j .$ Then $sum_j=1^inftyjx^j-1=f'(x)=1/(1-x)^2,$ and $sum_j=2^inftyj(j-1)x^j-2=f''(x)=2/(1-x)^3.$
$endgroup$
– DanielWainfleet
Jan 19 at 3:33
$begingroup$
See : math.stackexchange.com/questions/1711318/…
$endgroup$
– lab bhattacharjee
Jan 19 at 4:05
$begingroup$
In general, $$ sum_n=0^infty fracn^kn! = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
Jan 19 at 2:43
$begingroup$
In general, $$ sum_n=0^infty fracn^kn! = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
Jan 19 at 2:43
$begingroup$
If $R>0$ and a power series $sum_j=0^inftya_jx^j$ converges to $f(x)$ for each $xin (-R,R)$ then $f$ is differentiable on $(-R,R)$ and $sum_j=1^inftyja_jx^j-1 =f'(x)$ for all $(-R,R).$ Notice also that the previous sentence now applies with $f$ replaced by $f'$. For example, for $|x|<2$ let $f(x) =1/(1-x)=sum_j=0^inftyx^j .$ Then $sum_j=1^inftyjx^j-1=f'(x)=1/(1-x)^2,$ and $sum_j=2^inftyj(j-1)x^j-2=f''(x)=2/(1-x)^3.$
$endgroup$
– DanielWainfleet
Jan 19 at 3:33
$begingroup$
If $R>0$ and a power series $sum_j=0^inftya_jx^j$ converges to $f(x)$ for each $xin (-R,R)$ then $f$ is differentiable on $(-R,R)$ and $sum_j=1^inftyja_jx^j-1 =f'(x)$ for all $(-R,R).$ Notice also that the previous sentence now applies with $f$ replaced by $f'$. For example, for $|x|<2$ let $f(x) =1/(1-x)=sum_j=0^inftyx^j .$ Then $sum_j=1^inftyjx^j-1=f'(x)=1/(1-x)^2,$ and $sum_j=2^inftyj(j-1)x^j-2=f''(x)=2/(1-x)^3.$
$endgroup$
– DanielWainfleet
Jan 19 at 3:33
$begingroup$
See : math.stackexchange.com/questions/1711318/…
$endgroup$
– lab bhattacharjee
Jan 19 at 4:05
$begingroup$
See : math.stackexchange.com/questions/1711318/…
$endgroup$
– lab bhattacharjee
Jan 19 at 4:05
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
One may write
beginalign
sum_n = 1^ inftyfracn^2n!&=sum_n = 1^ inftyfracn(n-1)+nn!
\\&=sum_n = 1^ inftyfracn(n-1)n!+sum_n = 1^ inftyfracnn!
\\&=sum_n = 2^ inftyfrac1(n-2)!+sum_n = 1^ inftyfrac1(n-1)!
endalignCan you take it from here?
$endgroup$
2
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
add a comment |
$begingroup$
Just to give a slightly different approach,
$$sum_n=1^inftyn^2over n!=sum_n=1^inftynover(n-1)!=sum_m=0^inftym+1over m!=sum_m=0^inftymover m!+e=sum_m=1^inftymover m!+e=sum_m=1^infty1over(m-1)!+e=sum_k=0^infty1over k!+e=e+e$$
The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.
$endgroup$
add a comment |
$begingroup$
$$e^x-1=sum_ngeq1fracx^nn!$$
Taking $d/dx$ on both sides,
$$e^x=sum_ngeq1fracnn!x^n-1$$
Multiplying both sides by $x$,
$$xe^x=sum_ngeq1fracnn!x^n$$
Then taking $d/dx$ on both sides again,
$$(x+1)e^x=sum_ngeq1fracn^2n!x^n-1$$
Then plug in $x=1$:
$$sum_ngeq1fracn^2n!=2e$$
Edit
This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfracddx$ operator $k$ times. Example:
$$e^x-1=sum_ngeq1fracx^nn!$$
Apply $xfracddx$:
$$xe^x=sum_ngeq1fracxn!x^n$$
Apply $xfracddx$:
$$x(x+1)e^x=sum_ngeq1fracn^2n!x^n$$
The pattern continues:
$$left(xfracddxright)^k[e^x-1]=sum_ngeq1fracn^kn!x^n$$
A similar thing can be done with integration. Example:
Evaluate $$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)$$
Start by recalling that (use geometric series)
$$frac11+t^2=sum_ngeq0(-1)^nt^2n$$
Then integrate both sides from $0$ to $x$ to get
$$arctan x=sum_ngeq0frac(-1)^n2n+1x^2n+1$$
integrate both sides from $0$ to $1$ now to produce
$$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)=fracpi4-frac12log2$$
$endgroup$
1
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
One may write
beginalign
sum_n = 1^ inftyfracn^2n!&=sum_n = 1^ inftyfracn(n-1)+nn!
\\&=sum_n = 1^ inftyfracn(n-1)n!+sum_n = 1^ inftyfracnn!
\\&=sum_n = 2^ inftyfrac1(n-2)!+sum_n = 1^ inftyfrac1(n-1)!
endalignCan you take it from here?
$endgroup$
2
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
add a comment |
$begingroup$
One may write
beginalign
sum_n = 1^ inftyfracn^2n!&=sum_n = 1^ inftyfracn(n-1)+nn!
\\&=sum_n = 1^ inftyfracn(n-1)n!+sum_n = 1^ inftyfracnn!
\\&=sum_n = 2^ inftyfrac1(n-2)!+sum_n = 1^ inftyfrac1(n-1)!
endalignCan you take it from here?
$endgroup$
2
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
add a comment |
$begingroup$
One may write
beginalign
sum_n = 1^ inftyfracn^2n!&=sum_n = 1^ inftyfracn(n-1)+nn!
\\&=sum_n = 1^ inftyfracn(n-1)n!+sum_n = 1^ inftyfracnn!
\\&=sum_n = 2^ inftyfrac1(n-2)!+sum_n = 1^ inftyfrac1(n-1)!
endalignCan you take it from here?
$endgroup$
One may write
beginalign
sum_n = 1^ inftyfracn^2n!&=sum_n = 1^ inftyfracn(n-1)+nn!
\\&=sum_n = 1^ inftyfracn(n-1)n!+sum_n = 1^ inftyfracnn!
\\&=sum_n = 2^ inftyfrac1(n-2)!+sum_n = 1^ inftyfrac1(n-1)!
endalignCan you take it from here?
answered Jan 19 at 2:36
Olivier OloaOlivier Oloa
108k17177294
108k17177294
2
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
add a comment |
2
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
2
2
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Further hints: Since $e^1 = sum_n=0^infty frac1n!$, we have $$ sum_n=2^infty frac1(n-2)!= 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ and $$ sum_n=1^infty frac1(n-1)! = 1 + frac12 + frac13! + .... = sum_n=0^infty frac1n! $$ So, ans: $boxed 2 mathrme $
$endgroup$
– Jimmy Sabater
Jan 19 at 2:39
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
$begingroup$
Ok both expressions sum to $e$, i get it, thanks a lot
$endgroup$
– user601297
Jan 19 at 2:45
add a comment |
$begingroup$
Just to give a slightly different approach,
$$sum_n=1^inftyn^2over n!=sum_n=1^inftynover(n-1)!=sum_m=0^inftym+1over m!=sum_m=0^inftymover m!+e=sum_m=1^inftymover m!+e=sum_m=1^infty1over(m-1)!+e=sum_k=0^infty1over k!+e=e+e$$
The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.
$endgroup$
add a comment |
$begingroup$
Just to give a slightly different approach,
$$sum_n=1^inftyn^2over n!=sum_n=1^inftynover(n-1)!=sum_m=0^inftym+1over m!=sum_m=0^inftymover m!+e=sum_m=1^inftymover m!+e=sum_m=1^infty1over(m-1)!+e=sum_k=0^infty1over k!+e=e+e$$
The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.
$endgroup$
add a comment |
$begingroup$
Just to give a slightly different approach,
$$sum_n=1^inftyn^2over n!=sum_n=1^inftynover(n-1)!=sum_m=0^inftym+1over m!=sum_m=0^inftymover m!+e=sum_m=1^inftymover m!+e=sum_m=1^infty1over(m-1)!+e=sum_k=0^infty1over k!+e=e+e$$
The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.
$endgroup$
Just to give a slightly different approach,
$$sum_n=1^inftyn^2over n!=sum_n=1^inftynover(n-1)!=sum_m=0^inftym+1over m!=sum_m=0^inftymover m!+e=sum_m=1^inftymover m!+e=sum_m=1^infty1over(m-1)!+e=sum_k=0^infty1over k!+e=e+e$$
The trick in reading this is to note what changes across each equal sign as you proceed from left to right and understand what justifies the equality for each change.
answered Jan 19 at 3:03
Barry CipraBarry Cipra
59.5k653126
59.5k653126
add a comment |
add a comment |
$begingroup$
$$e^x-1=sum_ngeq1fracx^nn!$$
Taking $d/dx$ on both sides,
$$e^x=sum_ngeq1fracnn!x^n-1$$
Multiplying both sides by $x$,
$$xe^x=sum_ngeq1fracnn!x^n$$
Then taking $d/dx$ on both sides again,
$$(x+1)e^x=sum_ngeq1fracn^2n!x^n-1$$
Then plug in $x=1$:
$$sum_ngeq1fracn^2n!=2e$$
Edit
This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfracddx$ operator $k$ times. Example:
$$e^x-1=sum_ngeq1fracx^nn!$$
Apply $xfracddx$:
$$xe^x=sum_ngeq1fracxn!x^n$$
Apply $xfracddx$:
$$x(x+1)e^x=sum_ngeq1fracn^2n!x^n$$
The pattern continues:
$$left(xfracddxright)^k[e^x-1]=sum_ngeq1fracn^kn!x^n$$
A similar thing can be done with integration. Example:
Evaluate $$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)$$
Start by recalling that (use geometric series)
$$frac11+t^2=sum_ngeq0(-1)^nt^2n$$
Then integrate both sides from $0$ to $x$ to get
$$arctan x=sum_ngeq0frac(-1)^n2n+1x^2n+1$$
integrate both sides from $0$ to $1$ now to produce
$$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)=fracpi4-frac12log2$$
$endgroup$
1
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
add a comment |
$begingroup$
$$e^x-1=sum_ngeq1fracx^nn!$$
Taking $d/dx$ on both sides,
$$e^x=sum_ngeq1fracnn!x^n-1$$
Multiplying both sides by $x$,
$$xe^x=sum_ngeq1fracnn!x^n$$
Then taking $d/dx$ on both sides again,
$$(x+1)e^x=sum_ngeq1fracn^2n!x^n-1$$
Then plug in $x=1$:
$$sum_ngeq1fracn^2n!=2e$$
Edit
This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfracddx$ operator $k$ times. Example:
$$e^x-1=sum_ngeq1fracx^nn!$$
Apply $xfracddx$:
$$xe^x=sum_ngeq1fracxn!x^n$$
Apply $xfracddx$:
$$x(x+1)e^x=sum_ngeq1fracn^2n!x^n$$
The pattern continues:
$$left(xfracddxright)^k[e^x-1]=sum_ngeq1fracn^kn!x^n$$
A similar thing can be done with integration. Example:
Evaluate $$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)$$
Start by recalling that (use geometric series)
$$frac11+t^2=sum_ngeq0(-1)^nt^2n$$
Then integrate both sides from $0$ to $x$ to get
$$arctan x=sum_ngeq0frac(-1)^n2n+1x^2n+1$$
integrate both sides from $0$ to $1$ now to produce
$$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)=fracpi4-frac12log2$$
$endgroup$
1
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
add a comment |
$begingroup$
$$e^x-1=sum_ngeq1fracx^nn!$$
Taking $d/dx$ on both sides,
$$e^x=sum_ngeq1fracnn!x^n-1$$
Multiplying both sides by $x$,
$$xe^x=sum_ngeq1fracnn!x^n$$
Then taking $d/dx$ on both sides again,
$$(x+1)e^x=sum_ngeq1fracn^2n!x^n-1$$
Then plug in $x=1$:
$$sum_ngeq1fracn^2n!=2e$$
Edit
This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfracddx$ operator $k$ times. Example:
$$e^x-1=sum_ngeq1fracx^nn!$$
Apply $xfracddx$:
$$xe^x=sum_ngeq1fracxn!x^n$$
Apply $xfracddx$:
$$x(x+1)e^x=sum_ngeq1fracn^2n!x^n$$
The pattern continues:
$$left(xfracddxright)^k[e^x-1]=sum_ngeq1fracn^kn!x^n$$
A similar thing can be done with integration. Example:
Evaluate $$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)$$
Start by recalling that (use geometric series)
$$frac11+t^2=sum_ngeq0(-1)^nt^2n$$
Then integrate both sides from $0$ to $x$ to get
$$arctan x=sum_ngeq0frac(-1)^n2n+1x^2n+1$$
integrate both sides from $0$ to $1$ now to produce
$$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)=fracpi4-frac12log2$$
$endgroup$
$$e^x-1=sum_ngeq1fracx^nn!$$
Taking $d/dx$ on both sides,
$$e^x=sum_ngeq1fracnn!x^n-1$$
Multiplying both sides by $x$,
$$xe^x=sum_ngeq1fracnn!x^n$$
Then taking $d/dx$ on both sides again,
$$(x+1)e^x=sum_ngeq1fracn^2n!x^n-1$$
Then plug in $x=1$:
$$sum_ngeq1fracn^2n!=2e$$
Edit
This is a really neat trick that is widely used. Whenever you see an $n^k$ in the numerator, think applying the $xfracddx$ operator $k$ times. Example:
$$e^x-1=sum_ngeq1fracx^nn!$$
Apply $xfracddx$:
$$xe^x=sum_ngeq1fracxn!x^n$$
Apply $xfracddx$:
$$x(x+1)e^x=sum_ngeq1fracn^2n!x^n$$
The pattern continues:
$$left(xfracddxright)^k[e^x-1]=sum_ngeq1fracn^kn!x^n$$
A similar thing can be done with integration. Example:
Evaluate $$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)$$
Start by recalling that (use geometric series)
$$frac11+t^2=sum_ngeq0(-1)^nt^2n$$
Then integrate both sides from $0$ to $x$ to get
$$arctan x=sum_ngeq0frac(-1)^n2n+1x^2n+1$$
integrate both sides from $0$ to $1$ now to produce
$$S=sum_ngeq0frac(-1)^n(2n+2)(2n+1)=fracpi4-frac12log2$$
edited Jan 19 at 3:18
answered Jan 19 at 2:46
clathratusclathratus
4,286336
4,286336
1
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
add a comment |
1
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
1
1
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
Amazing, this is exactly what I was looking for
$endgroup$
– user601297
Jan 19 at 2:51
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
$begingroup$
@user601297 you are very welcome :)
$endgroup$
– clathratus
Jan 19 at 2:53
add a comment |
$begingroup$
In general, $$ sum_n=0^infty fracn^kn! = B_k e, $$ where $B_k$ is the $k$-th Bell-number. This is called the Dobinski's formula. This can be computed by expanding $n^k$ into the sum of falling factorials as in Olivier Oloa's answer.
$endgroup$
– Sangchul Lee
Jan 19 at 2:43
$begingroup$
If $R>0$ and a power series $sum_j=0^inftya_jx^j$ converges to $f(x)$ for each $xin (-R,R)$ then $f$ is differentiable on $(-R,R)$ and $sum_j=1^inftyja_jx^j-1 =f'(x)$ for all $(-R,R).$ Notice also that the previous sentence now applies with $f$ replaced by $f'$. For example, for $|x|<2$ let $f(x) =1/(1-x)=sum_j=0^inftyx^j .$ Then $sum_j=1^inftyjx^j-1=f'(x)=1/(1-x)^2,$ and $sum_j=2^inftyj(j-1)x^j-2=f''(x)=2/(1-x)^3.$
$endgroup$
– DanielWainfleet
Jan 19 at 3:33
$begingroup$
See : math.stackexchange.com/questions/1711318/…
$endgroup$
– lab bhattacharjee
Jan 19 at 4:05