A positive integer k is self invertible modulo p iff. How to prove this?
Follow Math Help Forum on Facebook and Google+
Originally Posted by dwsmith A positive integer k is self invertible modulo p iff. How to prove this? I assume you meant . By definition an integer is called an inverse of modulo a prime if satisfies . Here is an inverse of itself, therefore ...
Originally Posted by dwsmith A positive integer k is self invertible modulo p iff. How to prove this? I pressume p is a prime, and then is self-invertible modulo p iff The second biconditional following from the fact that p is prime. Tonio