Regular integers modulo n
Number Theory
2008-09-01 v3
Abstract
Let be an integer. An integer is called regular (mod ) if there is an integer such that (mod ). Let denote the number of regular integers (mod ) such that . Here , where is the Euler function. In this paper we first summarize some basic properties of regular integers (mod ). Then in order to compare the rates of growth of the functions and we investigate the average orders and the extremal orders of the functions , and .
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