Stirling's Approximation for a factorial raised to a power

rmiller70015
Messages
110
Reaction score
1
Homework Statement
Find Stirling's Approximation for ##[(\alpha - 1)!]^2##
Relevant Equations
For large N: ##log(N!) \approx Nlog(N)-N##
Using log identities:
##log((\alpha - 1)!^2) = 2(log(\alpha - 1)!)##
Then apply Stirling's Approximation
##(2[(\alpha - 1)log(\alpha - 1) - (\alpha - 1)##
## = 2(\alpha -1)log(\alpha -1) - 2\alpha+2##

Is this correct? I can't find a way to check this computationally.
 
Physics news on Phys.org
rmiller70015 said:
Homework Statement:: Find Stirling's Approximation for ##[(\alpha - 1)!]^2##
Relevant Equations:: For large N: ##log(N!) \approx Nlog(N)-N##

Using log identities:
##log((\alpha - 1)!^2) = 2(log(\alpha - 1)!)##
Then apply Stirling's Approximation
##(2[(\alpha - 1)log(\alpha - 1) - (\alpha - 1)##
## = 2(\alpha -1)log(\alpha -1) - 2\alpha+2##

Is this correct? I can't find a way to check this computationally.
I don't think it's correct, and I get something different. If you want to approximate ##[(\alpha - 1)!]^2##, first use Stirling's to approximate ##(\alpha - 1)!##, and then square that result.
 
Last edited:
Thanks, that was bugging me.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top