This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{- | |
- LucasLehmer | |
- | |
- An implementation of the Lucas-Lehmer primality test for prime numbers of | |
- the form p = 2^k - 1 (Mersenne primes). | |
- | |
- (c) 2013 Max Thom Stahl. Released under the MIT public license. | |
-} | |
module LucasLehmer where |