English

Regular integers modulo n

Number Theory 2008-09-01 v3

Abstract

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

Keywords

Cite

@article{arxiv.0710.1936,
  title  = {Regular integers modulo n},
  author = {László Tóth},
  journal= {arXiv preprint arXiv:0710.1936},
  year   = {2008}
}

Comments

9 pages, final version

R2 v1 2026-06-21T09:29:31.710Z