Lucas-Lehmer Test/Historical Note

Historical Note on Lucas-Lehmer Test
The Lucas-Lehmer Test was initially designed by, and later refined by.

This calculation is particularly suited to binary digital computers, since calculation $\pmod {2^q - 1}$ is very convenient.

Thus we have a relatively quick way to determine the primality of Mersenne numbers.