1

So I saw the limit $\lim\limits_{n\to \infty} e^{-n}\sum_{k=0}^n \frac{n^k}{k!}$ here the other day:

Evaluating $\lim\limits_{n\to\infty} e^{-n} \sum\limits_{k=0}^{n} \frac{n^k}{k!}$

and when I saw it, I right away thought the answer is $1$ because I thought $\lim\limits_{n\to \infty} \sum_{k=0}^n \frac{n^k}{k!} = \lim\limits_{n\to \infty} e^n$ given that $e^x = \lim\limits_{n\to \infty} \sum_{k=0}^n \frac{x^k}{k!}$ and so the result would be $\lim\limits_{n\to \infty} e^{-n}e^n = 1$ but the result is $\frac{1}{2}$, found using methods that I'm not familiar with.

Could someone please explain why my method is wrong?

Thank you so much in advance!

  • 2
    "I thought that $\lim_{n \to \infty} \sum_{k=0}^n \frac{n^k}{k!} = e^n$". Huh? That makes absolutely no sense. There's an $n$ on the right hand side? – mathworker21 Nov 07 '19 at 21:57
  • central limit theorem. – TBTD Nov 07 '19 at 21:58
  • @mathworker21 I meant $e^n$ as $n$ approaches infinity. Will fix it. –  Nov 07 '19 at 21:58
  • 1
    Can you link to where you saw it here? – Gerry Myerson Nov 07 '19 at 21:59
  • 2
    @GerryMyerson https://math.stackexchange.com/questions/160248/evaluating-lim-limits-n-to-infty-e-n-sum-limits-k-0n-fracnkk –  Nov 07 '19 at 22:00
  • @TBTD I have no idea what that is LOL. But I will try and read about it. –  Nov 07 '19 at 22:01
  • 2
    $\lim_{x \to \infty} x = \lim_{x \to \infty} x^2$ implies $\lim_{x \to \infty} \frac{x}{x^2} = 1$? the issue is that you need the common limit to be finite to deduce the limit of the ratio is $1$ – mathworker21 Nov 07 '19 at 22:01
  • 1
    We have for each $n \in {1, 2, 3, ...}$: $$ e^{-n} \sum_{k=0}^n \frac{n^k}{k!} \leq e^{-n} \sum_{k=0}^{\infty} \frac{n^k}{k!} = 1$$ and so the limit should be less than or equal to 1. Intuitively, we should expect it to be strictly less than 1 because we are not chopping the infinite sum at a point where it is close to $e^n$. Note that $n^k>k!$ when $n\geq k$. – Michael Nov 07 '19 at 22:05

4 Answers4

2

Your argument is wrong because it doesn't make sense to talk about $\lim_{n \to \infty} \sum_{k=0}^n \frac{n^k}{k!}$. That limit doesn't exist (because it's infinite). You can talk about the sum's asymptotic behavior as compared to $e^n$, but that's not the same thing and it's not obvious (and if your result is correct, not true) that the sum asymptotically approaches $e^n$ as $n \to \infty$.

Robert Shore
  • 23,332
2

Somebody gotta do this via CLT:

Let $X_n$ be a random variable, having Poisson distribution with parameter $n$, that is, $\mathbb{P}(X_n=k)=e^{-n}n^k/k!$, for every $k\geq 0$ integer. Now, $$ e^{-n}\sum_{k=0}^n \frac{n^k}{k!} = \mathbb{P}({\rm Pois}(n) \leq n). $$ Now, let $Y_1,\dots,Y_n$ be random variables with ${\rm Pois}(1)$ distribution, and thus, the given probability is nothing but $$ \mathbb{P}(Y_1+\cdots+Y_n \leq n) = \mathbb{P}\left(\frac{Y_1+\cdots+Y_n-n}{\sqrt{n}}\leq 0\right). $$ Now, since the central limit theorem tells us that $$ \frac{Y_1+\cdots+Y_n-n}{\sqrt{n}}\to N(0,1) $$ in distribution, we have therefore: $$ \lim_{n\to\infty}e^{-n}\sum_{k=0}^n \frac{n^k}{k!} = \lim_{n\to\infty} \mathbb{P}\left(\frac{Y_1+\cdots+Y_n-n}{\sqrt{n}}\leq 0\right) = \mathbb{P}(N(0,1)\leq 0), $$ which is $1/2$.

TBTD
  • 3,516
1

What you're doing is taking the identity $$ \lim_{n\to\infty}\sum_{k=0}^n\frac{x^k}{k!}=e^x\tag1 $$ and plugging in $x=n$ to obtain the (false) statement $$ \lim_{n\to\infty}\sum_{k=0}^n\frac{n^k}{k!}=e^n.\tag2 $$ Why is (2) false? Setting $x=n$ in (1) is illegal because the $n$ in (1) is busy being used as the label for the $n$th term in your sequence; plugging $x=n$ confuses $x$ with $n$ and changes the nature of the expression you're studying. To see why (2) makes no sense, notice that the LHS of (2) should no longer depend on $n$ when you've passed to the limit, so the RHS should not depend on $n$ either. For more examples of what can go wrong, try setting $x=n$ in the following identities, which are valid for all $x$: $$ \lim_{n\to\infty}\frac xn=0\tag3 $$ and $$ \lim_{n\to\infty}\left(1+\frac xn\right)^n=e^{x}\tag4 $$

grand_chat
  • 38,951
0

If the inner sum were added for k = 0 to infinity, you would be right. But it is only added for k = 0 to n. It seems that if you add the first (n+1) terms of the sum up to n, you get about half of the complete infinite sum (which you would need to prove), that is about $e^n / 2$.

gnasher729
  • 10,113