Answer
Gcd can be solve by using extended euclidean algorithm
In order to find s
Sj=Sj-2 -Sj-1*qj-1
Tj=tj-2-tj-1*qj-1
Work Step by Step
Gcd can be solve by using extended euclidean algorithm
In order to find s
Sj=Sj-2 -Sj-1*qj-1
Tj=tj-2-tj-1*qj-1