- The Lucas strong base 2 pseudoprime test;
- Performing Proth's algorithm;
- Generating prime numbers;
- Generating prime constellations;
- Generating Lucas strong base 2 pseudoprimes;
- Finding the first probable prime p ≥ m;
- Finding the first probable prime p ≥ m, p=ak+b, where gcd(a,b)=1 and a > b > 0;
- Perfect-power testing;
- Factorisation of small n;
- Finding the least prime factor of small n;
- Primitive roots:
- Finding ord
_{m}a.

*Last modified 29th May 2016*

Return to main page