English

An Euler phi function for the Eisenstein integers and some applications

Number Theory 2021-08-10 v2 Combinatorics

Abstract

The Euler phi function on a given integer nn yields the number of positive integers less than nn that are relatively prime to nn. Equivalently, it gives the order of the group of units in the quotient ring Z/(n)\mathbb{Z}/(n). We generalize the Euler phi function to the Eisenstein integer ring Z[ρ]\mathbb{Z}[\rho] where ρ\rho is the primitive third root of unity e2πi/3e^{2\pi i/3} by finding the order of the group of units in the ring Z[ρ]/(θ)\mathbb{Z}[\rho]/(\theta) for any given Eisenstein integer θ\theta. As one application we investigate a sufficiency criterion for when certain unit groups (Z[ρ]/(γn))×\left(\mathbb{Z}[\rho]/(\gamma^n)\right)^\times are cyclic where γ\gamma is prime in Z[ρ]\mathbb{Z}[\rho] and nNn \in \mathbb{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.

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

R2 v1 2026-06-23T07:36:44.261Z