# Properties of rational arithmetic functions

## Full text

(1)

### PROPERTIES OF RATIONAL ARITHMETIC FUNCTIONS

VICHIAN LAOHAKOSOL AND NITTIYA PABHAPOTE

Received 13 January 2005 and in revised form 20 September 2005

Rational arithmetic functions are arithmetic functions of the formg1∗ ··· ∗gr∗h−11 ··· ∗h−1

s , wheregi,hjare completely multiplicative functions anddenotes the

Dirich-let convolution. Four aspects of these functions are studied. First, some characterizations of such functions are established; second, possible Busche-Ramanujan-type identities are investigated; third, binomial-type identities are derived; and finally, properties of the Kesava Menon norm of such functions are proved.

1. Introduction

By anarithmetic functionwe mean a complex-valued function whose domain is the set of positive integersN. We define the addition and the Dirichlet convolution of two arith-metic functions f andg, respectively, by

(f+g)(n)=f(n) +g(n), (f∗g)(n)=

i j=n

f(i)g(j). (1.1)

It is well known (see, e.g., [1,5,13,19,21]) that the set (Ꮽ, +,) of all arithmetic func-tions is a unique factorization domain with the arithmetic function

I(n)=   

1 ifn=1,

0 otherwise, (1.2)

being its convolution identity.

A nonzero arithmetic function f Ꮽis calledmultiplicative, denoted by f ᏹ, if f(mn)= f(m)f(n) whenever (m,n)=1. It is calledcompletely multiplicative, denoted by f Ꮿ, if f(mn)= f(m)f(n) for allm,n∈N.

For nonnegative integersr,s by an (r,s)-rational arithmetic function f, denoted by f Ꮿ(r,s), we mean an arithmetic function which can be written as

f =g1∗ ··· ∗gr∗h11∗ ··· ∗h−s1, (1.3)

(2)

where eachgi,hj∈Ꮿ. Such functions were first studied by Vaidyanathaswamy [23] in

1931, and later by several authors; see, for example, [4,6,7,9,10,13,16,18,20]. Two important classes of rational functions areᏯ(1, 1) whose elements are known astotients, andᏯ(2, 0) whose elements are the so-calledspecially multiplicative functions. Character-izations of these two classes can be found in [7,10], respectively.

The present work deals with four aspects of rational arithmetic functions. In the next section, some characterizations of these functions are derived and are then used in the next sections to investigate whether two types of identities, the Busche-Ramanujan iden-tity and the binomial ideniden-tity, which are known to hold for totients and/or specially mul-tiplicative functions, continue to hold for general rational arithmetic functions. In the last section, the Kesava Menon norm of such functions is studied.

We will find it helpful to make use of two important concepts which we now recall. For f Ꮽ, f(1)R+, the Rearick logarithm of f (see [11,14,15]), denoted by Logf , is defined via

(Logf)(1)=logf(1),

(Logf)(n)= 1 logn

d|n

f(d)f−1 n

d

logd= 1 logn

df∗f−1(n) (n >1), (1.4)

wheredf(n)= f(n) logndenotes the log derivation of f. The Hsu’s generalized M¨obius function (see [2])µr,r∈R, is defined as

µr(n)= p|n

r

νp(n)

(1)νp(n), (1.5)

whereνp(n) is the highest power of the primepdividingn. It is known (see [8,12]) that

for f ᏹ,

f =⇒ fr=µ−rf, (1.6)

and the converse holds under additional hypotheses.

2. Characterizations

In this section,randswill generally denote nonnegative integers. Should either of them be zero, the sum and/or any other expressions connected with them are taken to be zero.

Theorem2.1. Let r,sbe nonnegative integers and f . Then, f Ꮿ(r,s)⇔for each primepand eachα∈N, there exist complex numbersa1(p),. . .,ar(p),b1(p),. . .,bs(p)such

that

(Logf)(n)=      1 α

a1(p)α+···+a

r(p)α−b1(p)α− ··· −bs(p)α

ifn=pα,

0 otherwise.

(3)

Proof.

f Ꮿ(r,s)⇐⇒f =g1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1

gi,hj∈

⇐⇒Logf =Logg1+···+ Loggr−Logh1− ··· −Loghs.

(2.2)

The result now follows immediately from Carroll’s theorem [3] which states that for F∈ᏹ,

F∈⇐⇒(LogF)(n)=      1

αF(p)α ifn=pα, 0 otherwise.

(2.3)

Taking a1(p)α= f(pα+1)/ f(p), b1(p)=b(p) in Theorem 2.1, we get the following corollary.

Corollary2.2. Let f , withf(p)=0for each primep. Thenf Ꮿ(1, 1)⇐⇒for each primepand eachα∈N, there is a complex numberb(p)such that

(Logf)(n)=        1 α

fpα+1 f(p) −b(p)

α

ifn=pα,

0 otherwise.

(2.4)

Theorem2.3. Letr,s be nonnegative integers and f . Then f Ꮿ(r,s)⇔for each primepand eachα∈N, there exist complex numbersa1(p),. . .,ar(p),b1(p),. . .,bs(p)such

that for allα≥s,

fpα=

s

k=0

Gα−kHk, (2.5)

where

Gα−k=

j1+···+jr=α−k

a1(p)j1···a

r(p)jr, G0=1,

Hk=(1)k

1≤i1<i2<···<ik≤s

bi1(p)···bik(p), H0=1.

(2.6)

