Let (p) be a prime number, and let (a) be an integer that is not divisible by
Question:
Let \(p\) be a prime number, and let \(a\) be an integer that is not divisible by \(p\). Prove that the congruence equation \(a x \equiv 1 \bmod p\) has a solution \(x \in \mathbb{Z}\).
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: