This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- Answer of Eular Problem 3 "Largest prime factor" | |
answer :: IO () | |
answer = print $ largePrimeFactorOf 600851475143 | |
largePrimeFactorOf :: Int -> Int | |
largePrimeFactorOf x = largePrimeFactorOf' x primes | |
largePrimeFactorOf' x primes@(p:ps) | |
| x == 1 = p |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-module(eularProblem3). | |
-export([answer/0]). | |
%% Answer of Eular Problem 3 "Largest prime factor" | |
answer() -> largePrimeFactorOf(600851475143). | |
largePrimeFactorOf(X) -> largePrimeFactorOf(X, primes(numRange(2, math:sqrt(X)))). | |
largePrimeFactorOf(X, [P|PS]) -> | |
if X == 1 -> P; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;; Answer of Eular Problem 3 "Largest prime factor" | |
(defn primes [] | |
(letfn | |
[(primes [p ns] | |
(let [ns (filter #(not= (rem % p) 0) ns)] | |
(lazy-seq (cons p (primes (first ns) ns)))))] | |
(primes 2 (iterate inc 2)))) | |
(defn largePrimeFactorOf [x] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- Answer of Eular Problem 3 "Largest prime factor" | |
answer :: IO () | |
answer = print $ largePrimeFactorOf 600851475143 | |
largePrimeFactorOf :: Int -> Int | |
largePrimeFactorOf x = largePrimeFactorOf' x 0 | |
largePrimeFactorOf' :: Int -> Int -> Int | |
largePrimeFactorOf' x primeidx = |
NewerOlder