isi-entrance 2020 Q7

isi-entrance · India · UGB Number Theory GCD, LCM, and Coprimality
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.
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.