Consider a right-angled triangle with integer-valued sides $a<b<c$ where a,b,c are pairwise co-prime. Let $d=c-b$. Suppose $d$ divides $a$. Then
a. Prove that $d \leq 2$
b. Find all such triangles (i.e:) all possible triplets a,b,c) with perimeter less than 100
My attempt:
$$a^2 +b^2 =c^2$$
Then,
$$ a^2 = (c-b)(c+b) \tag{1}$$
From the question $a=(c-b)p$ where $p$ is integer:
$$ p^2 (c-b) = (c+b)$$
Now, $c-b$ is a factor of $c+b$
Another observation that I made: It must be that not all sides are odd, this can be concluded from (1), further 'a' can't be odd with $b,c$ even and a,b can't be both even (this would violate the pairwise co-prime criteria as c is also even)
Now... I'm stuck..