How many integers between 0 and 8 inclusive have an inverse modulo 9?
Hintz PLZ?
An integer k has inverse modulo 9 if gcd(k, 9) = 1.
Checking one by one, the integers that have inverse modulo 9 are 1, 2, 4, 5, 7, 8.
