pyTriples.py

def pythagoreanTriplets(n):
    # calculate spf array
    spf = EratosthenesSieve(2 * (n - int(sqrt(2 * n - 1))))
    
    # looping for every values of 2*b
    for b2 in range(4, 2 * (n - int(sqrt(2 * n - 1))), 2):
      
        # calculates reduced factor of 2*b
        gamma = getReducedFactorization(b2, spf)
        
        # for findin all triplets from 2*b
        for i in range(1, int(sqrt( b2 * ((b2 // 2) - 1)))//gamma + 1):
            i *= gamma
            sqVal = i * i
            q = sqVal // b2
            if q + i + (b2 // 2) > n:
                break
            else:
                x = q + i
                print((x, (b2 // 2) + i, x + (b2 // 2)))