AdvancedIntegerMath Methods |
The AdvancedIntegerMath type exposes the following members.
Methods| Name | Description | |
|---|---|---|
  | BellNumber |
Computes the given Bell number.
|
| BernoulliNumber |
Computes the given Bernoulli number.
|
| BinomialCoefficient |
Computes a binomial coefficient.
|
| BinomialCoefficients |
Enumerates the binomial coefficients of a given order.
|
| DoubleFactorial |
Computes the double factorial of the given integer.
|
| Factorial |
Computes the factorial of an integer.
|
| FibonacciNumber |
Computes a Fibonacci number.
|
| GCF |
Computes the greatest common factor of two integers.
|
| HarmonicNumber |
Computes the given harmonic number.
|
| IsPrime |
Determines whether the given integer is prime.
|
| LCM |
Computes the least common multiple of two integers.
|
| LogDoubleFactorial |
Computes the natural logarithm of the double factorial of the given number.
|
| LogFactorial |
Computes the logarithm of the factorial of an integer.
|
| PowMod |
Computes a power of an integer in modular arithmetic.
|
| StirlingNumber1 |
Computes a Stirling number of the first kind.
|
| StirlingNumber2 |
Computes a Stirling number of the second kind.
|
| StirlingNumbers1 |
Computes a row of Sterling numbers of the first kind.
|
| StirlingNumbers2 |
Computes a row of Stirling numbers of the second kind.
|
See Also