Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
project euler 3, haskell
--http://www.haskell.org/haskellwiki/Euler_problems/1_to_10 --The prime factors of 13195 are 5, 7, 13 and 29. --What is the largest prime factor of the number 600851475143 ? primes = 2 : filter ((==1) . length . primeFactors) [3,5..] primeFactors n = factor n primes where factor n (p:ps) | p*p > n = [n] | n `mod` p == 0 = p : factor (n `div` p) (p:ps) | otherwise = factor n ps problem_3 = last (primeFactors 600851475143) main = print $ problem_3
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
perfect numbers
first haskell program
Knight Journey
(-‿‿-)
(⁄⁄>⁄▽⁄<⁄⁄)
appending and prepending list
haskell_exam
Goodstein sequences
project euler 2, haskell
Lowest Common Ancestor in a Binary Tree
Please log in to post a comment.