Didn't really know which category this problem would fit in but I hope this works. I have a homework assignment about pythagoras theorem. There are many examples of Pythagorean tripples where 2 of the sides differs by exactly 1. Examples of this could be (3, 4, 5) , (5, 12, 13) or (20, 21, 29) and I am asked to find a method that can easly find all of these. I started of by assuming that these tripples in general could either be written as (a, a +1, b) or (a, b, b+1). In the first case I assumed that (a2 + (a+1)2 = b2) and then that (2a2+2a+1 = b2) and then took square root of both sides to just get b alone but this doesnt really this doesnt really seem as a good solution at all. I dont really know what I could do else.