2.clj

2.clj

(ns problem2.core)

(defn fib-rec
  [ list-fib n ]
  (if
    (< (last list-fib) 4000000)
    (fib-rec (conj list-fib (reduce + (take-last 2 list-fib))) (- n 1)) list-fib)
)

(defn fib
  [ n ]
  (fib-rec [0 1] n)
)

(defn sum-even
  [ list-sum ]
  (reduce + (filter even? list-sum))
)

(defn -main
  [& args]
  (sum-even (fib 10))
)