Prove that if is prime, then for any number , divisible by or not,

Printable View

- Apr 23rd 2010, 12:19 AMZennieWorking with mod p (Euler's and Fermat's Theorem)
Prove that if is prime, then for any number , divisible by or not,

- Apr 23rd 2010, 12:22 AMDrexel28
Are you asking to prove Euler's theorem? Do you know group theory? Note that forms a group whose order is and since any element of a group to it's order is the identity element the conclusion follows.

If you're just trying to apply it merely notice that if then by virtue of 's primality in which case Fermat's theorem applies. If then either in which case the theorem is a triviality.