blob: f7623e421ee222412a15a75125b324ade070bd51 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
modulo :: Int -> Int -> Int
modulo x y =
x - (x `div` y) * y
primeFactors :: Int -> [Int]
primeFactors x =
let p = (\x e c -> if (x == 1)
then (reverse c)
else if (x `modulo` (head e) == 0)
then p (x `div` (head e)) e ((head e) : c)
else p x (tail e) c)
in p x euler []
euler :: [Int]
euler =
let f = (\list -> (head list) : (f (filter (\x -> x `modulo` (head list) /= 0) list)))
in f [2..]
isPowerOf :: Int -> Int -> Bool
isPowerOf x y =
case (compare x y) of
LT -> False
EQ -> True
GT -> if (x `modulo` y == 0) then isPowerOf (x `div` y) y else False
|
