if we are doing modular arith. why will (a)mod p always have an inverse if p is prime???

Please help

Thanks(Headbang)

Printable View

- Mar 8th 2009, 09:30 AMmandy123modular arith.
if we are doing modular arith. why will (a)mod p always have an inverse if p is prime???

Please help

Thanks(Headbang) - Mar 8th 2009, 12:48 PMMoo
Hello,

A number a has an inverse modulo p if a is coprime with p.

so if , where p is prime, then a has an inverse modulo p !

especially if , then it has an inverse. - Mar 9th 2009, 05:57 AMJaneBennet