Proof.

f Ꮿ(r,s)⇐⇒f =g1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1

gi,hj∈

⇐⇒fpα= j1+···+jr+k1+···+ks=α

g1(p)j1···g

r(p)jrh−11

pk1···h1

s

pks.

(2.7)

The result now follows by grouping terms on the right-hand side and usingh−1(pk)=0

(4)

A few known characterizations of two particular classes of functions, namely, those inᏯ(1, 1), that is, totients (see [7]), and those inᏯ(2, 0), that is, specially multiplicative functions (see [13, Theorem 1.12]), are immediate consequences ofTheorem 2.3, which we record in the following corollary together with a characterizing property ofᏯ(1,s) to be used later.

Corollary2.4. Let f . Then the following hold.

(i) f Ꮿ(1, 1)⇔for each primepand eachα∈N, there exists a complex numbera(p) such that

fpα=a(p)α−1f(p). (2.8)

(ii) f Ꮿ(2, 0)⇔for each primepand eachα(2)N,

fpα+1= f(p)fpα+fpα−1fp2−f(p)2. (2.9)

(iii) f Ꮿ(1,s)⇔for each primepand eachα∈N, there exist complex numbersa(p), b1(p),. . .,bs(p)such that for allα≥s,

fpα= s

k=0

g(p)α−kHk, (2.10)

where

Hk=(1)k

1≤i1<i2<···<ik≤s

bi1(p)···bik(p), H0=1. (2.11)

Simplified characterizations for rational arithmetic functions belonging to the classes whereris 0 can similarly be obtained as in the next corollaries.

Corollary2.5. Letsbe a nonnegative integer and f . Then f Ꮿ(0,s)⇔for each primep, f()=0for allα > s.

Proof.

f Ꮿ(0,s)⇐⇒f =h−11∗ ··· ∗h−s1

hi∈

⇐⇒fpα= i1+···+is=α

h−1 1

pi1···h1

s

pis. (2.12)

The result now follows by noting that forh∈Ꮿ, we haveh−1(p)= −h(p),h1(pi)=0

fori≥2, and that thescomplex numbersh1(p),. . .,hs(p) are uniquely determined by the

svalues f(p),. . .,f(ps), which are generally arbitrary. In fact, by elementary symmetric

functions, we note thath1(p),. . .,hs(p) are just all thesroots of

Xs+f(p)Xs−1+···+fps−1X+fps=0. (2.13)

This indeed renders their existence, which was stated in the result ofTheorem 2.3, to be

(5)

Invoking upon the fact that f Ꮿ(r, 0) f−1(0,r), we easily deduce our next result which appears as [13, Problem 1.16, page 48].

Corollary2.6. Letrbe a nonnegative integer and f . Then

f Ꮿ(r, 0)⇐⇒for each primep, f−1pα=0 ∀α > r. (2.14)

Corollary2.7. Letrbe a nonnegative integer and f . Then f Ꮿ(r, 0)⇔for each primep, and for allα≥r,

fpα+1= −fpαf−1(p) + fpα−1f−1p2+···+fpα−r+1f−1pr. (2.15)

Proof. This follows by expanding f ∗f−1=I at the prime powers pαand applying the

result ofCorollary 2.6.

Recall that totients are elements ofᏯ(1, 1). It seems natural to further characterize a particular class ofᏯ(r,s), called here (r,s)-totients, defined by

f =gr∗h−s, g,h∈. (2.16)

Theorem2.8. Letr,sbe nonnegative integers, f . Thenf is an(r,s)-totient⇔for each primepand eachα(>2)N, there are complex numbersa(p),b(p)such that

fpα=(1)α α

i=0

−r α−i

s i

a(p)α−ib(p)i. (2.17)

Proof. Using the definition and properties of Hsu’s generalized M¨obius function men-tioned inSection 1, we have

f is an (r,s)-totient ⇐⇒f =grh−s=µ−rgµ sh

⇐⇒fpα=

α

i=0

µ−rgpα−iµshpi.

(2.18)

Takinga(p)=g(p),b(p)=h(p), the result follows. Another important characterization ofᏯ(r,s) involving recurrence is due to Rutkowski [18] which states that f =g1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1Ꮿ(r,s)for each primep

and eachα∈N, there exist complex numbersc1(p),. . .,cr(p) such that

fpα=c1(p)fpα−1+···+cr(p)f

pα−r (α > s), (2.19)

where

c1(p)=

r

i=1

gi(p), c2(p)= −

1≤i1<i2≤r

gi1(p)gi2(p),. . .,cr(p)=(1)r+1g1(p)···gr(p).

(2.20)

(6)

3. Busche-Ramanujan-type identities

It is well known (see, e.g., [21, page 62], [7,10], or [13]) that

f Ꮿ(2, 0)⇐⇒there existsB∈Ꮿsuch that for allm,n∈N, we have

f(m)f(n)=

d|(m,n) f

mn d2

B(d) (3.1)

⇐⇒there existsF∈ᏹsuch that for allm,n∈N, we have

f(mn)=

d|(m,n) f

m d

f n

d

F(d), (3.2)

and that

f Ꮿ(1, 1)⇐⇒there existsh∈Ꮿsuch that for allm,n∈N, we have

f(m)f(n)=

d|(m,n) f

mn d

h(d)µ(d) (3.3)

⇐⇒there existsF∈ᏹsuch that for allm,n∈N, we have

f(mn)=

d|(m,n) f

m d

f

n d

F(d), (3.4)

whenever the greatest common unitary divisor (m,n)u=1, f(p2)= f(p)2+F(p), and

f(p)=0 for all primesp. For the notion of unitary divisor, see [21, page 9].

Identities (3.1) and (3.2) are known as Busche-Ramanujan identities, while (3.4) is called the restricted Busche-Ramanujan identity because of the restrictions onm,n. In this section, we ask whether similar identities hold for functions in generalᏯ(r,s). An earlier aﬃrmative answer to a particular case of this problem appears in [9, Theorem 4.2] which in our terminology states that for f =g1∗g2∗h−1(2, 1), we have

f(mn)=

d|(m,n)

g1∗g2m d

f

n d

µ(d)g1(d)g2(d), (3.5)

wheneverγ(m)(n), whereγ(m) denotesthe product of all distinct primes factors ofm. We will show that there are similar Busche-Ramanujan-type identities for functions in the classesᏯ(r,s) withr=1, 2, but are possible forr≥3 with rather artificial flavor. As to be expected, the identities are of restricted form, that is, hold with conditions onm,n. Definition 3.1. Let s be a nonnegative integer. A pair (m,n)N×N is said to be s -excessive if for each primepdividing (m,n), eitherνp(m)≥νp(n) +sorνp(n)≥νp(m) +

s, whereνp(m) denotes the highest power ofpappearing inm.

(7)

Theorem3.2. Letsbe a nonnegative integer and f =g∗h−1

1 ∗ ··· ∗h−s1Ꮿ(1,s). For

each primep, ifg(p)=0, andsk=0g(p)s−kHk=0, whereHk=(1)k

1≤i1<i2<···<ik≤shi1(p) ···hik(p),H0=1, then there existsF∈such that

f(mn)=

d|(m,n) f

m

d

f

n d

F(d), (3.6)

for eachs-excessive pair(m,n).

Proof. Since f ᏹ, the identity holds for allm,nwith (m,n)=1. It thus remains to prove this identity when (m,n)>1. For such s-excessive pair (m,n), let their prime factorizations be

m=pa1

1 ···puauqc111···qc1vv, n=p1b1···pbuuq21d1···q2dww, (3.7)

wherepi,q1j,q2kare distinct primes;ai,bj,ck,dlare positive integers. By multiplicativity,

we can write

f(mn)=Q

u

i=1 fpai+bi

i

, (3.8)

where

Q=fqc1 11

···fqcv 1v

fqd1

21

···fqdw 2w

. (3.9)

The right-hand side of the identity becomes

d|(m,n) f

m d

f n

d

F(d)=Q

u

i=1 min(ai,bi)

j=0

fpai−j

i

fpbi−j

i

Fpij. (3.10)

Assuming without loss of generality thatνp(m)≥νp(n) +s, that is,a≥b+s, the identity

will be established if we can findF∈ᏹsatisfying

fpa+b= b

j=0

fpa−jfpb−jFpj, (3.11)

for each primep. It suﬃces to exhibitF(pj), the values ofFat prime powers, independent

ofaandb, such that

fa+b= b

j=0

fa−jfb−jFj, (3.12)

where, for short, we put f(pi)= f

i,F(pj)=Fj. Substitutingb=1 into (3.12), we have

(8)

Replacing fa+1, fa, fa−1,f1usingCorollary 2.4(iii), we have

s

k=0

g(p)a+1−kHk=

g(p)

s

i=1 hi(p)

s

k=0

g(p)a−kHk+F1 s

k=0

g(p)a−1−kHk, (3.14)

yielding F1 =g(p)si=1hi(p), which is independent of a, provided that g(p) and

s

k=0g(p)a−1−kHkare nonzero. Substitutingb=2 into (3.12), we get

fa+2=faf2+fa−1f1F1+fa−2F2 (a≥s+ 2). (3.15)

Replacing fa+2, fa, fa−1,f2, f1, usingCorollary 2.4(iii) and the value ofF1, we find that

F2=g(p)2 s

i=1 hi(p)

2

1≤i1<i2≤s

hi1(p)hi2(p)

, (3.16)

independent ofa. In general, for fixed j, fromCorollary 2.4(iii), witha−j≥s, we have

fa+j=g2jfa−j, fa+j−1=g2j−1fa−j,. . ., fa−j+1=g fa−j. (3.17)

Substituting these and the previous values ofFi(i < j) into (3.12), and dividing by fa−j,

we uniquely determineFj independent ofa. Note that the division by fa−jis legitimate

because fromg(p), fs=k=s 0gs−kHkbeing nonzero, we immediately infer that fa=0 for

alla≥s.

Theorem3.3. Lets∈N. If f =g1∗g2∗h−11∗ ··· ∗h−s1Ꮿ(2,s), then

f(mn)=

d|(m,n)

g1∗g2m d

f n

d

µ(d)g1g2(d), (3.18)

for each(s−1)-excessive pair(m,n)withγ(m)(n).

Proof. Clearly, the identity holds for allm,n withγ(m)(n) and (m,n)=1. It thus remains to prove this identity when (m,n)>1. For each (s−1)-excessive pair (m,n) with γ(m)(n), let their prime factorizations be

m=pa1

1 ···pauu, n=p1b1···pbuu, (3.19)

wherepiare distinct primes,ainonnegativeintegers, andbipositiveintegers,ai≤bi(i=

1, 2, 3,. . .,u). By multiplicativity, we can write

