Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Factors of a number, prime numbers
--Title of this code main = print $ factors 54451 factors n = [x | x <- [1..n], n `mod` x == 0] is_prime n = factors n == [1, n]
run
|
edit
|
history
|
help
0
Eerste programma
project euler 2, haskell
folder
State
boolean functions of zero arguments in haskell
project euler 8, haskell
Forkitup
prettier Tasty
sumer
Token