So this is a mathproblem I find really hard and can't solve on my own. The goal is to find a method that can give us pythagorean tripples where the two legs only differs by one (a, a+1, b). An example of this could be (3,4,5), (20,21,29), (119,120,169) etc. This method should also be found by using numbers theory. I have started a bit but I don't know how to come any further... I would be very thankful if some one could help. imgur link to what I have done so far - https://imgur.com/gallery/YsUi74T