f(mn)=

u

i=1 fpai+bi

i

(9)

The right-hand side of the identity becomes

d|(m,n)

g1∗g2m d

f n

d

µ(d)g1g2(d)

=

u

i=1

ai

j=0

g1∗g2pai−j

i

fpbi−j

i

µpjg1g2pj.

(3.21)

The identity will be established if we can show that

fpa+b= a

j=0

g1∗g2pa−jfpb−jµpjg1g2pj, (3.22)

for each primepanda∈N∪ {0},b∈Nwithb≥a+s−1. To this end, it suﬃces to show that

fa+b=ga∗fb−ga−∗1fb−1g1, (3.23)

where f(pi)=f

i, (g1∗g2)(pi)=gi∗, (g1g2)(pj)=gj.

Fora=0, (3.23) trivially holds. Whena=1,b≥s, from Rutkowski’s recurrence, we get

fb+1=c1fb+c2fb−1. (3.24)

Noting thatc1=g1,c2= −g1, (3.23) follows in this case. Now proceed by induction on a. Assume that (3.23) holds up toa−1. Again by Rutkowski’s recurrence, whenb+a≥ s−1, noting also that f andg1∗g2satisfy the same recurrence, we have

fa+b=c1fb+a−1+c2fb+a−2 =c1ga−1fb−ga−∗2fb−1g1

+c2ga−1fb−1−ga−2fb−2g1

=c1ga−1fb+ga−∗2fbc2+c2ga−∗1fb−1 =ga∗fb−ga−∗1fb−1g1,

(3.25)

as required.

(10)

Proposition3.4. Let f Ꮿ(3, 0). If f satisfies the Busche-Ramanujan identity

f(mn)=

d|(m,n) f

m d

f n

d

F(d) (m,n∈N), (3.26)

whereF∈, then for each primep, there are five possibilities: (1) f(pn)=0for alln1, or

(2) f(pn)=(f(p))nfor alln1, or

(3) f(p2n)=(f(p2))n, f(p2n−1)=0for alln1, or (4) f(pn)=(1 +n)(f(p)/2)nfor alln1, or

(5) f(pn)=(1/2)(1 +f(p)/D)((f1+D)/2)n+ (1/2)(1f1/D)((f1D)/2)nfor alln

1, whereD=4f(p2)3(f(p))2=0.

Proof. Proceeding as in the proof ofTheorem 3.2, we are looking for necessary conditions for f to satisfy the Busche-Ramanujan identity and this amounts to findingF∈ᏹsuch that

fa+b= b

j=0

fa−jfb−jFj, (3.27)

for each prime p and a≥b, that is, assuming without loss of generality thatνp(m)

νp(n). Substitutingb=1 into (3.27), we obtain the main recurrence relation

fa+1= faf1+fa−1F1 (a≥1). (3.28)

Puttinga=1, we getF1=f2−f12. FromCorollary 2.7,

faf1+fa−1F1=faf1+ fa−1

f2−f2 1

+fa−2

f3−2f1f2+ f3 1

, (3.29)

which entails

fa−1F1=c2fa−1+c3fa−2 (a≥3), (3.30)

wherec2= f2−f12,c3=f3−2f1f2+f13. UsingF1=f2−f12=c2, this last relation simpli-fies toc3fa−2=0 (a≥3), and so either

(i) fn=0 for alln≥1, or

(ii) 0=c3=f3−2f1f2+ f13.

In the latter situation, we divide into two cases according toc2=0 orc2=0.

Case 1(c2=0). In this case, it easily follows from the main recurrence relation that fa=

(11)

Case 2(c2=0). In this case, we further subdivide into two subcases according to f1=0 or not.

Subcase 2.1(f1=0, and so f2=c2=0). Using the main recurrence relation, it is easily checked that f(p2n)=(f(p2))n, and f(p2n−1)=0 for alln1.

Subcase 2.2(f1=0). In this case, the main recurrence relation is a second-order recur-rence with constant coeﬃcients whose characteristic equation isx2f1xc2=0, with roots (1/2)(f1±D), whereD=f12+ 4c2. The solutions corresponding toD=0 orD=0 are listed as (4) and (5), respectively, in the statement of the proposition.

In the proof ofProposition 3.4,Case 1contains, as a special case, the identity func-tion, while other cases contain some nontrivialᏯ(2, 0)-functions, and some nontrivial

Ꮿ-functions.Proposition 3.4indicates somewhat thatᏯ(3, 0)-functions which satisfy rea-sonable Busche-Ramanujan-type identity can be artificially constructed from those sat-isfying conditions in any of the five cases. We now give an example to substantiate this claim. Recall fromCorollary 2.7that f Ꮿ(3, 0)for each primepand integerse≥3, we have

fe+1=fef1+fe−1A+ fe−2B, (2.31)

where fe= f(pe), A=A(p)= f2− f12,B=B(p)= f3−2f2f1+ f13. Should there be a Busche-Ramanujan-type identity, subject to certain conditions onm,n, proceeding as in the proof ofTheorem 3.2, we deduce that there must existF∈ᏹsatisfying

fa+b= b

i=0

fa−ifb−iFi, (2.32)

wherea≥b,Fi=F(pi). Consider theᏯ(3, 0)-function defined by

f(1)=1, f2a (a≥1) (2.33)

satisfying (2.31) with

B(2)=f232f22f21+f23=0,

