Some BCMATH programs involving primes

  1. The Lucas-strong base 2 pseudoprime test;

  2. Performing Proth's algorithm;

  3. Generating prime numbers;

  4. Finding the first probable prime p ≥ m;

  5. Finding the first probable prime p ≥ m, p=ak+b, where gcd(a,b)=1 and a > b > 0;

  6. Perfect-power testing;

  7. Factorisation of small n;

  8. Finding the least primitive root (mod p);

  9. Finding ordma.

Last modified 21st July 2006
Return to main page