Completely multiplicative function
Definition
An arithmetic function is completely multiplicative if and for all positive integers and .
Remarks
Each completely multiplicative function is multiplicative. The converse fails: Euler's totient function has but . A completely multiplicative function is determined by its values at the primes. Examples are , the Liouville function and, for a fixed odd prime , the Legendre symbol .
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Arithmetic function definition
- Divisibility definition
- Greatest common divisor definition
- Coprime integers definition
- Multiplicative function definition
- Completely multiplicative function definition
Further reading
About this page
| Tag | 0GS27TKF1V |
|---|---|
| URI | m2://0GS27TKF1V |
| Aliases | totally-multiplicative-function |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11A25 |
| Defines | Completely multiplicative function |
| Uses | Arithmetic function, Multiplicative function |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.