Definition:Completely Multiplicative Function
Jump to navigation
Jump to search
This page has been identified as a candidate for refactoring. In particular:
There are results in here which need extracting
Definition
Let $K$ be a field.
Let $f: K \to K$ be a function on $K$.
Then $f$ is described as completely multiplicative if and only if:
- $\forall m, n \in K: \map f {m n} = \map f m \map f n$
That is, a completely multiplicative function is one where the value of a product of two numbers equals the product of the value of each one individually.
Also see
There are results in here which need extracting
Until this has been finished, please leave {{refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
- It can easily be proved by induction that $\forall k \in \N: \paren {\map f n}^k = \map f {n^k}$ if and only if $f$ is completely multiplicative.
- Completely Multiplicative Function is Multiplicative, but not necessarily the other way about.
- Results about completely multiplicative functions can be found here.
Sources
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): Entry: arithmetic function