AP Calculus BC
Does the Sum of 2^n/n! Converge? Yes
The sum of 2 to the n over n factorial converges. The ratio test gives 2 over n plus 1, which tends to 0, so it converges. Factorial growth outruns exponential growth, and from n equals 1 the sum is e squared minus 1.
Converges
Settled by the ratio test.
Factorial beats exponential
The numerator multiplies by a fixed each step while the denominator multiplies by an ever larger . Past the denominator wins every single step, and it keeps winning by more.
The base never matters
Replace 2 with any constant k and the ratio becomes k/(n+1), still tending to 0. Every series of the form k^n over n factorial converges, no matter how large k is.
The sum comes from the exponential series
So the sum from is . As always, the convergence test gives the verdict and the series identity gives the value.
The mistakes students make
- Assuming a large base forces divergence. converges too, just after a longer climb.
- Inverting the ratio to and concluding divergence. The ratio is newer over older.
Not sure which test a series wants?
The Convergence Test Chooser walks the decision in order: nth term first, then geometric and p-series pattern matching, then alternating structure, then the ratio test, and finally the comparison family.
Frequently asked questions
Does the sum of 2^n/n! converge?
Yes, by the ratio test with .
Would a bigger base change the answer?
No. For any constant the ratio is , so it always converges.
What is the sum?
from , about .