Description
Primality testing utility written in C++
This utility is best used for systematic searches of large prime numbers, either by public distributed projects or by private individuals. It can handle numbers of many popular forms like Proth numbers, Thabit numbers, generalized Fermat numbers, factorials, primorials and arbitrary numbers. Mersenne numbers are better handled by GIMPS. It is assumed that input candiates are previously sieved by a sieving utility best suited for the specific form of numbers.