The set of k-units modulo n

DOI10.2140/INVOLVE.2022.15.367arXiv1708.06812MaRDI QIDQ6290397FDOQ6290397

Authors: John H. Castillo, Jhony Fernando Caranguay Mainguez 

Publication date: 22 August 2017

Abstract: Let $R$ be a ring with identity, $mathcalU(R)$ the group of units of $R$ and $k$ a positive integer. We say that $ainmathcalU(R)$ is $k$-unit if $a^k=1$. Particularly, if the ring $R$ is $mathbb{Z}_n$, for a positive integer $n$, we will say that $a$ is a $k$-unit modulo $n$. We denote with $mathcal{U}_k(n)$ the set of $k$-units modulo $n$. By $ext{du}_k(n)$ we represent the number of $k$-units modulo $n$ and with $ext{rdu}_k(n)=fracphi(n)ext{du}_k(n)$ the ratio of $k$-units modulo $n$, where $phi$ is the Euler phi function. Recently, S. K. Chebolu proved that the solutions of the equation $ext{rdu}_2(n)=1$ are the divisors of $24$. The main result of this work, is that for a given $k$, we find the positive integers $n$ such that $ext{rdu}_k(n)=1$. Finally, we give some connections of this equation with Carmichael's numbers and two of its generalizations: Kn"odel numbers and generalized Carmichael numbers.

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Power residues, reciprocity (11A15) Units, groups of units (associative rings and algebras) (16U60)

This page was built for publication: The set of $k$-units modulo $n$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6290397)