If $\displaystyle a_{n} = \frac{1000^n}{n!}$ for $n\in \mathbb{N}\;,$ Then $a_{n}$ is greatest when
$\bf{Options::}\;\;(a)\;\; n=997\;\;\;\; (b)\;\; n=998\;\;\;\; (c)\;\; n=999\;\;\;\;(a)\;\; n=1000\;\;\;\;$
$\bf{My\; Try::}$ Given $\displaystyle a_{n} = \frac{1000^n}{n!}\;,$ Then $\displaystyle a_{n+1} = \frac{1000^{n+1}}{(n+1)!}\;,$
So $\displaystyle\frac{a_{n+1}}{a_{n}} = \frac{1000}{n+1}>1$ for $n=997,998$
So $a_{n}$ is $\bf{\max}$ when $n=998$
But answer given is $a_{n}$ is $\max$ when $n=999$ and $n=1000$