fpa=0 (a≥1) (2.34)

for all other primesp≥3. This particular function f Ꮿ(3, 0) because it satisfies (2.31) with A(2), A(p), B(p) (p prime 3) arbitrary but B(2)=0. It satisfies the Busche-Ramanujan identity (2.32) withF(2)=A(2), F(2i)=F(pj)=0 (i2, j1). The

sit-uations for generalᏯ(3,s) andᏯ(r,s) withr≥3 are analogous. The details are omitted. Another class of identities for functions inᏯ(2, 0), called extended Busche-Ramanujan identity, is due to Redmond and Sivaramakrishnan [16] which states that for f Ꮽ, define

t0(n)=t(n), tk(n)=

  

t(n) ifn|k,

(12)

LetT0=T,Tk=µ∗tk. If f =g1∗g2∈Ꮿ(2,0), then

d|(m,n) f

m

d

f

n d

g1g2(d)Tk(d)=

d|(m,n,k)

t(d)g1g2(d)f

mn d2

. (2.36)

Using exactly the same proof as in [16, Theorem 13], together with the result ofTheorem 3.3, we have the following theorem.

Theorem3.5. Lets∈N. If f =g1∗g2∗h−11∗ ··· ∗h−s1(2,s), then

d|(m,n)

g1∗g2m d

f n

d

g1g2(d)Tk(d)=

d|(m,n,k)

t(d)g1g2(d)f mn

d2

, (3.37)

for each(s−1)-excessive pair(m,n)withγ(m)(n).

4. Binomial-type identities

It is known, see, for example, [16] or [21, Chapter 13], that if f =g1∗g2∈Ꮿ(2, 0), then f satisfies the so-calledbinomial identity

fpk=

[k/2]

j=0 (1)j

k−j

j

f(p)k−2jg1(p)g2(p)j, (4.1)

wherepis a prime,k∈N.In [6], another form of binomial identity is found, namely,

2kfpk=

[k/2]

i=0

k+ 1 2i+ 1

f(p)k−2if(p)24g1(p)g2(p)i. (4.2)

The derivation of (4.1) in [16] is by induction, while that of (4.2) in [6] is based on solv-ing second-order recurrence relation. Maksolv-ing use of certain Chebyshev-type identities, Haukkanen also derived the following inverse forms of (4.1) and (4.2):

f(p)k=

[k/2]

i=0

k i

k i−1

fpk−2ig1(p)g2(p)i, (4.3)

(k+ 1)f(p)k=

[k/2]

i=0

k+ 1 2i

d2i2k−2if

pk−2if(p)24g1(p)g2(p)i, (4.4)

whered2iis defined as in [17, Section 3.4], namely, via the generating series relation

2x exe−x =

i=0 d2i x

2i

(13)

Our objective in this section is to use Rutkowski’s recurrence to derive binomial-type identities and their inverse forms similar to (4.1)–(4.4) for elements inᏯ(2,s). Our start-ing point comes from the observation that (4.1) and (4.2) are indeed equivalent through a combinatorial identity, which we now elaborate.

Starting from (4.2), we have

fpk= [k/2]

i=0

k+ 1 2i+ 1

f(p) 2

k−2if(p)

2 2

−g1(p)g2(p) i

= [k/2]

i=0

k+ 1 2i+ 1

f(p) 2

k−2i i

j=0

i j

f(p) 2

2i−2j

−g1(p)g2(p)j

= [k/2]

j=0 [k/2]

i=j

k+ 1 2i+ 1

i j

f(p) 2

k−2j

−g1(p)g2(p)j

= [k/2]

j=0

(1)jf(p)k−2jg1(p)g2(p)j

1 2k−2j

[k/2]

i=j

k+ 1 2i+ 1

i j

= [k/2]

j=0 (1)j

k−j

j

f(p)k−2jg1(p)g2(p)j,

(4.6)

which is (4.1). The last equality follows from the combinatorial identity

[k/2]

i=j

k+ 1 2i+ 1

i j

=2k−2j

k−j

j

(4.7)

which appears in Riordan [17, problem 18(c)].

Theorem4.1. Lets∈Nand f =g∗G∗h−1

1 ∗ ··· ∗h−s1Ꮿ(2,s). For each primepand

eachk >0,

2k+sfpk+s=(A+B)S

k+s(p)2

Bg(p) +AG(p)Sk+s−1(p), (4.8)

fpk+s=(A+B) [(k+s)/2]

j=0 (1)j

k+s−j

j

f(p) +H(p)k+s−2jg(p)G(p)j

−Bg(p) +AG(p)Sk+s−1(p) 2k+s−1 ,

(14)

where

H(p)=

s

i=1

hi(p), A= f

p1+sG(p)fp2+s

gp1+sG(p)g(p) , B=

fp2+sg(p)fp1+s

Gp1+sG(p)g(p),

(4.10)

Sk+s(p)=

[(k+s)/2]

i=0

k+s+ 1 2i+ 1

f(p) +H(p)k+s−2ig(p)−G(p)2i

= [(k+s)/2]

i=0

k+s+ 1 2i+ 1

f(p) +H(p)k+s−2if(p) +H(p)24g(p)G(p)i. (4.11)

Proof. Since f =g∗G∗H−1, withH1=h1

1 ∗ ··· ∗h−s1, we have

f(p)=g(p) +G(p)−H(p). (4.12)

For brevity, we put

fk= f

pk, gk=g

