Try Haste (Ajax version)
Run Haskell
file name:
fact n = if n == 0 then 1 else n * fact (n - 1) -- fact 100 -- try this sieve (p:xs) = filter (\ x -> x `mod` p /= 0) xs sieve [] = [] primes = map head (iterate sieve [2 ..]) -- take 100 primes -- try this main = print (takeWhile (<= 120) primes)
result ↓↓↓: