statement theorem
Dirichlet convolution of multiplicative functions is multiplicative
Statement
Let and be multiplicative functions. Then their Dirichlet convolution is a multiplicative function.
Remarks
Let and be coprime. The proof uses that each divisor of is a unique product of a divisor of and a divisor of . With and , the theorem gives the multiplicativity of the divisor function, since . The Dirichlet inverse of a multiplicative function is also multiplicative.
Explanations
L1 human
Multiplicative functions stay multiplicative when you convolve them. So a new function built from known ones by divisor sums keeps the property, and you can compute it from prime powers.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 8 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Arithmetic function definition
- Divisibility definition
- Divisors of a natural number definition
- Greatest common divisor definition
- Dirichlet convolution definition
- Coprime integers definition
- Multiplicative function definition
- Dirichlet convolution of multiplicative functions is multiplicative statement
Sources
What links here
No node links to this node yet.