Completely multiplicative function: Difference between revisions

Content deleted Content added
PV=nRT (talk | contribs)
No edit summary
Properties: mobius relation
Line 11:
==Properties==
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> ...
 
There are a variety of statements about a function which are equivalent to it being completely multiplicative. For example, if a function ''f'' multiplicative then is completely multiplicative if and only if the [[Dirichlet inverse]] is <math>\mu f</math> where <math>\mu</math> is the [[Mobius function]].<ref>{{cite book|last=Apostol|first=Tom|title=Introduction to Analytic Number Theory|year=1976|publisher=Springer|isbn=0-387-90163-9|pages=36}}</ref>
 
==See also==