Please only give the correct solution

discrete math

6. Leta=315,b=825.

(a) Use the Euclidean algorithm to find the greatest common divisor of the pair

of integers a, b. (5 points)

(b) Find integers s and t such that sa + tb =gcd(a, b). (5 points)

7. Letn=100,=243. Show that gcd (n,)=1, and find the inverses of n the modulo satisfying 0 < s < . (10 points)