Using the extended Euclidean algorithm, compute the greatest common divisor and the parameters s,t of
1. 198 and 243
2. 1819 and 3587
For every problem check if sr0 +t r1 = gcd(r0,r1) is actually fulfilled. The rules are the same as above: use a pocket calculator and show what happens in every iteration step.