Math 2.0

Number theory Definition

Dirichlet convolution

Builds on Arithmetic functionDivisors of a natural number

Definition

Let ff and gg be arithmetic functions. Their Dirichlet convolution is the arithmetic function f∗gf * g given by (f∗g)(n)=∑d∣nf(d) g ⁣(nd)(f * g)(n) = \sum_{d \mid n} f(d) \, g\!\left(\frac{n}{d}\right) for each positive integer nn, where dd runs over the positive divisors of nn.

Remarks

The convolution is commutative and associative, and it distributes over addition. The identity element is ε\varepsilon, with ε(1)=1\varepsilon(1) = 1 and ε(n)=0\varepsilon(n) = 0 for n>1n > 1. An arithmetic function ff has an inverse for ∗* if and only if f(1)≠0f(1) \ne 0. For example, with the constant function 𝟏\mathbf{1}, (𝟏∗𝟏)(n)(\mathbf{1} * \mathbf{1})(n) is the number of divisors of nn.

Reading path

To understand this page from the ground up, read these 4 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. Dirichlet convolution definition

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Dirichlet_convolution, Definition
About this page
Tag0KH1N66QWW
URIm2://0KH1N66QWW
Aliasesdirichlet-product
Kinddefinition
WritingW1 stated
MSC11A25
DefinesDirichlet convolution
UsesArithmetic function, Divisors of a natural number

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

Used by