Number Theory

Returns the prime number of order \e n.

int	`primes` (int n)

Calculates array of Bernoulli numbers using recurrent relations.

void	`bernoulli_A` (int iMax, double* dB)

Calculates array of Bernoulli numbers using an infinite series

void	`bernoulli_B` (int iMax, double* dB)

Calculates Euler numbers by means of recurrent relation

void	`EulerA` (int iMax, double* daEuler)
void	`EulerB` (int iMax, double* daEuler)

Calculates the decomposition of a positive integer into primes.

std::vector<factor>

factorize (unsigned int n)

Calculates the decomposition of a positive integer into primes.

std::vector<factor>

factorize_direct (unsigned n)

This function determines whether n is a prime number or not.

bool	`isPrime` (int n)