On Tue, Feb 15, 2011 at 1:13 AM, Andreas Kostler
andreas.koestler.le...@gmail.com wrote:
Hi all,
Does anyone wanna have a look at my solution for Project Euler Problem 28?
(defn diagonal-sum [n-max]
(+ 1 (reduce +
(map (fn[n]
(reduce + (map
On Tue, Feb 15, 2011 at 2:59 AM, Ken Wesson kwess...@gmail.com did NOT write:
(defn diagonal-sum-4 [n-max]
(let [cores (.availableProcessors (Runtime/getRuntime))
step (* 2 cores)]
(inc
(reduce +
(map get
(doall
(map #(future (diagonal-sum-4a
for Project Euler Problem 28?
(defn diagonal-sum [n-max]
(+ 1 (reduce +
(map (fn[n]
(reduce + (map #(- (* n n) (* % (- n 1))) (range 4
(take-nth 2 (range 3 (+ 2 n-max)))
The function does the job. The solution takes about
On Feb 14, 11:13 pm, Andreas Kostler
andreas.koestler.le...@gmail.com wrote:
Does anyone wanna have a look at my solution for Project Euler Problem 28?
(defn diagonal-sum [n-max]
(+ 1 (reduce +
(map (fn[n]
(reduce + (map #(- (* n n) (* % (- n 1
Hi all,
Does anyone wanna have a look at my solution for Project Euler Problem 28?
(defn diagonal-sum [n-max]
(+ 1 (reduce +
(map (fn[n]
(reduce + (map #(- (* n n) (* % (- n 1))) (range 4
(take-nth 2 (range 3 (+ 2 n-max