I have to solve this modular linear equation (in paper not using programming)
18x = 81 (mod171)
My thought is we begin using the extended euclidean algorithm (ax+by=gcd(a,b) calculating : (div a/b), the gcd(a,b) and the x,y
An Example Using the Extended Euclidean Algorithm
I know this isn't a short exercise so thanks in advance for looking and trying to help. Meanwhile I'm doing my best searching & trying to understand.