completely multiplicative functions arising from simple operations完全乘法功能由简单的操作.pdfVIP

IJMMS 2004:9, 431–441 PII. S0161171204304163 © Hindawi Publishing Corp. COMPLETELY MULTIPLICATIVE FUNCTIONS ARISING FROM SIMPLE OPERATIONS VICHIAN LAOHAKOSOL and NITTIYA PABHAPOTE Received 13 April 2003 Given two multiplicative arithmetic functions, various conditions for their convolution, pow- ers, and logarithms to be completely multiplicative, based on values at the primes, are de- rived together with their applications. 2000 Mathematics Subject Classification: 11A25. 1. Introduction. By an arithmetic function we mean a complex-valued function whose domain is the set of positive integers N. We define the addition and convolu- tion of two arithmetic functions f and g , respectively, by (f +g)(n) = f (n) +g(n), (f ∗g)(n) = f (i)g(j). (1.1) ij =n It is well known (see, e.g., [2, 6, 15, 16]) that the set (, +, ∗) of all arithmetic functions is a unique factorization domain with the arithmetic function  I(n) = 1 if n = 1, (1.2)  0 otherwise, being its convolution identity. A nonzero arithmetic function f ∈ is called multiplicative if and only if f (mn) = f (m)f (n) whenever (m,n) = 1. (1.3) It is called completely multiplicative if this equality holds for all m,n ∈ N. Denote by the set of all multiplicative functions and by the set of all completely multiplicative functions. It is easy to see that the elements of are uniquely determined via their values at all