# Difference between revisions of "Multiplicative function"

m |
|||

Line 1: | Line 1: | ||

{{stub}} | {{stub}} | ||

− | A '''multiplicative function''' <math>f : S \to T</math> is a [[function]] which | + | A '''multiplicative function''' <math>f : S \to T</math> is a [[function]] which [[commute]]s with multiplication. That is, <math>S</math> and <math>T</math> must be [[set]]s with multiplication such that <math>f(x\cdot y) = f(x) \cdot f(y)</math> for all <math>x, y \in S</math>. |

Most frequently, one deals with multiplicative functions <math>f : \mathbb{Z}_{>0} \to \mathbb{C}</math>. These functions appear frequently in [[number theory]], especially in [[analytic number theory]]. In this case, one sometimes also defines ''weak multiplicative functions'': a function <math>f: \mathbb{Z}_{>0} \to \mathbb{C}</math> is weak multiplicative if and only if <math>f(mn) = f(m)f(n)</math> for all pairs of [[relatively prime]] [[integer]]s <math>(m, n)</math>. |

## Revision as of 15:30, 21 September 2006

*This article is a stub. Help us out by expanding it.*

A **multiplicative function** is a function which commutes with multiplication. That is, and must be sets with multiplication such that for all .

Most frequently, one deals with multiplicative functions . These functions appear frequently in number theory, especially in analytic number theory. In this case, one sometimes also defines *weak multiplicative functions*: a function is weak multiplicative if and only if for all pairs of relatively prime integers .