Home /
Expert Answers /
Algebra /
gnmamsl-a-find-an-inverse-for-73-modulo-660-first-use-the-extended-euclidean-algorithm-to-pa966
(Solved): GNMAMSL (a) Find an inverse for 73 modulo 660 . First use the extended Euclidean algorithm to ...
???GNMAMSL (a) Find an inverse for 73 modulo 660 . First use the extended Euclidean algorithm to find the greatest commen divisor of 660 and 73 and express a as a finear combination of 660 and 72 . Step 2: Find
q_(1)and
q_(1)so that.
660=73*q_(1)+r_(1), where 0<=r_(1)<73Then
r_(1)=660-73*q_(1)=
?. Step 2 : Find
q_(2)and
r_(2)so that
?*a_(2)=?q_(3)r_(3)r_(3)=??*q_(3)=?r_(3)=1,gcd(660,73)=r_(2)=73-4_(2)=0r_(3)=0,gcd(660,73)=73-r_(3)*q_(2)=1r_(3)=1,gcd(660,73)=r_(1)-r_(2)-\phi _(3)=0r_(3)=1,90d(660,73)=73-r_(1)=4_(2)=0r_(3)=0,90d(660,73)=r_(1)=r_(2)-93=1