aboutsummaryrefslogtreecommitdiff
path: root/haskell/003-largest_prime_factor.hs
diff options
context:
space:
mode:
authorCharles <sircharlesaze@gmail.com>2019-08-11 22:36:40 +0200
committerCharles <sircharlesaze@gmail.com>2019-08-11 22:36:40 +0200
commit6b16d921543a62d880171791d39bcc58560785fa (patch)
treed47f5a23a52612107ddcc280c9bd128be7d1070f /haskell/003-largest_prime_factor.hs
parent7b624de8e3e3637a07364f992c1d7e4185e4a872 (diff)
downloadproject_euler-6b16d921543a62d880171791d39bcc58560785fa.tar.gz
project_euler-6b16d921543a62d880171791d39bcc58560785fa.tar.bz2
project_euler-6b16d921543a62d880171791d39bcc58560785fa.zip
haskell problems 001 -> 006
Diffstat (limited to 'haskell/003-largest_prime_factor.hs')
-rw-r--r--haskell/003-largest_prime_factor.hs19
1 files changed, 19 insertions, 0 deletions
diff --git a/haskell/003-largest_prime_factor.hs b/haskell/003-largest_prime_factor.hs
new file mode 100644
index 0000000..4150377
--- /dev/null
+++ b/haskell/003-largest_prime_factor.hs
@@ -0,0 +1,19 @@
+-- Largest prime factor
+
+-- Problem 3
+-- The prime factors of 13195 are 5, 7, 13 and 29.
+
+-- What is the largest prime factor of the number 600851475143 ?
+
+
+main = do
+ print (last $ factors 600851475143)
+
+factors x = trial_division 2 x
+
+trial_division :: Int -> Int -> [Int]
+trial_division by x
+ | x <= 1 = []
+ | x `mod` by == 0 = by:trial_division by (x `div` by)
+ | otherwise = trial_division (by + 1) x
+