Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: Stirling Approx to N! for large Number?

by jimbojones (Friar)
on Mar 25, 2005 at 14:45 UTC ( #442344=note: print w/replies, xml ) Need Help??

in reply to Re: Stirling Approx to N! for large Number?
in thread Stirling Approx to N! for large Number?


Numerical Recipes in C is available free online. See Numerical Recipes Books On-Line. It's a great resource. The site says:

Thanks to special permission from Cambridge University Press, we are able to bring you, free, the complete Numerical Recipes books in C, Fortran 77, and Fortran 90 On-Line, in Adobe Acrobat format. Due to copyright restrictions, Numerical Recipes in C++ is not available as part of this free resource.

The factorial representation is available at this PDF (after a I chose LANL as the mirror site).

- j

  • Comment on Re^2: Stirling Approx to N! for large Number?

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://442344]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (6)
As of 2017-10-20 02:22 GMT
Find Nodes?
    Voting Booth?
    My fridge is mostly full of:

    Results (258 votes). Check out past polls.