CodeCogs
HomeForumsCart
Login



Forgotten Password?

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
MathsDiscrete

Number Theory

Primes

Returns the prime number of order \e n.
int primes (int n)

Bernoulli A

Calculates array of Bernoulli numbers using recurrent relations.
void bernoulli_A (int iMax, double* dB)

Bernoulli B

Calculates array of Bernoulli numbers using an infinite series
void bernoulli_B (int iMax, double* dB)

Euler

Calculates Euler numbers by means of recurrent relation
void EulerA (int iMax, double* daEuler)
void EulerB (int iMax, double* daEuler)

Factorize

Calculates the decomposition of a positive integer into primes.
std::vector<factor> factorize (unsigned int n)

Factorize Direct

Calculates the decomposition of a positive integer into primes.
std::vector<factor> factorize_direct (unsigned n)

Is Prime

This function determines whether n is a prime number or not.
bool isPrime (int n)