Math 2.0

definition

Dirichlet convolution

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 1\mathbf{1}, (1∗1)(n)(\mathbf{1} * \mathbf{1})(n) is the number of divisors of nn.

Explanations

L1 human

The Dirichlet convolution combines two functions by a sum over the factorizations n=d⋅en = d \cdot e. It is the natural product for functions defined by sums over divisors.

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

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Divisors of a natural number definition
  4. Dirichlet convolution definition

What depends on this

4 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Dirichlet_convolution, Definition