Prove Euler’s theorem: if n and a are positive integers with gcd(a,n)=1, then aφ(n)≡1 modn, where φ(n) is the Euler’s function of n.
Coins can be redeemed for fabulous gifts.
Log In
Sign Up
Get Answers For Free Most questions answered within 1 hours.