Math 2.0

Number theory Theorem

Dirichlet convolution of multiplicative functions is multiplicative

Builds on Dirichlet convolutionMultiplicative function

Statement

Let ff and gg be multiplicative functions. Then their Dirichlet convolution f∗gf * g is a multiplicative function.

Remarks

Let mm and nn be coprime. The proof uses that each divisor of mnmn is a unique product of a divisor of mm and a divisor of nn. With f=idk ⁣:n↦nkf = \mathrm{id}_k \colon n \mapsto n^k and g=𝟏g = \mathbf{1}, the theorem gives the multiplicativity of the divisor function, since σk=idk∗𝟏\sigma_k = \mathrm{id}_k * \mathbf{1}. The Dirichlet inverse of a multiplicative function is also multiplicative.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Divisors of a natural number definition
  4. Greatest common divisor definition
  5. Dirichlet convolution definition
  6. Coprime integers definition
  7. Multiplicative function definition
  8. Dirichlet convolution of multiplicative functions is multiplicative statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Dirichlet_convolution, Properties
About this page
Tag0PR88XHDMB
URIm2://0PR88XHDMB
Kindstatement, theorem
WritingW0 stub
MSC11A25
StatusThis copy of the site has no build data. Run m2 status 0PR88XHDMB.
UsesDirichlet convolution, Multiplicative function

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.