Poisson CDF as lower bound to binomial CDF Consider two random variables $X \sim \operatorname{Binom}[(n,p)]$ and $Y\sim\operatorname{Poisson}[(\lambda)]$, where $\lambda = n p $. Let their respective CDFs be $F_X(k)$ and $F_Y(k)$, then I would like to show that
$$ F_Y(k) \leq F_X(k) $$
but I can't quite figure out how to. I'm not 100 % sure it's true but intuitively, it seems very much like that fatter tail of the Poisson distribution should make it true.
I thought about trying to show that $X' \sim \operatorname{Binom}[(n+1,p')]$, where $(n+1)p'=\lambda$, satisfies $F_{X'}(k) \leq F_X(k)$, but didn't get something out.
Any hints/answers appreciated!
Thanks
 A: Assume that the distribution of $X$ is Binomial $(n,p)$ and that the distribution of $Y$ is Poisson $\lambda$. Then $F_Y(0)=\mathrm{e}^{-\lambda}$ and $F_X(0)=(1-p)^n$. Since $1-p<\mathrm{e}^{-p}$ for every $p\ne0$, $(1-p)^n<\mathrm{e}^{-np}$, hence, for $\lambda=np$, $F_X(0)<F_Y(0)$, which means the assertion is wrong.
Nevertheless...

Let us first consider the simple case $n=1$. That is, we assume that the distribution of $X$ is Binomial $(1,p)$ and that the distribution of $Y$ is Poisson $\lambda$, and we look for a value of $\lambda$ such that $F_Y(k)\leqslant F_X(k)$ for every $k$. We readily see that this inequality holds everywhere if and only if it holds at $k=0$ if and only if $\mathrm{e}^{-\lambda}\leqslant1-p$, that is for every $\lambda\geqslant\lambda_p$ with 
$$
\color{red}{\lambda_p=-\log(1-p)}
$$
This result has an almost sure version: assume that $Y$ is Poisson $\lambda_p$ and define
$$
X=\min\{Y,1\}
$$ 
Then $X$ is Bernoulli $(1,p)$ and $X\leqslant Y$ almost surely. Hence, for every $k$, $[X\leqslant k]\supset[Y\leqslant k]$, which implies
$$
F_X(k)=P(X\leqslant k)\geqslant P(Y\leqslant k)=F_Y(k)
$$

We can now go back to the general case. Let us introduce $n$ i.i.d. $Y_k$ with Poisson $\lambda_p$ distributions and $n$ i.i.d. $X_k$ with Binomial $(1,p)$ distributions, such that, for every $k$, $X_k\leqslant Y_k$ almost surely (to this end, one can use the construction provided above or any other one). Then $Y=Y_1+\cdots+Y_n$ has Poisson $n\lambda_p$ distribution, $X=X_1+\cdots+X_n$ has Binomial $(n,p)$ distribution, and $X\leqslant Y$ almost surely. 
This proves that for every $X$ with Binomial $(n,p)$ distribution and for every $Y$ with Poisson $n\lambda_p$ distribution, $F_X(k)\geqslant F_Y(k)$ for every $k$. Hence the result the OP is interested in holds if one replaces $\lambda=np$ by 
$$
\color{red}{n\lambda_p=-n\log(1-p)}
$$
The comparison technique above is a simple case of the so-called coupling method. For more on this, see the book Lectures on the coupling method by Torgny Lindvall.
