C OMPOSITIO M ATHEMATICA
R OBERT E. D RESSLER
A property of the ϕ and σ
jfunctions
Compositio Mathematica, tome 31, n
o2 (1975), p. 115-118
<http://www.numdam.org/item?id=CM_1975__31_2_115_0>
© Foundation Compositio Mathematica, 1975, tous droits réservés.
L’accès aux archives de la revue « Compositio Mathematica » (http:
//http://www.compositio.nl/) implique l’accord avec les conditions géné- rales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infrac- tion pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques
http://www.numdam.org/
115
A PROPERTY OF THE ~ AND 03C3j FUNCTIONS
Robert E. Dressler
Noordhoff International Publishing
Printed in the Netherlands
1. Introduction
As
usual,
ç stands for Euler’s functionand uj
stands for the sum ofthe
jth
powers of the divisors function. The purpose of this note is to answer thefollowing
very naturalquestion :
If t is apositive integer
andf
is ç or uj, when does t dividef(n)
for almost allpositive integers
n?We also answer this
question
for the Jordan totientfunction,
~j, ageneralization
of the ç function.We will use the well known formulas:
Here
pe~n
meanspeln
andpe+1n.
2. Results Our first theorem concerns the ~ function.
THEOREM
(1):
For anyprime
po and anypositive integer k
we havepk0|~(n) for
almost all n. That is, the setof integers
nfour
whichpk0~(n)
has natural
density
zero.PROOF :
If pk0~(n)
thenby (1),
noprime
divisor p of n satisfies p ~ 11 In the case of ~j, j arbitrary, and 03C3j, j odd, somewhat stronger results than the ones we give may be obtained by much deeper methods, cf. [2, pg. 167J In the case
of 03C3j, j
even,our results are new. In all cases, our methods appear to be much simpler than those of [2].
116
(mod pk0). Now,
if N and Msatisfy
N >pi p’2*...* p’M
wherethe p’i (i
=1,..., M)
are the first Mprimes
congruent to 1(mod pk0),
thenthe number of
positive integers
notexceeding N,
none of whoseprime
divisors is congruent to 1
(mod pk0)
isIf we let N and M vary
together
toinfinity,
then wehave, by
a strong form of Dirichlet’stheorem,
thatThis establishes our result.
Since the finite union of sets of natural
density
zero is a set of naturaldensity
zero we may state thefollowing :
COROLLARY
(1):
Let t be anypositive integer.
ThentlqJ(n) for
almostall n.
It is also worth
noting
that the qJj function wherealso satisfies the conclusions of Theorem 1 and
Corollary
1. To seethis,
observe that if p = 1
(mod p’)
then alsopi
~ 1(mod pô).
The situation for
the 03C3j
functions is morecomplicated.
We first needthe
following
two lemmas:LEMMA
(1): [3,
pg.58].
Let(c, q)
= 1 where q is anyinteger having primitive
roots. The congruencexi
~ c(mod q)
is solvableif’
andonly f
LEMMA
(2):
Given anyprime
po and r such that(r, po)
= 1 and anypositive integer k,
then almost all n are such that n is divisibleby only
the
first
powerof
someprime
congruent to r(mod p’).
PROOF : Let
p’1, p’2,
...,p’M
be the first Mprimes
congruent to r(mod p’).
Let N be greater than
(p’1p’2 *
...pM)2.
Now for any subsetthe number of
integers
N which are not divisibleby
anyand are divisible
by p’2i1*···* p’2iT
is less thanThus,
the number ofintegers ~
N which are divisibleby some p’i (i
=1,..., M) only
to the first power isgreater
thanIf we now let
M,
N ~ oo thenby
a strong form of Dirichlet’s theoremwe have
This
completes
theproof.
THEOREM
(2):
Let po be an oddprime
and let kand j
be anypositive integers.
Thenpk0|03C3j(n) for
almostail n if
andonly if ~(pk0)/(~(pk0),j) is
even.PROOF : Since po is
odd, pk0
hasprimitive
roots. If~(pk0)/(~(pk0), j)
iseven
then, by
Lemma1, xj ~ - 1 (mod pk0)
is solvable. Thus we can findan Xo such that
xb
~ -1(mod pk0).
If aprime
p satisfies p - Xo(mod pk0)
and
if plln,
thenby (2)
we havepk0|03C3j(n).
Tocomplete
this half of theproof
we
apply
Lemma 2 with r = xo .Now,
suppose~(pk0)/(~(pk0),j)
is odd. Since~(pk0) = pk-10(p0 - 1),
itfollows that
~(pk0)/(~(pk0), j)
isodd,
for an oddprime
po, if andonly
if118
is odd.
Thus, by
Lemma1,
x’ - -1(mod po)
is not solvable. Thus for anysquare-free integer n (since aj(n) = 03A0p|n(pj + 1))
we havep003C3j(n).
Since the
square-free integers
have naturaldensity 6/n’
> 0 we are done.In
addition,
we haveTHEOREM
(3):
For anypositive integers
k andj, 2k|03C3j(n) for
almost all n.PROOF: It is
known [1]
that for anypositive integer k,
almost allintegers n
have the property thatthey
are divisibleonly
to the firstdegree by
at least k distinct oddprimes.
For theseintegers n
itfollows,
from(2),
that
2k|03C3j(n)
and theproof
iscomplete.
We may now
capsulize
Theorems 2 and 3 withTHEOREM
(4):
Let po be anyprime
and let kand j be
anypositive integers.
Then
pk 0 Juj(n) for
almost allintegers
nif
andonly if
is even.
Finally,
we stateCOROLLARY
(2):
Let tand j
be anypositive integers.
Thentlain) for
almost all nif
andonly if for
eachprime
divisor pof
t we havep(p - 1)/(p - 1, j)
is even.REFERENCES
[1] DRESSLER, R. E.: On a Theorem of Niven, Can. Math. Bull., Vol. 17 (1974) 109-110.
[2] HARDY, G. H.: Ramanujan-Twelve Lectures on Subjects Suggested by His Life and
Work. Chelsea (1940).
[3] LEVEQUE, W. J.: Topics in Number Theory, Vol. I. Addison-Wesley (1958).
(Oblatum 22-XI-1974) Kansas State University Manhattan, Kansas 66506