Description
GPU version of the LLR program.
Primality proving program for numbers of the form N = k*b^n +/- 1, (k < b^n), or numbers which can be rewritten in this form, like Gaussian-Mersenne norms or b^n-b^m +/- 1 with n>m (new feature). The identity Phi(3,-X) = X^2-X+1 is now used with X=b^n to search for Generalized Unique Primes.