return int |
A power of two. |
int number |
The number of which to find the closest upper power of two. |
Type IntegerTheory
Namespace MathNet.Numerics.NumberTheory
return int |
A power of two. |
int number |
The number of which to find the closest upper power of two. |
return long |
A power of two. |
long number |
The number of which to find the closest upper power of two. |
return long |
|
long a |
|
long b |
|
Int64& x |
|
Int64& y |
gcd) of two integers using Euclid's algorithm.
return long |
Greatest common divisor gcd(a,b) |
long a |
First Integer: a. |
long b |
Second Integer: b. |
gcd) of a set of integers using Euclid's
algorithm.
return long |
Greatest common divisor gcd(list of integers) |
IList<long> integers |
List of Integers. |
gcd) of a set of integers using Euclid's algorithm.
return long |
Greatest common divisor gcd(list of integers) |
Int64[] integers |
List of Integers. |
return bool |
True if and only if it is an even number. |
int number |
The number to very whether it's even. |
return bool |
True if and only if it is an even number. |
long number |
The number to very whether it's even. |
return bool |
True if and only if it is an odd number. |
long number |
The number to very whether it's odd. |
return bool |
True if and only if it is an odd number. |
int number |
The number to very whether it's odd. |
return bool |
True if and only if it is a perfect square. |
int number |
The number to very whether it's a perfect square. |
return bool |
True if and only if it is a perfect square. |
long number |
The number to very whether it's a perfect square. |
return bool |
True if and only if it is a power of two. |
long number |
The number to very whether it's a power of two. |
return bool |
True if and only if it is a power of two. |
int number |
The number to very whether it's a power of two. |
lcm) of a set of integers using Euclid's algorithm.
return long |
Least common multiple lcm(list of integers) |
Int64[] integers |
List of Integers. |
lcm) of two integers using Euclid's algorithm.
return long |
Least common multiple lcm(a,b) |
long a |
First Integer: a. |
long b |
Second Integer: b. |
lcm) of a set of integers using Euclid's algorithm.
return long |
Least common multiple lcm(list of integers) |
IList<long> integers |
List of Integers. |
return int |
2 ^ exponent. |
int exponent |
The exponent to raise 2 up to. |
return long |
2 ^ exponent. |
long exponent |
The exponent to raise 2 up to. |