pk, Gk=G

pk, H=H(p). (4.13)

By Rutkowski’s theorem,

fk=C fk−1+D fk−2 (k > s), (4.14)

where

C=g1+G1= f1+H, D= −g1G1. (4.15)

The characteristic polynomial of this recurrence isr2CrD, whose two roots areg1 andG1. Let∆=g1−G1.

Ifg1=G1, then∆=0, and the general solution of this recurrence is of the form

fk+s=Ag1k+s+BGk1+s (k >0). (4.16)

Using the two initial values

f1+s=Ag11+s+BG1+1 s, f2+s=Ag12+s+BG2+1 s, (4.17)

we get

A=−f1+sG1+ f2+s g1+s

1 ∆

, B=−f2+s+g1f1+s G1+s

1 ∆

. (4.18)

Thus,

fk+s=A

C+∆

2 k+s

+B

C−∆ 2

k+s

(15)

and so

2k+sf k+s=A

k+s

i=0

k+s i

Ck+s−ii+B k+s

i=0

k+s i

Ck+s−i()i

=(A+B) [(k+s)/2]

i=0

k+s 2i

Ck+s−2i2i

+ (A−B)

[(k+s−1)/2]

i=0

k+s 2i+ 1

Ck+s−2i−12i+1

=(A+B) [(k+s)/2]

i=0

k+s 2i

Ck+s−2i2i

+

A+B−2

Bg1+AG1 C

[(k+s−1)/2]

i=0

k+s 2i+ 1

Ck+s−2i2i

=(A+B) [(k+s)/2]

i=0

k+s+ 1 2i+ 1

Ck+s−2i2i

2Bg1+AG1

[(k+s−1)/2]

i=0

k+s 2i+ 1

Ck+s−2i−1∆2i.

(4.20)

Ifg1=G1, then∆=0. Without loss of generality, we may assume thatg1=G1:=r=0, for otherwise the desired result is trivial. The general solution of our recurrence now takes the shape

fk+s=Ark+s+ (k+s)Brk+s (k >0). (4.21)

Using the initial conditions

f1+s=Ar1+s+ (1 +s)Br1+s, f2+s=Ar2+s+ (2 +s)Br2+s, (4.22)

we get

A=(2 +s)r f1+s−(1 +s)f2+s

r2+s , B=

f2+s−r f1+s

r2+s , r=

C

2. (4.23) Therefore,

2k+sf k+s=

A+ (k+s)BCk+s, (4.24)

which agrees with (4.20) under the limit∆0, and the first identity is established. To establish the second identity, we proceed to use the combinatorial identity alluded to above. Since

2k+sfpk+s=(A+B)

[(k+s)/2]

i=0

k+s+ 1 2i+ 1

Ck+s−2i2i

2Bg1+AG1Sk+s−1(p),

(16)

we have

fpk+s=(A+B) [(k+s)/2]

i=0

k+s+ 1 2i+ 1

C 2

k+s−2iC

2 2

+D i

−Bg1+AG1Sk+s−1(p) 2k+s−1

=(A+B) [(k+s)/2]

i=0

k+s+ 1 2i+ 1

C 2

k+s−2i i

j=0 i j C 2

2i−2j

Dj

−Bg1+AG1Sk+s−1(p) 2k+s−1

=(A+B) [(k+s)/2]

j=0

Ck+s−2jDj

1 2k+s−2j

[(k+s)/2]

i=j

k+s+ 1

2i+ 1

i j

−Bg1+AG1Sk+s−1(p) 2k+s−1

=(A+B) [(k+s)/2]

j=0

k+s−j j

Ck+s−2jDjBg1+AG1Sk+s−1(p) 2k+s−1 ,

(4.26)

where the last equality follows from the identity of Riordan [17, Problem 18(c), page

87].

The results ofTheorem 4.1reduce to the identities (4.1) and (4.2) whens=0, because thenA+B=1 andBg(p) +AG(p)=H(p)=0. It remains to establish inverse forms of the two identities ofTheorem 4.1.

Theorem4.2. Lets∈Nand f =g∗G∗h−1

1 ∗ ··· ∗h−s1Ꮿ(2,s). For each primepand

each integerk >0,

Sk+s(p)= 2 k+s

A+B

k−1

i=0

Bg(p) +AG(p) A+B

i

fpk+s−i+

2Bg(p) +AG(p) A+B

k

Ss,

(k+s+ 1)f(p) +H(p)k+s= [(k+s)/2]

i=0

k+s+ 1 2i

d2iSk+s−2i(p)

×f(p) +H(p)24g(p)G(p)i,

f(p) +H(p)k+s

= 1 A+B

[(k+s)/2]

i=0

k+s i

k+s i−1

×

fpk+s−2i+Bg(p) +AG(p)Sk+s−2i−1(p) 2k+s−2i−1

g(p)G(p)i, (4.27)

(17)

Proof. The first identity, forSk+s(p), comes immediately from solving the first-order

non-homogeneous recurrence (4.8) inTheorem 4.1, where we definegs:=fs:=Ss(p)/2s. The

second identity, for (k+s+ 1)(f(p) +H(p))k+s, follows from the inverse relation, see, for

example, [6, page 160],

ak=

[k/2]

i=0

k+ 1 2i+ 1

bk−2ici⇐⇒(k+ 1)bk=

[k/2]

i=0

k+ 1 2i

d2iak−2ici, (4.28)

