Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- module Task2_1 where
- import GcdLcmPrime
- -- 2.1)
- range :: Double -> Double -> Double -> [Double]
- range a b d = [a, a + d .. b-1]
- --getPrimes n m = return [ a | a <- [m .. ], myPrime a] >>= take n
- --getPrimes :: Double -> Double -> [Double]
- --getPrimes :: Enum a => Int -> a -> [a]
- getPrimes n m = take n [ a | a <- [m .. ], GcdLcmPrime.myPrime a]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement