if anyone is interested, i used reduces instead of reductions.
2012/12/11 Dennis Haupt d.haup...@gmail.com
i just saw my error :/
Am 11.12.2012 22:22, schrieb Ben Wolfson:
nth is called in doing the destructuring for the argument lists in
your fns defined in try-find-sequence.
i am trying to solve euler problem 125. when i tested this code:
(ns euler.Problem125)
(defn is-palindrome [n]
(let [s (str n)]
(= (seq s) (reverse s
(defn to-check []
(filter is-palindrome (range 1 1000)))
(defn square-root [n]
(Math/sqrt n))
(defn squared [n]
(* n n))
(defn
nth is called in doing the destructuring for the argument lists in
your fns defined in try-find-sequence.
On Tue, Dec 11, 2012 at 1:20 PM, Dennis Haupt d.haup...@gmail.com wrote:
i am trying to solve euler problem 125. when i tested this code:
(ns euler.Problem125)
(defn is-palindrome [n]
i just saw my error :/
Am 11.12.2012 22:22, schrieb Ben Wolfson:
nth is called in doing the destructuring for the argument lists in
your fns defined in try-find-sequence.
On Tue, Dec 11, 2012 at 1:20 PM, Dennis Haupt d.haup...@gmail.com wrote:
i am trying to solve euler problem 125.
