Mersenne primes: Difference between revisions

m
(→‎{{header|Wren}}: Now uses Wren-math module.)
m (→‎{{header|Haskell}}: use iterate)
Line 558:
Using this approach, the Celeron machine (dual core) takes ~180&nbsp;seconds to reach M<sub>9941</sub> and ~270&nbsp;seconds to reach M<sub>11213</sub>.
=={{header|Haskell}}==
<lang haskell>import Data.ListNumbers.Primes (foldrprimes)
import Data.Numbers.Primes (primes)
import Text.Printf (printf)
 
lucasLehmer :: Int -> Bool
lucasLehmer p = goiterate f 4 !! [1..p-2] == 0
where
go = foldr (\_f b ->= (b^2 - 2) `mod` m) 4
m = 2^p - 1
 
Anonymous user