Let n>1 and left f: N -> N be defined as follows, where a and b are integers.
f(x) = (ax + b) mod n
Then f has no fixed points if and only if gcd(a - 1, n) does not divide b.
How would I go about proving this? I tried by proving the contrapositive but I'm still stuck.