you're right that gcd(3719, 8416) = 1.
now use the extended euclidean algorithm to get it on the form na + mb = 1.
Extended Euclidean algorithm - Wikipedia, the free encyclopedia
Hey guys, I got a simple question here asking to find the greatest common divisor of a and b in the form ma+mb
the values given are a= -3719 and b = 8416. I am having a bit of trouble working these out when b is greater then a, i know that:
-3719|8416=1=... I think?
Could someone help me here please. Thanks a lotl.
you're right that gcd(3719, 8416) = 1.
now use the extended euclidean algorithm to get it on the form na + mb = 1.
Extended Euclidean algorithm - Wikipedia, the free encyclopedia