Math 2.0

Number theory Proposition

Dirichlet convolution formula

Builds on Dirichlet convolution

Statement

Let ff and gg be arithmetic functions, and let nn be a positive integer. Then (f∗g)(n)=∑a,b≥1ab=nf(a) g(b),(f * g)(n) = \sum_{\substack{a, b \ge 1 \\ ab = n}} f(a) \, g(b), where the sum runs over the ordered pairs of positive integers (a,b)(a, b) with ab=nab = n, and ∗* is the Dirichlet convolution.

Remarks

The map d↦(d,n/d)d \mapsto (d, n/d) is a bijection from the divisors of nn to these pairs. This gives the formula. The symmetric form shows at once that f∗g=g∗ff * g = g * f. For example, (f∗g)(6)=f(1)g(6)+f(2)g(3)+f(3)g(2)+f(6)g(1)(f * g)(6) = f(1)g(6) + f(2)g(3) + f(3)g(2) + f(6)g(1).

Reading path

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

Further reading

  1. Web https://en.wikipedia.org/wiki/Dirichlet_convolution, Definition
About this page
Tag0SAR26CKPS
URIm2://0SAR26CKPS
Kindstatement, proposition
WritingW0 stub
MSC11A25
StatusThis copy of the site has no build data. Run m2 status 0SAR26CKPS.
UsesDirichlet convolution

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.