Question

(a) Prove that if gcd(a, n)=1, then the linear congruence ax=b (mod n ) has the solution x equiv b a^ lambda(n)-1( bmod n).