University of Wisconsin–Platteville

The Lucas-Lehmer test uses the fact that S(p – 1) mod Mp = 0 where S1 = 4 and Sn = S2n-1 – 2 if and only if p is prime to give a deterministic result. Applications in Modern Computing This look into the wide world of prime numbers is fascinating, but until the 1970’s, prime numbers held value only to number theorists and people who noted ... ................
................