Euler Project: Problem 9 in Clojure

This is my solution in Clojure to the ninth problem from Euler project:

	(defn square [x]
	(* x x))
	(defn pythagorean-triplet? [a b c]
	(and (< a b c)
	(= (square c) (+ (square a) (square b)))))
	(def triplet
	(let [nums (range 500)]
	(for [a nums
	b nums
	c nums
	:when (and (= 1000 (+ a b c))
	(pythagorean-triplet? a b c))]
	[a b c])))
	triplet ; [200 375 425]
	(reduce * triplet) ; 31875000

view raw euler-9.clj hosted with ❤ by GitHub