问题描述:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
(ns euler-problem-3.core)
(defn largest-prime-factor
[number]
(loop
[current-num number,n 2,lpf 2]
(if (>= lpf current-num)
lpf
(if (zero? (rem current-num n))
(recur (/ current-num n) n n)
(recur current-num (inc n) lpf)))))
(largest-prime-factor 13195)
(largest-prime-factor 600851475143)
"Elapsed time: 4.15835 msecs"
结果:6857
right!
递归三参数:第一个参数用来保存整除的商,第二个参数用来保存当前的除数,第三个参数用来保存最大的质因素