Beefy Boxes and Bandwidth Generously Provided by pair Networks Frank
Think about Loose Coupling
 
PerlMonks  

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

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

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


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

Hi

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?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://442344]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.