Difference between revisions of "Factorial"

Latest revision as of 01:24, 16 January 2016

Factorial(n)

Computes the factorial of a positive integer «n». The factorial of a positive integer is defined as:

n! = Product(1..n)

and can also be obtained by means of GammaFn as

n! = GammaFn(n + 1)

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

@@ Line 2: / Line 2: @@
 [[Category:Doc Status C]] <!-- For Lumina use, do not change -->
-= Factorial(n) =
+== Factorial(n) ==
+Computes the factorial of a positive integer «n».  The factorial of a positive integer is defined as:
+:<code>n! = Product(1..n)</code>
+and can also be obtained by means of [[GammaFn]] as
+:<code>n! = GammaFn(n + 1)</code>
-Computes the factorial of a positive integer n.  The factorial of a positive integer is defined as:
+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:
+:<code>LGamma(n + 1)</code>
- 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 =
+== Library ==
 Math
-= See Also =
+== See Also ==
+* [[Product]]
-* [[GammaFn]] : The gamma function.  n! = [[GammaFn]](n+1)
+* [[GammaFn]] : The gamma function
 * [[LGamma]]: The natural logarithm of the gamma function
-* [[Combinations]], [[Permutations]]
+* [[Combinations]]
+* [[Permutations]]