Lab 6

[BertLisser]

No comment. Perfect.
Interesting remark:

--alternative solution with monads, can not work with infinite lists
--generates a list of potential mersenne primes for given list
--uses miller rabin test to classify primality
mrMersennePrimeGenerator :: [Integer] -> IO [Integer]
mrMersennePrimeGenerator [] = return []
mrMersennePrimeGenerator (x:xs) = do 
    result <- mrMersenneTest x 1
    recurse <- mrMersennePrimeGenerator xs
    if result then return (x : recurse ) 
        else return recurse