let a and n>1 be integers that are relatively prime. then gcd(a,n)=1 and Bezout's Theorem says there are integers s and t such that 1=a*s+n*t. Suppose s=56 and n=51. Find a bar ^-1 in Z/51 and write it as c bar where 0 <_ c < 51. what is c?
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.