Euler1.clj

(ns euler.core)

;; If we list all the natural numbers below 10 that are multiples of 3 or 5,
;; we get 3, 5, 6 and 9. The sum of these multiples is 23.
;; Find the sum of all the multiples of 3 or 5 below 1000.


(defn p1
  [n]
  (if  (or(= 0 (mod n 3)) (= 0 (mod n 5))  ) 
    true
    false))


(defn m35 
     [numbers] 
     (if-let [mul-nums (seq(filter p1 numbers))]
       mul-nums
       "no numbers"))


(reduce +(m35 (range 1 1000)))