Finds a pythagoras triples (a,b,c) for a given integer n such that a+b+c = n, for a < b < c

Solving this can be easily done, by checking a constant input for a and solving for b/c.

a can at most be n/3, so the runtime of this is O(n/3). There are probably better bounds for a, but that's good enough for now

Compute

a:

b:

c: