A brief note on Pythagorean Triples

And I decided today to share what I learned about an algorithm for generating Pythagorean triples for any m and n, where  m, n \in Z. A Pythagorean triple are any three whole numbers which satisfy the equation a^2 + b^2 = c^2. Let a = m^2 - n^2; b = 2 m n, and you will obtain a solution to the relation a^2 + b^2 = c^2. It is therefore not that hard, if we allow m and n to be any numbers from 1 to 100, and m \ne n, to write a computer program to generate the first 9800 or so Pythagorean triples, allowing for negative values for a or b.