Let n and a be positive integers and let d = gcd(a, n).
Chapter 0, Problem 11E(choose chapter or problem)
Let n and a be positive integers and let d = gcd(a, n). Show that the equation ax mod n = 1 has a solution if and only if d = 1. (This exercise is referred to in Chapter 2.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer