Wolfram Library Archive


All Collections Articles Books Conference Proceedings
Courseware Demos MathSource Technical Notes
Title Downloads

A faster algorithm for approximating n! for large n
Author

Ted Ersek
Organization: Naval Air Warfare Center, Aircraft Division
URL: http://www.verbeia.com/mathematica/
Revision date

2007-09-27
Description

This notebook gives a faster way of approximating Factorial[n] for large n. This approximation is known to be correct to 21 decimal places for any n greater than 49105 but less than 44787863. I addition I strongly suspect the algorithm is correct to 21 decimal places for any n greater than 49105.
Subjects

*Applied Mathematics > Numerical Methods > Approximation Theory
*Mathematica Technology > Kernel > Numerics
Keywords

Factorial, approximate, approximation, N
Downloads Download Wolfram CDF Player

Download
FactorialApproximation.nb (9.3 KB) - Mathematica Notebook [for Mathematica 5.2]