Multiplicative function: Difference between revisions
(Created page with '==Definition== Let <math>f</math> be a function from the set of natural numbers to a commutative unital ring <math>R</math>. We say that <math>f</math> is '''multiplicat...') |
No edit summary |
||
Line 1: | Line 1: | ||
==Definition== | ==Definition== | ||
Let <math>f</math> be a function from the set of [[natural number]]s to a [[commutative unital ring]] <math>R</math>. We say that <math>f</math> is '''multiplicative''' if | Let <math>f</math> be an [[arithmetic function]]: in other words, <math>f</math> is a function from the set of [[natural number]]s to a [[commutative unital ring]] <math>R</math>. We say that <math>f</math> is '''multiplicative''' if it satisfies the following two conditions: | ||
<math>f(mn) = f(m)f(n)</math>. | * <math>f(1) = 1</math>. | ||
* <math>f(mn) = f(m)f(n)</math> for all pairs of relatively prime numbers <math>m,n \in \mathbb{N}</math>. | |||
==Relation with other properties== | ==Relation with other properties== | ||
Line 9: | Line 10: | ||
===Stronger properties=== | ===Stronger properties=== | ||
* [[Weaker than:: | * [[Weaker than::Completely multiplicative function]] | ||
===Incomparable properties=== | |||
* [[Divisibility-preserving function]] |
Revision as of 01:53, 29 April 2009
Definition
Let be an arithmetic function: in other words, is a function from the set of natural numbers to a commutative unital ring . We say that is multiplicative if it satisfies the following two conditions:
- .
- for all pairs of relatively prime numbers .