Click or drag to resize
AdvancedIntegerMath Methods

The AdvancedIntegerMath type exposes the following members.

Methods
  NameDescription
Public methodStatic memberBellNumber
Computes the given Bell number.
Public methodStatic memberBernoulliNumber
Computes the given Bernoulli number.
Public methodStatic memberBinomialCoefficient
Computes a binomial coefficient.
Public methodStatic memberBinomialCoefficients
Enumerates the binomial coefficients of a given order.
Public methodStatic memberDoubleFactorial
Computes the double factorial of the given integer.
Public methodStatic memberFactorial
Computes the factorial of an integer.
Public methodStatic memberFibonacciNumber
Computes a Fibonacci number.
Public methodStatic memberGCF
Computes the greatest common factor of two integers.
Public methodStatic memberHarmonicNumber
Computes the given harmonic number.
Public methodStatic memberIsPrime
Determines whether the given integer is prime.
Public methodStatic memberLCM
Computes the least common multiple of two integers.
Public methodStatic memberLogDoubleFactorial
Computes the natural logarithm of the double factorial of the given number.
Public methodStatic memberLogFactorial
Computes the logrithm of the factorial of an integer.
Public methodStatic memberPartitions
Enumerates all partitions of the given integer
Public methodStatic memberPowMod
Computes a power of an integer in modular arithmetic.
Public methodStatic memberStirlingNumber1
Computes a Stirling number of the first kind.
Public methodStatic memberStirlingNumber2
Computes a Stirling number of the second kind.
Public methodStatic memberStirlingNumbers1
Computes a row of Sterling numbers of the first kind.
Public methodStatic memberStirlingNumbers2
Computes a row of Stirling numbers of the second kind.
Top
See Also