Functions

prime modulus p and 0 <= a < p if 0 < a, it’s trivial gcd(a, p) = 1.