http://projecteuler.net/index.php?section=problems&id=183logとって微分した。 del :: Integral a => a -> a -> a del p = until ((0/=).(`mod` p)) (`div` p) d ::Integral a => a -> a d n | (1==).del 5.del 2.div r' $ (gcd n r') = -n | otherwise =…

http://projecteuler.net/index.php?section=problems&id=182 p182 p q = sum [e | e <-[2..phi-1], gcd e phi == 1, gcd (e-1) (p-1) == 2, gcd (e-1) (q-1) == 2] where phi = (p-1)*(q-1) main = print $ p182 1009 3643 {-- g(e,p) = x^e=x (mod p) の解…

http://projecteuler.net/index.php?section=problems&id=181 import Data.Array (range) import Data.Array.IO (IOArray,newArray,readArray,writeArray) import Control.Monad (forM_) b = 60;w = 40 main = do g <- newArray ((0,0),(b,w)) 0 :: IO (IOAr…