This is just a little algorithm I came up with for finding Pythagorean triples. Basically the c (in a^2 + b^2 = c^2) is the independent variable/side length, with another independent variable x, and that x-value goes from 0 to c in between each changing of c. If ever the modulo of c^2 and (c-x)^2 is a perfect square, then, due to how poorly made my algorithm is in only picking up Pythagorean triples and not counting random other numbers, it uses the Pythagorean theorem to make sure the Pythagorean triple is ACTUALLY a Pythagorean triple, and if so, it adds it to the list (I may optimize this later so that it only picks up Pythagorean triples without having that extra step in their to ensure the triple's validity, but for now, I'm lazy).
All by me in 62 blocks!
