Compute efficiently pythagore triplets

tripy.hs

@@ -1 +1,3 @@
-square n = [x * x | x <- [1..n]]
+square n = [(x, x * x) | x <- [1..n], x * x > 10]
+
+tripy n = [(a, b, c) | a <- [0..(div n 3)], b <- [(a + 1)..(div n 2)], c <- [(b + 1)..n], a^2 + b^2 == c^2, a + b + c == n]