Regular integers modulo n

Details Regular integers modulo n Regular integers modulo n

2007-10-10

arxiv.org/abs/0710.1936v3

Annales Univ. Sci. Budapest., Sect. Comp., 29 (2008), 263-275

Mathematics

Number Theory

9 pages, final version

Scientific paper

Let $n=p_1^{\nu_1}... p_r^{\nu_r} >1$ be an integer. An integer $a$ is called regular (mod $n$) if there is an integer $x$ such that $a^2x\equiv a$ (mod $n$). Let $\varrho(n)$ denote the number of regular integers $a$ (mod $n$) such that $1\le a\le n$. Here $\varrho(n)=(\phi(p_1^{\nu_1})+1)... (\phi(p_r^{\nu_r})+1)$, where $\phi(n)$ is the Euler function. In this paper we first summarize some basic properties of regular integers (mod $n$). Then in order to compare the rates of growth of the functions $\varrho(n)$ and $\phi(n)$ we investigate the average orders and the extremal orders of the functions $\varrho(n)/\phi(n)$, $\phi(n)/\varrho(n)$ and $1/\varrho(n)$.

Affiliated with

Also associated with

No associations

Rating

Regular integers modulo n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regular integers modulo n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular integers modulo n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462534