Some BCMATH programs involving primes

  1. The Lucas strong base 2 pseudoprime test;

  2. Performing Proth's algorithm;

  3. Generating prime numbers;

  4. Generating Lucas strong base 2 pseudoprimes;

  5. Finding the first probable prime p ≥ m;

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

  7. Perfect-power testing;

  8. Factorisation of small n;

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

  10. Finding ordma.

Last modified 22nd July 2010
Return to main page