Indian J. pure appl. Math., 19 (12) : 1156-1161, December, 1988 A NOTE ON JORDAN'S TOTIENT FUNCTION S. THAJODDIN AND S. VANGIPURAM Department of Mathematics, Sri Venkateswara University Tirupati 517 502 (Received 21 September 1987) Jordan’s totient function J, is a genaralization of the Euler's totient function ¢. In this paper, the norm of this Jordan function and that of its conjugate have been obtained. Some interesting congruence properties of Jz have also been obtained. A generalization of the famous Euler’s totient function is the Jordan’s totient function defined by AG) =m 1p. pln We define the conjugate of this function as Jy (n) = nt 11 (1 + P™*) which is pia introduced as .generalization of Dedekind ¥— function by Suryanarayana*. Following the techniques employed by Menon’ and Sivaramakrishnan*, we have obtained in this paper the norms of the functions Js (n), Ju (n), 6 (7), 3 (™), Jy" (my 71 (n) and established some interesting relationship among them. We have also obtained some interesting congruence properties of Js (1). Definition 1 — The norm of a multiplicative function fis the arithmetic func- tion M (f') defined by M(f) (n) = Ef (n*/d) A (d) f(A) for all n. The norm defined d\n above has been proved to be a multiplicative function and further, if f, g are multi- Plicative then M (f* 8) = M(f)* M @). Theorem \— M (x) = M (Ui). Proor : We know that J, = » * Nj,, where » is Mobius function and Nj is an arithmetic function defined by Nx (n) = n*. M (Jk) = M (u) * M (Nx), since » and Ne are multiplicative. If p is any prime and a>0, M (i) (P*) Ep MOO MMOD ! (equation continued on p. 1162)JORDAN'S TOTIENT FUNCTION 137 = M (u) (1) M (Ne) (p*) + M (+) (p) M (Ne) (P8-*) +... + M (¥) (P*) M (Ny) (1) () M(u) (I) =1 M (Ns) (P*) = P* Mu) (P) = (-1) and M (Nj) (P23) = PHe-De M (u) (p*) = 0 for a>. Hence (1) reduces to M (Jy) (P*) = Pet — pre-e = Ju (P*) yo Thus if n= P, en then Mh) (hi pi )= naw (2) = My (p"") - Ju (Hei) it tt = Ju (1). Te = Mo New For any prime p, and « > 0, M (hu) (P%) = ap OYA MM) (Pld) P = M(x) (1) M (Na) (P2) + M (A>) (P) M (Ne) (P89) Ho FM (QA) (P*) M (Na) (1). M (XY (1) = 1. M (Nx) (P2) = P**, MQ") (P) = (~1). M (Ns) (P81) = PRe-nE, It can be easily seen that M (A) (P*) = O fora > 1.1138 $8. THAJODDIN AND S. VANGIPURAM Thus ‘M (i) (Pa) = Pm — xen = Ju (P*). Consequently, M (Ji) (n) = Jzx (n), thus we see that M (Jt) = M(t) = Jae. The following theorem is an immediate consequence. Theorem 2— M ($) = M$) = Jy, | whereg = J, | Theorem 3— (1) M (Jz*)(n) = 2 (”), 2) M (6-4) (n) = J? (ni). Proor : (1) we have J;? = Ny * u, 60 that u(ay )= Mum) © Mw) If P is any prime, and a > 0, then (2 \o = EM (uN,) (d) M (u) (P2/d), ap Since M(uM) (I) = 1 M(u)(p%) = 1 M (uNx) (P) = (—P*), MU) (PP) = 1 and M (uNx) (p*) = 0, for a > 1, it follows that M (4p) or) = 1 r= 209. Also Jx being a multiplicative function implies that J,’ is also a multiplicative function. Hence we obtain M(Jz" ) (n) = Jag (o. Simillarly, it can be easily deduced that M ($-?) (n) = Jy" (n).JORDAN'S TOTIENT FUNCTION 1159 Theorem 4— Js (n) is even if and only ifm > 3. Proor : Je (1) = 1 Je Q) = 2 = 1 (mod 2). Hence J, () is odd if n < 2. Let n > 2and let For any odd prime p, we have, Ji (p8) = pOm* (pk — 1). Now since p = 1 (mod 2), p* = 1 (mod 2). Hence Ji (n) = O (mod 2) if m has some odd prime factor. Also, if n has no ‘odd prime factor i.e., if n = 2°, Je 2%) = 20-8 (2* — 1) = O (mod 2). It follows therefore that for n > 2, Ji (n) is even. Theorem 5— J, (n) = O (mod 3) if and only if atleast one of the following three conditions is true : (1) 34m (2) Pi = | (mod 3) for some i (3) Pr = 2 (mod 3), for some i, with a, even where P, is some prime factor of n. Proor : Let W 5 = If 3* | n, then Js (n) = O (mod 3). If P; = 1 (mod 3) for some P; | n, then Pf = 1 (mod 3). Hence Je (201) = P&H (et — 1) = 0 (mod 3)1160 S. THAJODDIN AND S. VANGIPURAM If Py = 2 (mod 3) then Pf = 1 (mod 3), if kis even, so that J (7' ) =O(mod 3) in this case also. This proves the if part. Conversely, Ji (n) = O (mod 3) implies nh 4 (2;¢ ) = 0 (mod 3) (since J, (n) is multiplicative). Hence Je (Fr ) = 0 (mod 3) for some Py | n. This means 3| Pr or 3] (Pi— 1) or 3| (1+ P+... + PY), thus P; =20 (mod 3) = 3] nas 3 t Ju(3)or Pr = 1 (mod 3)or3|(1+ P+. + PHYS} Prand 3.4 (Pr — 1) then 3 | (1 + Pj) and3| (1 + P+ ... + P*) and this is possible only when K is even. Hence if3 t Pi, 3 4 (P — 1) then 3 | (Pr + 1) and Kis even. Hence the Theorem We ha ve the following corollary at once from the above two theorems. Corollary 6— If K > 1, Je(n) = © (mod 6) if atleast one of the following three conditions is true : Q) hn, (2) P) = 1 (mod 3), (3) P: = 2 (mod 3), k is even where P; is some prime factor of n. Theorem 7— Jy (n) = O (mod P) where P is any prime number if one of the following conditions is true. (1) PPI n (2) P: = | (mod P), where P; is some prime factor of n. ys Proor: Let m = I P.' be the canonical representation of n, then Je) = de (# ) If P* | n, then P = P; for some i and correspondingly « > 2.JORDAN'S TOTIENTS FUNCTION 1161 ‘Consequently u(e)= Pe oD ) = Py" (Pt — 1) = O (mod P) (a —1> 1). On the other hand, if P, = 1 (mod p), then Pi = 1 (mod p), so that Je (P,' ) == 0 (mod p). Hence Ji (n) = O (mod p) in either case, establishing the theorem. REFERENCES 1. P.K, Menon, J. Indian Math, Soe. 27, (1963) 57-65, R. Sivaramakrishnan, J, Reine Angew. Math, 280 (1976), 157-62. 3. D. Suryanarayana Math. Student 37 (1969), 81-86.