Found Stirlings approximation of factorial N at: http://www.jsoftware.com/jwiki/Essays/Stirling%27s%20Approximation
it is: stirlf=: ^@(1r12&%) * %:@(2p1&*) * %&1x1 ^ ] I just learned how to do do a google search with: site:jsoftware.com stirling This searches the web site at jsoftware.com for stirling. I wish I had known this a long time ago. I can't tell you how many times I did a google search with "j language" and got "J. Language" which was a persons name. Also, "J language" which turned out to be Java. By the way did you know that the term "Jay Language" sometimes leads to a hit that is valid. take care ----- Original Message Follows ----- From: [email protected] To: [email protected] Subject: Stirlings approximation of "factorial N" Date: Thu, 26 Feb 2009 00:22:22 -0800 >According to Wikipedia, Stirlings approximation for the ln >N! > >which is: ^. N > >ln( N!) is approximately n ln(N) - N > >which is: _N + N * ^. N NB. I am sure?? > >so, > >! N "is approximately" ^ _N + N * ^. N > >But when I do > > ! 7 >5040 > > ^ -N + (N * ^. N) >1.10727e_9 > >which certainly isn't near 5040 > >I an a newbie, spent about 1 day trying to get the right >results. > >Any help would be greatly appreciated. > > > > > > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
