An Euler phi function for the Eisenstein integers and some applications

Abstract

The Euler phi function on a given integer n yields the number of positive integers less than n that are relatively prime to n. Equivalently, it gives the order of the group of units in the quotient ring Z/(n). We generalize the Euler phi function to the Eisenstein integer ring Z[] where is the primitive third root of unity e2π i/3 by finding the order of the group of units in the ring Z[]/(θ) for any given Eisenstein integer θ. As one application we investigate a sufficiency criterion for when certain unit groups (Z[]/(γn))× are cyclic where γ is prime in Z[] and n ∈ N, thereby generalizing well-known results of similar applications in the integers and some lesser known results in the Gaussian integers. As another application, we prove that the celebrated Euler-Fermat theorem holds for the Eisenstein integers.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…