Anonymous user
Miller–Rabin primality test: Difference between revisions
→{{header|Haskell}}: corrected code
(→Python: Proved correct up to large N: Extra tests) |
(→{{header|Haskell}}: corrected code) |
||
Line 1,090:
=={{header|Haskell}}==
{{works with|Haskell|6.10.4}}
* Ideas taken from [http://primes.utm.edu/prove/prove2_3.html Primality proving]
Line 1,121 ⟶ 1,120:
isMillerRabinPrime :: Integer -> IO Bool
isMillerRabinPrime n | even n
| n `elem` primesTo100 = return True
let pn = pred n
e = uncurry (++) . second(take 1) . span even . iterate (`div` 2) $ pn
|