Thread: Euclidean Algorithm & Chinese Remainder Theroem

Hey all ive been attempting this question and ive become a bit stuck.

Heres the question.



Heres my solution

(i) GCD=1

(ii) x = 7 , y = -29

(iii) Do i just set A = 7 & B = -29, and thats it?

(iv) x == 112 x (7) x 2 + 27 x (-29) x 4
== -1564 mod 112,27

Is this all correct?

Thanks all!

Maybe I'm just going blind, but I don't see the question.