An inefficient way to generate Pythagorean triples

triples.py

import itertools, math

def triples():
    """ generates Pythagorean triples sorted by z,y,x with x<y<z
    """
    for z in itertools.count(5):
        for y in range(z-1,3,-1):
            x=math.sqrt(z*z-y*y)
            if x<y and abs(x-round(x))<1e-12:
                yield (int(x),y,z)
                
#Euler Problem 9
for (a,b,c) in triples():
    if a+b+c==1000:
        print(a,b,c,a*b*c)
        break

just to illustrate a much better method http://stackoverflow.com/questions/575117/generating-unique-ordered-pythagorean-triplets/41146390#41146390 in my blog article