Pythagorean triplets using python's list comprehension

Question

I can find out Pythagorean triplets using for loop as follows:

def triplet(n): # Find all the Pythagorean triplets between 1 and n (inclusive)
  for a in range(n         


        

Answer 1

I think you mean

[(a,b,c) for a in range(n+1) for b in range(a) for c in range(b) if a*a == b*b + c*c]

That at least is syntactically valid.

Answer 2

Notice: This solution is only for the problem when a + b + c <= N

Asssume that a<=b<=c, this version is a little faster:

triplet = [(a,b,c) for a in range(1,N//3+1) for b in range(a,N//2+1) for c in range(b,N-1) if a**2 + b**2 == c**2]