- gcd
Gets the greatest common divisor of the absolute value of two numbers, using
the "binary gcd" metho
- pow
Raise a BigInteger to a BigInteger power.
- addAndCheck
Add two long integers, checking for overflow.
- gcdPositive
Computes the greatest common divisor of two positive numbers (this precondition
is not checked and t
- isPowerOfTwo
Returns true if the argument is a power of two.
- lcm
Returns the least common multiple of the absolute value of two numbers, using
the formula lcm(a,b)
- mulAndCheck
Multiply two long integers, checking for overflow.
- subAndCheck
Subtract two long integers, checking for overflow.
- binomialCoefficient
Returns an exact representation of the Binomial Coefficient
[http://mathworld.wolfram.com/BinomialCo
- binomialCoefficientDouble
Returns a double representation of the Binomial Coefficient
[http://mathworld.wolfram.com/BinomialCo