Hello All:
I have obtained a fast algorithm to obtain prime numbers and some pseudoprimes:
G[n_, i_] := PowerMod[i, n+ i, n + i]
n = 10^100
While[n < 10^100 + 100000, i = 2; While[Abs[G[n, i] - i] > 0, i++];
Print[n + i, " ", PrimeQ[n + i]]; n = n + i]
Can you analyze it?
Sincerely
Sebastián Martin Ruiz