| Name | Description |
---|
| CeilingToPowerOfTwo(Int32) |
Find the closest perfect power of two that is larger or equal to the provided
32 bit integer.
|
| CeilingToPowerOfTwo(Int64) |
Find the closest perfect power of two that is larger or equal to the provided
64 bit integer.
|
| ExtendedGreatestCommonDivisor(BigInteger, BigInteger, BigInteger, BigInteger) |
Computes the extended greatest common divisor, such that a*x + b*y = gcd(a,b).
|
| ExtendedGreatestCommonDivisor(Int64, Int64, Int64, Int64) |
Computes the extended greatest common divisor, such that a*x + b*y = gcd(a,b).
|
| GreatestCommonDivisor(BigInteger) |
Returns the greatest common divisor (gcd) of a set of big integers.
|
| GreatestCommonDivisor(IListInt64) |
Returns the greatest common divisor (gcd) of a set of integers using Euclid's
algorithm.
|
| GreatestCommonDivisor(IListBigInteger) |
Returns the greatest common divisor (gcd) of a set of big integers.
|
| GreatestCommonDivisor(Int64) |
Returns the greatest common divisor (gcd) of a set of integers using Euclid's algorithm.
|
| GreatestCommonDivisor(BigInteger, BigInteger) |
Returns the greatest common divisor (gcd) of two big integers.
|
| GreatestCommonDivisor(Int64, Int64) |
Returns the greatest common divisor (gcd) of two integers using Euclid's algorithm.
|
| IsEven(Int32) |
Find out whether the provided 32 bit integer is an even number.
|
| IsEven(Int64) |
Find out whether the provided 64 bit integer is an even number.
|
| IsOdd(Int32) |
Find out whether the provided 32 bit integer is an odd number.
|
| IsOdd(Int64) |
Find out whether the provided 64 bit integer is an odd number.
|
| IsPerfectSquare(Int32) |
Find out whether the provided 32 bit integer is a perfect square, i.e. a square of an integer.
|
| IsPerfectSquare(Int64) |
Find out whether the provided 64 bit integer is a perfect square, i.e. a square of an integer.
|
| IsPowerOfTwo(Int32) |
Find out whether the provided 32 bit integer is a perfect power of two.
|
| IsPowerOfTwo(Int64) |
Find out whether the provided 64 bit integer is a perfect power of two.
|
| LeastCommonMultiple(BigInteger) |
Returns the least common multiple (lcm) of a set of big integers.
|
| LeastCommonMultiple(IListInt64) |
Returns the least common multiple (lcm) of a set of integers using Euclid's algorithm.
|
| LeastCommonMultiple(IListBigInteger) |
Returns the least common multiple (lcm) of a set of big integers.
|
| LeastCommonMultiple(Int64) |
Returns the least common multiple (lcm) of a set of integers using Euclid's algorithm.
|
| LeastCommonMultiple(BigInteger, BigInteger) |
Returns the least common multiple (lcm) of two big integers.
|
| LeastCommonMultiple(Int64, Int64) |
Returns the least common multiple (lcm) of two integers using Euclid's algorithm.
|
| Log2 |
Evaluate the binary logarithm of an integer number.
|
| Modulus(BigInteger, BigInteger) |
Canonical Modulus. The result has the sign of the divisor.
|
| Modulus(Double, Double) |
Canonical Modulus. The result has the sign of the divisor.
|
| Modulus(Int32, Int32) |
Canonical Modulus. The result has the sign of the divisor.
|
| Modulus(Int64, Int64) |
Canonical Modulus. The result has the sign of the divisor.
|
| Modulus(Single, Single) |
Canonical Modulus. The result has the sign of the divisor.
|
| PowerOfTwo(Int32) |
Raises 2 to the provided integer exponent (0 <= exponent < 31).
|
| PowerOfTwo(Int64) |
Raises 2 to the provided integer exponent (0 <= exponent < 63).
|
| Remainder(BigInteger, BigInteger) |
Remainder (% operator). The result has the sign of the dividend.
|
| Remainder(Double, Double) |
Remainder (% operator). The result has the sign of the dividend.
|
| Remainder(Int32, Int32) |
Remainder (% operator). The result has the sign of the dividend.
|
| Remainder(Int64, Int64) |
Remainder (% operator). The result has the sign of the dividend.
|
| Remainder(Single, Single) |
Remainder (% operator). The result has the sign of the dividend.
|