applied to (4.11) ofTheorem 4.1. The third identity, for (f(p) +H(p))k+s, follows from

the inverse relation, see, for example, [6, page 159],

ak=

[k/2]

i=0 (1)i

k−i

i

bk−2ici⇐⇒bk=

[k/2]

i=0

k i

k i−1

ak−2ici, (4.29)

applied to (4.9) ofTheorem 4.1.

We end this section by remarking that it seems unlikely for functions inᏯ(r,s) with r >2 to have similar binomial-type identities.

5. Kesava Menon norm

Forf ᏹ, its Kesava Menon normN f is an arithmetic function defined by (see [16,20])

N f(n) :=(f∗λ f)n2, (5.1)

where λ is the well-known Liouville’s function,λ(n)=(1)Ω(n),Ω(n) being the total number of prime factors ofncounted with multiplicity. Observe thatN f ᏹandλ∈

which implies (see [23]) thatλ(f∗g)=λ f∗λgwhen f,g∈ᏹ. For nonnegative integer m, themth power (Kesava Menon) norm of f ᏹis inductively defined by

N0f =f, N1f =N f, Nmf =NNm−1f. (5.2)

It is shown in [20, Theorem 3.3, page 160] that

f Ꮿ(2, 0)=⇒N f∈Ꮿ(2, 0), (5.3)

and in [16, Theorem 3, page 214] that for nonnegative integerm,

f1,f2∈Ꮿ(2, 0)=⇒Nmf1f2=Nmf1Nmf2. (5.4)

(18)

Proof. Let f =g1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1. By the distributivity of completely

multi-plicative functions, we get

f∗λ f =g1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1

∗λg1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1

=g1∗λg1∗ ··· ∗gr∗λgr

∗h−1

1 ∗λh−11

∗ ··· ∗h−1

s ∗λh−s1

=g1(u∗λ)∗ ··· ∗gr(u∗λ)

∗h−1

1 ∗λh−11

∗ ··· ∗h−1

s ∗λh−s1

,

(5.5)

whereu∈Ꮿis the unit function,u(n)=1 (n∈N). Using

(u∗λ)(n)=   

1 ifnis a perfect square,

0 otherwise, (5.6)

and forh∈Ꮿ,pprime,

h−1∗λh−1pk=         

1 ifk=0, −h(p)2 ifk=2,

0 otherwise,

(5.7)

we have for each primepandk∈N∪ {0}that

N fpk=(f ∗λ f)p2k =

(2k)

g1(u∗λ)pi1···g

r(u∗λ)pirh−11∗λh−11

pj1···h−s 1 ∗λh−s1

pjs

= (k)

g1g1pi1···g

rgrpirh1h1−1pj1···hshs−1pjs,

(5.8)

where(l)denotes the sum taken over all (r+s)-tuples of nonnegative integers (i1,. . .,ir,

j1,. . .,js) such thati1+···+is+j1+···+ js=l. SinceN f ᏹand gigi,hjhj∈Ꮿ, it

follows thatN f Ꮿ(r,s).

The gist ofTheorem 5.1is that

f =g1∗ ··· ∗gr∗h−11∗ ··· ∗h−s1

=⇒N f =g1g1∗ ··· ∗grgr∗h1h1−1∗ ··· ∗hshs−1.

(5.9)

Theorem 5.1remains valid whenrand/orsis 0 for we can always, if needed, convolute byIorI−1.

Immediate from these remarks is the following corollary.

Corollary5.2. Letm,r,s∈N∪ {0}. Then the following hold. (i) f =g1∗ ··· ∗gr∗h−11∗ ··· ∗hs−1Ꮿ(r,s)⇒Nmf =(g1)2

m

∗ ··· ∗(gr)2m∗

((h1)2m

)1∗ ··· ∗((h

s)2

m

)1, where(g

i)m=gi···gi(mtimes).

(19)

The Kesava Menon norm of f ᏹis closely related to its (ordinary) square (f)2as seen from the following two identities of Sivaramakrishnan [20]. If f =g1∗g2∈Ꮿ(2, 0), then

f(n)2=

d|n

N f n

d

θ(d)g1g2(d), (5.10)

d|n

λ(d)f(d)2f n

d 2

=

d|n

λ(d)N f(d)N f n

d

, (5.11)

whereθ(n)=2ω(n),ω(n) being the number of distinct prime factors ofn. We next show that similar identities hold for functions inᏯ(2, 1).

Theorem5.3. Let f =g1∗g2∗h−1(2, 1)and letN f be its Kesava Menon norm.Then there existsG∈such that

g1∗g2f =N f∗G∗g1g2,

g1∗g2f∗λg1∗g2f =(N f ∗λN f)(G∗λG)∗g1g2(u∗λ). (5.12)

Further,Gis defined on prime powers byG(pe)=f1(p2e) (eN), andu(n)=1 (nN).

Proof. Define ¯f =f ∗λ f ᏹ. Observe that

¯ f(n)=

  

N f(√n) ifnis a perfect square,

0 otherwise, (5.13)

and that

fn2=f¯λ f1n2=

i|n2 ¯ f(i)λ f−1

n2 i

=

j|n

N f(j)f−1 n2

j2

. (5.14)

DefineG∈ᏹbyG(1)=1,G(pe)= f1(p2e) (pprime,eN), and extend it by

mul-tiplicativity to all positive integers. Thus, f(n2)=(N f G)(n). On the other hand, by Theorem 3.2, whens=1, we have

