Completely multiplicative function: Difference between revisions

Content deleted Content added
Corrected statement in 'logic notation'.
Line 27:
A completely multiplicative function is completely determined by its values at the prime numbers, a consequence of the [[fundamental theorem of arithmetic]]. Thus, if ''n'' is a product of powers of distinct primes, say ''n'' = ''p''<sup>''a''</sup> ''q''<sup>''b''</sup> ..., then ''f''(''n'') = ''f''(''p'')<sup>''a''</sup> ''f''(''q'')<sup>''b''</sup> ...
 
While the [[Dirichlet convolution]] of two multiplicative functions is multiplicative, the Dirichlet convolution of two completely multiplicative functions need not be completely multiplicative. Arithmetic functions which can be written as the Dirichlet convolution of two completely multiplicative functions are said to be quadratics or specially multiplicative multiplicative functions. They are rational arithmetic functions of order (2, 0) and obey the Busche-Ramanujan identity.
 
There are a variety of statements about a function which are equivalent to it being completely multiplicative. For example, if a function ''f'' is multiplicative then it is completely multiplicative if and only if its [[Dirichlet inverse]] is <math>\mu\cdot f</math> where <math>\mu</math> is the [[Möbius function]].<ref>Apostol, p. 36</ref>