Problem 70 was another problem that is nearly impossible to accomplish without spending time to understanding the math. A brute force approach will be far to computationally expensive to work, although it took me a few tries to discover this.
Rather than show the pages of failed attempts, I’ll just show the argument that brought me the correct answer. Each step after the first took roughly an hour to figure out, making this one of the more challenging problems.
- A prime number will be relatively prime to all numbers less than it, and so primes will minimize
- However, there are no prime numbers p where p-1 is a permutation of p, so a simple prime number will not be the answer.
- The next type of number that would give a large totient would be a product of two primes. Therefore, we need to find two prime numbers that when multiplied are slightly less than
- Careful! Not just any pair of prime numbers will work. The two prime numbers should also be near
sqrt(1e7)so that the totient function will be maximized. Picking a low prime like 2 or 3 will result in a much lower totient function because many numbers will not be relatively prime.
My algorithm became the following:
- Starting at
sqrt(1e7), go up and down grabbing prime numbers.
- Form pairs of these numbers. (ie, make combinations lazily)
- Filter to only the pairs less than
- Filter to only pairs whose product and totient are permutations of each other.
- Take a bunch (say, 50) of these numbers, and pick the one with the lowest
In code that looks like:
;; Finally, this is how I did it: (use '[clojure.contrib.lazy-seqs :only (primes)]) (defn prime? [n] (and (< 1 n) (not-any? #(zero? (rem n %)) (take-while #(<= (* % %) n) primes)))) (def candidates (let [center 3162] ;; Rough estimate of sqrt(1e7) (interleave (take-while #(> % 1) (filter prime? (iterate dec center))) (take-while #(> (* 2 center) %) (filter prime? (iterate inc center)))))) (defn lazy-combinations "Returns lazy combinations of the list, possibly infinitely long." ([as] (lazy-combinations [(first as)] (rest as))) ([as bs] (let [b (first bs)] (lazy-cat (map #(vector % b) as) (lazy-combinations (conj as b) (rest bs)))))) (defn totient [a b] (* a b (reduce * (map #(- 1 (/ 1 %)) [a b])))) (defn are-perms? [a b] (= (sort (str a)) (sort (str b)))) (defn euler-70-works  (->> (lazy-combinations candidates) (filter (fn [[a b]] (and (< (* a b) 1e7) (are-perms? (* a b) (totient a b))))) (take 50) ;; arbitrary, but it works (map (fn [[a b]] [(* a b) (/ (* a b) (totient a b))])) (sort-by second) first first)) (time (euler-70-works)) ;;"Elapsed time: 1658.035361 msecs"
Far from actually needing to take the first 50 candidates after filtering, the above algorithm will give the answer in only 4 candidates. However, during the exploration of the problem, I didn’t actually know which pair of prime numbers would work, so I was a little conservative and took more than was needed to be sure it would give the correct answer. Since it only takes a second to run, performance isn’t an issue.
Whew! That was harder than I expected!