A faster algorithm for approximating n! for large n -- from Wolfram Library Archive

Title

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
	Wolfram Technology > Kernel > Numerics

Keywords

Factorial, approximate, approximation, N

Downloads

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

Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how »