In today’s Programming Praxis exercise, our goal is to calculate the Mersenne prime exponents up to 256. Let’s get started, shall we?
A quick import:
The Mersenne primes can be determine with a simple list comprehension. Although the Lucas-Lehmer test officially doesn’t work for M2, in practice it works just fine so there is no need to make it a special case.
mersennes :: [Int] mersennes = [p | p <- primes, iterate (\n -> mod (n^2 - 2) (2^p - 1)) 4 !! p-2 == 0]
A test shows that the algorithm is working correctly. Piece of cake.
main :: IO () main = print $ takeWhile (<= 256) mersennes == [2,3,5,7,13,17,19,31,61,89,107,127]