How to proof that equation? ? I now that if m is primes we have little fermat theorem, but what is when it is not primes. How can I proof this?
Follow Math Help Forum on Facebook and Google+
Originally Posted by oszust001 How to proof that equation? ? I now that if m is primes we have little fermat theorem, but what is when it is not primes. How can I proof this? I'm going to assume that is relatively prime to . So we have by Euler's Theorem (a generalization of Fermat's Theorem). Then we can multiply both sides by to get . Note that since ; therefore we can divide both sides of by to get the equivalent congruence .
View Tag Cloud