Regular integers modulo n

Publication date 18 November 2008

Abstract: Let

n = p_{1}^{u_{1}} ... p_{r}^{u_{r}} > 1

be an integer. An integer

a

is called regular (mod

n

) if there is an integer

x

such that

a^{2} x e q u i v a

(mod

n

). Let

v a r r h o (n)

denote the number of regular integers

a

(mod

n

) such that

1 l e a l e n

. Here

v a r r h o (n) = (p h i (p_{1}^{u_{1}}) + 1) ... (p h i (p_{r}^{u_{r}}) + 1)

, where

p h i (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

v a r r h o (n)

and

p h i (n)

we investigate the average orders and the extremal orders of the functions

v a r r h o (n) / p h i (n)

,

p h i (n) / v a r r h o (n)

and

1 / v a r r h o (n)

.

Recommendations

Cited in

(16)

This page was built for publication: Regular integers modulo n