Problem Statement

A list comprehension is a special syntax in some programming languages to describe lists. It is similar to the way mathematicians describe sets, with a set comprehension, hence the name. Some attributes of a list comprehension are:

Write a list comprehension that builds the list of all Pythagorean triples with elements between   1   and   n. If the language has multiple ways for expressing such a construct (for example, direct list comprehensions and generators), write one example for each.

Let's start with the solution:

(defn pythagorean-triples [n]
  (for [x (range 1 (inc n))
	y (range x (inc n))
	z (range y (inc n))
	:when (= (+ (* x x) (* y y)) (* z z))]
    [x y z]))