ulong gcd(ulong a, ulong b)

Greatest common divisor.

ulong lcm(ulong a, ulong b)

Least common multiple.

bool isPrimeNumber(ulong n)

This function checks if a number is prime.

FibonacciRange!T fibonacci(T = long)() 
if(is(T : ulong))

Returns generator of Fibonacci numbers.

real logarithm(real b, real n)

Logarithm.