An Euler phi function for the Eisenstein integers and some applications
Abstract
The Euler phi function on a given integer yields the number of positive integers less than that are relatively prime to . Equivalently, it gives the order of the group of units in the quotient ring . We generalize the Euler phi function to the Eisenstein integer ring where is the primitive third root of unity by finding the order of the group of units in the ring for any given Eisenstein integer . As one application we investigate a sufficiency criterion for when certain unit groups are cyclic where is prime in and , 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.
Keywords
Cite
@article{arxiv.1902.03483,
title = {An Euler phi function for the Eisenstein integers and some applications},
author = {Emily Gullerud and Aba Mbirika},
journal= {arXiv preprint arXiv:1902.03483},
year = {2021}
}
Comments
27 pages, 5 figures. Version 2 is the final revision to appear in INTEGERS: Electronic Journal of Combinatorial Number Theory