How Does Stirling's Approximation Simplify Poisson to Normal Approximation?

Mathsboi
Messages
2
Reaction score
0
I read this in a book (it was stats and about poisson approx to normal)
Given was this:

n(n-1)(n-2) \cdots (n-r+1) = \frac{n!}{(n-r)!} \approx n^r
Stating that "Stirling's approximation" had been used.
So I looked the up and found:

\ln n! \approx n\ln n - n\


In the poisson distribution n is very large and r is very small compared to n so all the terms in the given equation approximate to n... This gives me my \approx n^r

But I just wondered where the Stirling equation comes into it...

\ln (\frac{n!}{(n-r)!}) = \ln(n!) - \ln((n-r)!) \
\approx n\ln n - n - \left[ (n-r)\ln((n-r)) - (n-r) \right]\
\approx n\ln n - n - (n-r)\ln((n-r)) + n - r \
\approx n\ln n - (n-r)\ln((n-r)) -r \
...
That's as far as I got...

\approx \ln (n^n) - \ln((n-r)^{(r-n)}) -r \

Unless taking logs, instead of to base e, to base n...

\approx Log_n (n^n) - Log_n ((n-r)^{(r-n)}) -r \
Then...
Log_n (n^n) - Log_n ((n-r)^{(r-n)}) = r\
n^n - (n-r)^{(n-r)} = n^r\

^ not sure if that's correct though

Can anyone help?
 
Physics news on Phys.org
This is "number theory", not "algebra and linear algebra" so I am moving it.
 
\ln(n-r) \approx ln(n) - r/n

<br /> n\ln n - (n-r)\ln((n-r)) -r \approx n \ln n - n \ln n + n r/n + r (\ln n - r/n) - r\approx r \ln n - r^2/n<br />
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top