MeowsEverywhere
New member
- Joined
- Apr 18, 2014
- Messages
- 1
I'm having trouble showing this proof:
If p is prime and a is an integer such that a is not divisible by p
then there exists an integer, b, such that (a*b) mod p = 1
I don't know how to prove that I'll get a remainder of 1
I need to prove that "there exists an integer, b, such that (a*b) mod p = 1"
If p is prime and a is an integer such that a is not divisible by p
then there exists an integer, b, such that (a*b) mod p = 1
I don't know how to prove that I'll get a remainder of 1
I need to prove that "there exists an integer, b, such that (a*b) mod p = 1"
Last edited: