$sum_n=1^infty fracn! e^nn^n$ converges or diverges [closed]
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
i need some advice on how to prove if this series converges or diverges
tried using D'Alembert test but i received $1$ so it does not help me.
Thanks.
$$sum_n=1^infty fracn!e^nn^n$$
calculus analysis power-series
closed as off-topic by user99914, Delta-u, drhab, Arnaud D., Strants Sep 4 at 14:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â Community, Delta-u, drhab
 |Â
show 1 more comment
up vote
0
down vote
favorite
i need some advice on how to prove if this series converges or diverges
tried using D'Alembert test but i received $1$ so it does not help me.
Thanks.
$$sum_n=1^infty fracn!e^nn^n$$
calculus analysis power-series
closed as off-topic by user99914, Delta-u, drhab, Arnaud D., Strants Sep 4 at 14:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â Community, Delta-u, drhab
Apply the root test.
â Mark Viola
Sep 3 at 20:10
$n^n$ grows much faster than $e^n$ because the exponents are the same and $n$ grows while $e$ is constant.
â Yves Daoust
Sep 3 at 20:26
2
Was $n$ in the numerator supposed to be $n!$ by a chance?
â Wojowu
Sep 3 at 20:29
1
Using Stirling's Asymptotic Approximation, the terms are asymptotic to $sqrt2pi n$, so they do not go to $0$.
â robjohnâ¦
Sep 4 at 8:43
1
Possible duplicate of Prove that the series $sum_n=1^infty frace^nn!n^n$ diverges
â Arnaud D.
Sep 4 at 14:49
 |Â
show 1 more comment
up vote
0
down vote
favorite
up vote
0
down vote
favorite
i need some advice on how to prove if this series converges or diverges
tried using D'Alembert test but i received $1$ so it does not help me.
Thanks.
$$sum_n=1^infty fracn!e^nn^n$$
calculus analysis power-series
i need some advice on how to prove if this series converges or diverges
tried using D'Alembert test but i received $1$ so it does not help me.
Thanks.
$$sum_n=1^infty fracn!e^nn^n$$
calculus analysis power-series
calculus analysis power-series
edited Sep 4 at 7:43
asked Sep 3 at 20:07
Maor Rocky
876
876
closed as off-topic by user99914, Delta-u, drhab, Arnaud D., Strants Sep 4 at 14:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â Community, Delta-u, drhab
closed as off-topic by user99914, Delta-u, drhab, Arnaud D., Strants Sep 4 at 14:53
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â Community, Delta-u, drhab
Apply the root test.
â Mark Viola
Sep 3 at 20:10
$n^n$ grows much faster than $e^n$ because the exponents are the same and $n$ grows while $e$ is constant.
â Yves Daoust
Sep 3 at 20:26
2
Was $n$ in the numerator supposed to be $n!$ by a chance?
â Wojowu
Sep 3 at 20:29
1
Using Stirling's Asymptotic Approximation, the terms are asymptotic to $sqrt2pi n$, so they do not go to $0$.
â robjohnâ¦
Sep 4 at 8:43
1
Possible duplicate of Prove that the series $sum_n=1^infty frace^nn!n^n$ diverges
â Arnaud D.
Sep 4 at 14:49
 |Â
show 1 more comment
Apply the root test.
â Mark Viola
Sep 3 at 20:10
$n^n$ grows much faster than $e^n$ because the exponents are the same and $n$ grows while $e$ is constant.
â Yves Daoust
Sep 3 at 20:26
2
Was $n$ in the numerator supposed to be $n!$ by a chance?
â Wojowu
Sep 3 at 20:29
1
Using Stirling's Asymptotic Approximation, the terms are asymptotic to $sqrt2pi n$, so they do not go to $0$.
â robjohnâ¦
Sep 4 at 8:43
1
Possible duplicate of Prove that the series $sum_n=1^infty frace^nn!n^n$ diverges
â Arnaud D.
Sep 4 at 14:49
Apply the root test.
â Mark Viola
Sep 3 at 20:10
Apply the root test.
â Mark Viola
Sep 3 at 20:10
$n^n$ grows much faster than $e^n$ because the exponents are the same and $n$ grows while $e$ is constant.
â Yves Daoust
Sep 3 at 20:26
$n^n$ grows much faster than $e^n$ because the exponents are the same and $n$ grows while $e$ is constant.
â Yves Daoust
Sep 3 at 20:26
2
2
Was $n$ in the numerator supposed to be $n!$ by a chance?
â Wojowu
Sep 3 at 20:29
Was $n$ in the numerator supposed to be $n!$ by a chance?
â Wojowu
Sep 3 at 20:29
1
1
Using Stirling's Asymptotic Approximation, the terms are asymptotic to $sqrt2pi n$, so they do not go to $0$.
â robjohnâ¦
Sep 4 at 8:43
Using Stirling's Asymptotic Approximation, the terms are asymptotic to $sqrt2pi n$, so they do not go to $0$.
â robjohnâ¦
Sep 4 at 8:43
1
1
Possible duplicate of Prove that the series $sum_n=1^infty frace^nn!n^n$ diverges
â Arnaud D.
Sep 4 at 14:49
Possible duplicate of Prove that the series $sum_n=1^infty frace^nn!n^n$ diverges
â Arnaud D.
Sep 4 at 14:49
 |Â
show 1 more comment
4 Answers
4
active
oldest
votes
up vote
3
down vote
The series converges and we can see that in so many ways that is
- root test (maybe the simpler)
- ratio test (also effective)
- limit comparison test (for example with $sum frac1n^2$)
- etc.
As an alternative, note that eventually, that is for $nge e^2$ we have $$n^nge e^2n$$ and since eventually $e^n ge n^3$
$$fracne^nn^nlefracne^ne^2n=frac ne^nle fracnn^3=frac1n^2$$
the given series converges by direct comparison test with $sum frac1n^2$.
add a comment |Â
up vote
2
down vote
Hint: The $n$th term equals
$$eleft(fracenright )^n-1$$
and $e/n le e/3$ for $n>2.$
1
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
Right, thank you.
â zhw.
Sep 3 at 21:01
add a comment |Â
up vote
1
down vote
With some simple manipulations you can show that you can omit the factor $n$ in the numerator (are you able to do this?
Then you are left with $a_n=frace^nn^n$. To see that this sum converges it is enough to see, that these summands are smaller than lets say $left(frace10right)^n$, that is they are smaller than the summands of a (converging) geometric sum.
add a comment |Â
up vote
0
down vote
With ratio test:
$$fraca_n+1a_n=$$
$$fracn+1n frace^n+1e^n fracn^n(n+1)^n+1=$$
$$efracn+1nfracn^n(n+1)^n+1=$$
$$efracn+1nfrac1n+1left(fracnn+1right)^n=$$
$$fracenleft(fracnn+1right)^n to 0$$
Because $left(fracnn+1right)^n to frac1e$ and $fracen to 0$
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
add a comment |Â
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
3
down vote
The series converges and we can see that in so many ways that is
- root test (maybe the simpler)
- ratio test (also effective)
- limit comparison test (for example with $sum frac1n^2$)
- etc.
As an alternative, note that eventually, that is for $nge e^2$ we have $$n^nge e^2n$$ and since eventually $e^n ge n^3$
$$fracne^nn^nlefracne^ne^2n=frac ne^nle fracnn^3=frac1n^2$$
the given series converges by direct comparison test with $sum frac1n^2$.
add a comment |Â
up vote
3
down vote
The series converges and we can see that in so many ways that is
- root test (maybe the simpler)
- ratio test (also effective)
- limit comparison test (for example with $sum frac1n^2$)
- etc.
As an alternative, note that eventually, that is for $nge e^2$ we have $$n^nge e^2n$$ and since eventually $e^n ge n^3$
$$fracne^nn^nlefracne^ne^2n=frac ne^nle fracnn^3=frac1n^2$$
the given series converges by direct comparison test with $sum frac1n^2$.
add a comment |Â
up vote
3
down vote
up vote
3
down vote
The series converges and we can see that in so many ways that is
- root test (maybe the simpler)
- ratio test (also effective)
- limit comparison test (for example with $sum frac1n^2$)
- etc.
As an alternative, note that eventually, that is for $nge e^2$ we have $$n^nge e^2n$$ and since eventually $e^n ge n^3$
$$fracne^nn^nlefracne^ne^2n=frac ne^nle fracnn^3=frac1n^2$$
the given series converges by direct comparison test with $sum frac1n^2$.
The series converges and we can see that in so many ways that is
- root test (maybe the simpler)
- ratio test (also effective)
- limit comparison test (for example with $sum frac1n^2$)
- etc.
As an alternative, note that eventually, that is for $nge e^2$ we have $$n^nge e^2n$$ and since eventually $e^n ge n^3$
$$fracne^nn^nlefracne^ne^2n=frac ne^nle fracnn^3=frac1n^2$$
the given series converges by direct comparison test with $sum frac1n^2$.
edited Sep 3 at 20:37
Salahamam_ Fatima
34k21430
34k21430
answered Sep 3 at 20:18
gimusi
72.8k73889
72.8k73889
add a comment |Â
add a comment |Â
up vote
2
down vote
Hint: The $n$th term equals
$$eleft(fracenright )^n-1$$
and $e/n le e/3$ for $n>2.$
1
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
Right, thank you.
â zhw.
Sep 3 at 21:01
add a comment |Â
up vote
2
down vote
Hint: The $n$th term equals
$$eleft(fracenright )^n-1$$
and $e/n le e/3$ for $n>2.$
1
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
Right, thank you.
â zhw.
Sep 3 at 21:01
add a comment |Â
up vote
2
down vote
up vote
2
down vote
Hint: The $n$th term equals
$$eleft(fracenright )^n-1$$
and $e/n le e/3$ for $n>2.$
Hint: The $n$th term equals
$$eleft(fracenright )^n-1$$
and $e/n le e/3$ for $n>2.$
edited Sep 3 at 21:01
answered Sep 3 at 20:20
zhw.
67.4k42872
67.4k42872
1
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
Right, thank you.
â zhw.
Sep 3 at 21:01
add a comment |Â
1
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
Right, thank you.
â zhw.
Sep 3 at 21:01
1
1
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
slight correction needed: $e/n le e/3$ for $n>2$ or $e/n < e/3$ for $n>3$
â gimusi
Sep 3 at 20:45
Right, thank you.
â zhw.
Sep 3 at 21:01
Right, thank you.
â zhw.
Sep 3 at 21:01
add a comment |Â
up vote
1
down vote
With some simple manipulations you can show that you can omit the factor $n$ in the numerator (are you able to do this?
Then you are left with $a_n=frace^nn^n$. To see that this sum converges it is enough to see, that these summands are smaller than lets say $left(frace10right)^n$, that is they are smaller than the summands of a (converging) geometric sum.
add a comment |Â
up vote
1
down vote
With some simple manipulations you can show that you can omit the factor $n$ in the numerator (are you able to do this?
Then you are left with $a_n=frace^nn^n$. To see that this sum converges it is enough to see, that these summands are smaller than lets say $left(frace10right)^n$, that is they are smaller than the summands of a (converging) geometric sum.
add a comment |Â
up vote
1
down vote
up vote
1
down vote
With some simple manipulations you can show that you can omit the factor $n$ in the numerator (are you able to do this?
Then you are left with $a_n=frace^nn^n$. To see that this sum converges it is enough to see, that these summands are smaller than lets say $left(frace10right)^n$, that is they are smaller than the summands of a (converging) geometric sum.
With some simple manipulations you can show that you can omit the factor $n$ in the numerator (are you able to do this?
Then you are left with $a_n=frace^nn^n$. To see that this sum converges it is enough to see, that these summands are smaller than lets say $left(frace10right)^n$, that is they are smaller than the summands of a (converging) geometric sum.
answered Sep 3 at 20:21
Jürg Merlin Spaak
1,035114
1,035114
add a comment |Â
add a comment |Â
up vote
0
down vote
With ratio test:
$$fraca_n+1a_n=$$
$$fracn+1n frace^n+1e^n fracn^n(n+1)^n+1=$$
$$efracn+1nfracn^n(n+1)^n+1=$$
$$efracn+1nfrac1n+1left(fracnn+1right)^n=$$
$$fracenleft(fracnn+1right)^n to 0$$
Because $left(fracnn+1right)^n to frac1e$ and $fracen to 0$
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
add a comment |Â
up vote
0
down vote
With ratio test:
$$fraca_n+1a_n=$$
$$fracn+1n frace^n+1e^n fracn^n(n+1)^n+1=$$
$$efracn+1nfracn^n(n+1)^n+1=$$
$$efracn+1nfrac1n+1left(fracnn+1right)^n=$$
$$fracenleft(fracnn+1right)^n to 0$$
Because $left(fracnn+1right)^n to frac1e$ and $fracen to 0$
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
add a comment |Â
up vote
0
down vote
up vote
0
down vote
With ratio test:
$$fraca_n+1a_n=$$
$$fracn+1n frace^n+1e^n fracn^n(n+1)^n+1=$$
$$efracn+1nfracn^n(n+1)^n+1=$$
$$efracn+1nfrac1n+1left(fracnn+1right)^n=$$
$$fracenleft(fracnn+1right)^n to 0$$
Because $left(fracnn+1right)^n to frac1e$ and $fracen to 0$
With ratio test:
$$fraca_n+1a_n=$$
$$fracn+1n frace^n+1e^n fracn^n(n+1)^n+1=$$
$$efracn+1nfracn^n(n+1)^n+1=$$
$$efracn+1nfrac1n+1left(fracnn+1right)^n=$$
$$fracenleft(fracnn+1right)^n to 0$$
Because $left(fracnn+1right)^n to frac1e$ and $fracen to 0$
answered Sep 3 at 20:20
Botond
4,1242632
4,1242632
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
add a comment |Â
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
Hi everyone thanks for the help but the qustion was written wrongly, i added the (!) sign.
â Maor Rocky
Sep 4 at 7:45
add a comment |Â
Apply the root test.
â Mark Viola
Sep 3 at 20:10
$n^n$ grows much faster than $e^n$ because the exponents are the same and $n$ grows while $e$ is constant.
â Yves Daoust
Sep 3 at 20:26
2
Was $n$ in the numerator supposed to be $n!$ by a chance?
â Wojowu
Sep 3 at 20:29
1
Using Stirling's Asymptotic Approximation, the terms are asymptotic to $sqrt2pi n$, so they do not go to $0$.
â robjohnâ¦
Sep 4 at 8:43
1
Possible duplicate of Prove that the series $sum_n=1^infty frace^nn!n^n$ diverges
â Arnaud D.
Sep 4 at 14:49