The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143?
If you familiar with prime numbers, you apparently know basic algorithms to find them, if not, I advice to get familiar with it. There are lot of problems devoted to prime numbers on Project Euler. So, read 10 minutes about prime numbers, and go on.
In few words, prime number is a number starting from 2 that has no divisors except 1 and itself.
Exposing this logic on all numbers, we can simply find first prime numbers:
2, 3, 5, 7, 11, ...
To implement function that search for prime numbers we can implement predicate, that test whether number is prime or not:
(defn prime? [n] (= 2 (reduce + (for [i (range 1 (inc n))] (if (= 0 (mod n i)) 1 0)))))
We iterate from 1 up to number and calculate reminder of division number by iteration counter.
If result is zero we return 1, otherwise we return 0.
For each number we get list with length of that number that marked with 1 for exact divisors.
For example for
6 list will be
(1 1 1 0 0 1), and for
7 list will be
(1 0 0 0 0 0 0 1).
Than we calculate sum of this list, which represents number of divisors. If count is two, that means number is prime.
This is simplest algorithm for testing prime number, built from prime number definition.
Performing small optimization you can see that in lists above, first and last elements are always equals to 1. We can just drop them. Another optimization is we don't need go on when we found at least one remainder. And I'm pretty sure you can find lot of flaws in this implementation.
But the most useful optimization is assumption that we don't need iterate to
n, we can iterate to
This is based on fact that if we found some number
a that is divisor of
n, then there is another number
b = n / a.
b is also divisior of
n. Little transformation gives us
a * b = n. Assume
a < b, so if we found
a we don't need to seek for
n is not prime. Maximum value of a achieved when
a equals to
a^2 = n,
a = sqrt(n).
This is reduce complexity of algorithm from
In previous problem we mentioned
where we have primes lazy sequence. Let's use it!
Algorithm for solving our problem is following:
To transform statements above into clojure, we get:
(defn greatest-prime-of [number] (reduce max (filter #(zero? (mod number %)) (take-while #(< % (sqrt number)) primes))))
Something new here:
#(= 0 %).
clojure.contrib.math. Name is obvious.
Now, we want to find result. Run the line
Congratulations! Third problem solved.
GitHub for lazy!
P.S. Instead of using
clojure.contrib.math for square root we could just write
(Math/sqrt n) and got rid of dependency.
But for me is better to reuse something that was implemented in library. It's tested and worked, where your implementation can miss some point.
If you have time, dig more into
clojure.contrib.math. It needs about 9 minutes. There are only 9 functions,
but you will probably reinvent them all the time:
round and others.