 |
|
|
|
|
 |
 |
|
A faster algorithm for approximating n! for large n
|
|
|
|
|
|
| Organization: | Naval Air Warfare Center, Aircraft Division |
|
|
|
|
|
|
2007-09-27
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
|
|
Factorial, approximate, approximation, N
|
|
|
 |
|
|
| FactorialApproximation.nb (9.3 KB) - Mathematica Notebook [for Mathematica 5.2] |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