fn2=

d|n

g1∗g2fn d

µg1g2(d). (5.15)

Thus (g1∗g2)f∗(µg1g2)=N f∗G, and the first identity follows by noting that asg1g2∈ Ꮿ, then (µg1g2)1=g1g2.

To prove the second identity, using the first identity and the distributivity ofλ∈Ꮿ, we have

λg1∗g2f =λN f∗G∗g1g2=λN f∗λG∗λg1g2. (5.16)

Thus,

g1∗g2f∗λg1∗g2f =(N f∗λN f)(G∗λG)∗g1g2∗λg1g2, (5.17)

(20)

Theorem 5.3yields the following immediate consequences.

Corollary5.4. If f =g1∗g2∗h−1(2, 1),N f is its Kesava Menon norm, andG as defined inTheorem 5.3, then

f(n)g1∗g2(n)=

i jk=n

N f(i)G(j)g1g2(k),

d|n

g1∗g2fn d

λg1∗g2f(d)=

i jk=n

(N f∗λN f)(i)(G∗λG)(j)g1g2(u∗λ)(k).

(5.18)

Note that for f =g1∗g2∈Ꮿ(2, 0), if we interpretG∈ᏹby

G(1)=1, G(p)=g1g2(p), Gpe=0 for primepand integere2, (5.19)

thenG∗(g1g2)=θg1g2 and (G∗λG)(g1g2)(u∗λ)=I, where θ(n)=2ω(n),I is the convolution identity, and so the identities inCorollary 5.4reduce to (5.10) and (5.11), respectively.

Added note. RegardingTheorem 5.1, it has been pointed out by one of the referees that N f for rational arithmetic functionsf of order (r,s) has already been given in P. Haukka-nen’s review on [22].

Acknowledgment

This work was partially supported by the University of the Thai Chamber of Commerce.

References

[1] T. M. Apostol,Introduction to Analytic Number Theory, Undergraduate Texts in Mathematics, Springer, New York, 1976.

[2] T. C. Brown, L. C. Hsu, J. Wang, and P. J.-S. Shiue,On a certain kind of generalized number-theoretical M¨obius function, Math. Sci.25(2000), no. 2, 72–77.

[3] T. B. Carroll,A characterization of completely multiplicative arithmetic functions, Amer. Math. Monthly81(1974), no. 9, 993–995.

[4] T. B. Carroll and A. A. Gioia,On a subgroup of the group of multiplicative arithmetic functions, J. Austral. Math. Soc. Ser. A20(1975), no. 3, 348–358.

[5] E. D. Cashwell and C. J. Everett,The ring of number-theoretic functions, Pacific J. Math.9(1959), no. 4, 975–985.

[6] P. Haukkanen,Binomial formulas for specially multiplicative functions, Math. Student64(1995), no. 1–4, 155–161.

[7] ,Some characterizations of totients, Int. J. Math. Math. Sci.19(1996), no. 2, 209–217. [8] , On the real powers of completely multiplicative arithmetical functions, Nieuw Arch.

Wiskd. (4)15(1997), no. 1-2, 73–77.

[9] ,Rational arithmetical functions of order(2, 1)with respect to regular convolutions, Port. Math.56(1999), no. 3, 329–343.

[10] ,Some characterizations of specially multiplicative functions, Int. J. Math. Math. Sci.2003

(21)

[11] V. Laohakosol, N. Pabhapote, and N. Wechwiriyakul,Logarithmic operators and characteriza-tions of completely multiplicative funccharacteriza-tions, Southeast Asian Bull. Math.25(2001), no. 2, 273–281.

[12] ,Characterizing completely multiplicative functions by generalized M¨obius functions, Int. J. Math. Math. Sci.29(2002), no. 11, 633–639.

[13] P. J. McCarthy,Introduction to Arithmetical Functions, Universitext, Springer, New York, 1986. [14] D. Rearick,Operators on algebras of arithmetic functions, Duke Math. J.35(1968), no. 4, 761–

766.

[15] ,The trigonometry of numbers, Duke Math. J.35(1968), no. 4, 767–776.

[16] D. Redmond and R. Sivaramakrishnan,Some properties of specially multiplicative functions, J. Number Theory13(1981), no. 2, 210–227.

[17] J. Riordan,Combinatorial Identities, John Wiley & Sons, New York, 1968.

[18] J. Rutkowski,On recurrence characterization of rational arithmetic functions, Funct. Approx. Comment. Math.9(1980), 45–47.

[19] H. N. Shapiro,Introduction to the Theory of Numbers, Pure and Applied Mathematics, John Wiley & Sons, New York, 1983.

[20] R. Sivaramakrishnan,On a class of multiplicative arithmetic functions, J. reine angew. Math.280

(1976), 157–162.

[21] ,Classical Theory of Arithmetic Functions, Monographs and Textbooks in Pure and Ap-plied Mathematics, vol. 126, Marcel Dekker, New York, 1989.

[22] S. Thajoddin and S. Vangipuram,A note on Jordan’s totient function, Indian J. Pure Appl. Math.

19(1988), no. 12, 1156–1161.

[23] R. Vaidyanathaswamy,The theory of multiplicative arithmetic functions, Trans. Amer. Math. Soc.

33(1931), no. 2, 579–662.

Vichian Laohakosol: Department of Mathematics, Faculty of Science, Kasetsart University, Bangkok 10900, Thailand