Lab 6: 6a, 6b, 7

[BertLisser]

6a (<-10)

6b

printMer::Integer -> IO Integer
printMer x = do  
    b <- primeMR 10 ((2^x)-1)
    if b then putStrLn $ (show x) ++ " = (2^" ++ (show x) ++ "-1)" else putStr ""
    return (if b then 1 else 0)

test_mersprimes::[Integer] -> IO String
test_mersprimes ts =  return ("total " ++) <*> (return show <*> (mp ts))
    where 
        mp = foldr (\x b -> pure (+) <*> (printMer x) <*> b) (return (0)) 

I expected to see results with a varying first argument of primeMR. If this is chosen equal to 1 then you see that even primeMR generates false positives at Mesienne Primes.

6b(<-8)