Fork me on GitHub
Math for the people, by the people.

User login

proof of Euler-Fermat theorem

Keywords: 
number theory
Major Section: 
Reference
Type of Math Object: 
Proof

Mathematics Subject Classification

11A07 no label found11A25 no label found

Comments

We can prove the theorem as a trivial application of Lagrange's theorem
applied to the group of units in integers modulo n.

1. function is phi, not theta
2. please mention that
if gcd(a,n)=1, gcd(a_i,n)=1,
then gcd(a*a_i,n)=1

Subscribe to Comments for "proof of Euler-Fermat theorem"