कोडिंग कार्यप्रवाह · आदिम पाइथागोरस त्रिक

from math import gcd

def primitive_triples(limit):
    if type(limit) is not int or not 0 <= limit <= 500:
        raise ValueError("hypotenuse.limit")
    result, m = [], 2
    while m * m + 1 <= limit:
        for n in range(1, m):
            c = m * m + n * n
            if c <= limit and (m - n) % 2 and gcd(m, n) == 1:
                a, b = sorted((m * m - n * n, 2 * m * n))
                result.append((a, b, c))
        m += 1
    return sorted(result, key=lambda t: (t[2], t[0], t[1]))