Difference between revisions of "Factorial"
m (→Library) |
m (→See Also) |
||
Line 17: | Line 17: | ||
= See Also = | = See Also = | ||
− | * [[GammaFn]] : The gamma function. n! = [[GammaFn(n+1) | + | * [[GammaFn]] : The gamma function. n! = [[GammaFn]](n+1) |
* [[LGamma]]: The natural logarithm of the gamma function | * [[LGamma]]: The natural logarithm of the gamma function | ||
* [[Combinations]], [[Permutations]] | * [[Combinations]], [[Permutations]] |
Revision as of 19:06, 18 May 2007
Factorial(n)
Computes the factorial of a positive integer n. The factorial of a positive integer is defined as:
n! = Product(1..n)
The factorial function grows very rapidly, resulting in a numeric overflow when n>170. However, the log factorial can often be used in its place, which can be obtained using:
LGamma(n+1)
Library
Math
See Also
- GammaFn : The gamma function. n! = GammaFn(n+1)
- LGamma: The natural logarithm of the gamma function
- Combinations, Permutations
Comments
Enable comment auto-refresher