Mathematics Stack Exchange
Mathematics Stack Exchange

Questions tagged [dirichlet-convolution]

Use this tag for questions related to Dirichlet convolution in number theory

Dirichlet convolution is a type of convolution used in number theory for arithmetic functions. It forms a commutative ring under pointwise addition. It is defined as

\begin{equation*} (f\ast g)(n)=\sum_{d|n}f(d)g(\frac{n}{d}) \end{equation*}

where $f$ and $g$ are two arithmetic functions, and $d$ is a divisor of $n.$

Note that the multiplication of Dirichlet series is compatible with Dirichlet convolution.

135 questions
15
votes
3 answers

Is there a "nice" formula for $\sum_{d|n}\mu(d)\phi(d)$?

I'm trying to work through Ireland and Rosen's A Classical Introduction to Modern Number Theory as I've heard good things about it. This is Exercise 12 from Chapter 2. Here $\mu$ is the Moebius function, and $\phi$ the totient function. Find…
yunone
  • 22,783
14
votes
3 answers

Intuitive basis of Mobius inversion?

If we're given $f(n)= \sum_{d|n}g\left(\frac{n}{d}\right),n \in \mathbb{N},$ then Möbius inversion gives $$g(n)=\sum_{d|n}\mu \left( d\right) f \left( \frac{n}{d}\right).$$ Also, the generalised Möbius inversion formula states that the above is…
Meow
  • 6,623
7
votes
3 answers

Prove that $\sum_{d|n} \mu(d)\sigma(d) = (-1)^{k} \prod_{i=1}^{k} p_i$

In my notes: $$\sum_{d|n} \mu(d)\sigma(d) = (-1)^{k} \prod_{i=1}^{k} p_i$$ where $\mu(d)$ is the Möbius function and $\sigma(d)$ is the sum of all positive divisors of $d$. And I have no idea how they got the expression on the right hand side.…
roxrook
  • 12,399
6
votes
2 answers

Prove $\sum_{k\mid n}{\mu(k)d(k)}=(-1)^{\omega{(n)}}$

I have the following exercise. Show that for all natural numbers $n$, the following equality holds $$\sum_{d|n}{\mu{(d)}d(d)}=(-1)^{\omega{(n)}}$$ Here, $\mu$ is the Möbius function, $d$ counts the number of divisors of $n$, and $\omega$…
Lalaloopsy
  • 1,973
6
votes
1 answer

Fourier series: proving that the limit is zero

Let $f: \mathbb{R}\to \mathbb{C}$ be a $2\pi$ periodic function that satisfies: $f(t)=\frac{1}{t^{\frac{1}{3}}}$ for every $t\in (0,2\pi]$. Show that: $\;\lim_{n\to \infty} \int_0^{2\pi} |f(t)-(S_n(f))(t)|^2 dt=0$. We notice that $\;\lim_{n\to…
user652838
  • 762
6
votes
1 answer

Dirichlet series and Dirichlet convolution

Let $f$ and $g$ be an arithmetic functions, and let $f*g$ be the Dirichlet convolution of $f$ and $g$. As known from fundamental analytic number theory, the Dirichlet series generating function is: $DG(f;s)=\sum_{n=1}^\infty…
Or Shahar
  • 1,795
5
votes
0 answers

Is there a better convolution method for deriving $\sum_{p\le x}\frac{1}{p}$ when $p$ is an almost prime?

It's easy enough to derive an infinite sum for the logarithmic integral using the integral derived by Gauss through stepwise integration. For example, in my review of calculus I found: $$ li(x) - li(b) = \int^x_b \frac{dt}{\log t} =…
user56983
  • 196
5
votes
2 answers

Dirichlet Convolution of the Mobius Function with Itself

I am attempting to find a formula for $$(\mu * \mu)(n)$$ where * represents the Dirichlet Convolution operator. I know this can be expressed as $$\sum_{d|n} \mu(d)\mu(\frac{n}{d})$$ but I'd like the formula to not include any sums over divisors. I…
Atsina
  • 2,164
5
votes
1 answer

On a generalization for $\sum_{d|n}rad(d)\phi(\frac{n}{d})$ and related questions

Let $\phi(m)$ Euler's totient function and $rad(m)$ the multiplicative function defined by $rad(1)=1$ and, for integers $m>1$ by $rad(m)=\prod_{p\mid m}p$ the product of distinct primes dividing $m$ (it is obvious that it is a multiplicative…
user243301
4
votes
1 answer

Closed formula for a multiple Dirichlet convolution of the 1-function with the identity

For two multiplicative arithmetic functions $f,g$ the Dirichlet convolution is defined by $(f\ast g) (n)=\sum\limits_{ab=n}f(a)g(b)$. Convoluting any arithmetic function with the $1$-function ($1(n)=1$ for all $n\in\mathbb{N}$) gives a summation…
user149890
4
votes
0 answers

Relation between Dirichlet convolution and Bell series and convolution of functions and the Fourier transform?

We define the Dirichlet convolution of two arithmetic functions $a,b:\mathbb{N}\to\mathbb{C}$ to be $$ (a*b)(n)=\sum_{d\mid n}a(d)b\left(\frac{n}{d}\right). $$ Given a prime $p$, we define the Bell series of $a$ to…
user137301
  • 419
4
votes
1 answer

Why are Lambert generating functions important?

Let $(a_n)$ be a sequence of real numbers. The Lambert generating function of this sequence is defined as $$ L(x)=\sum_{n=1}^\infty a_n\frac{x^n}{1-x^n}. $$ I get why ordinary, exponential and Dirichlet generating functions are useful. But why are…
Mec
  • 5,621
4
votes
0 answers

Dirichlet Energy for Graphs, Derivation

I would like to prove this formulation of the Dirichlet Energy for Graph Neural Networks $$ \begin{aligned} E(\mathbf{X}) &=\frac{1}{d_{i}} \sum_{j \in \mathcal{N}(i)} w_{i j}\left\|\mathbf{x}_{i}-\mathbf{x}_{j}\right\|^{2}…
JimSi
  • 531
4
votes
1 answer

Estimate for $\sum_{n\leq x}2^{\Omega(n)}$

I need some help to find a mistake in my proof. I have to prove that $\sum_{n\leq x}2^{\Omega(n)}\sim cx\log^2x$ for $x\rightarrow+\infty$, where $\Omega(p_1^{k_1}\cdot\ldots\cdot p_j^{k_j})=k_1+\ldots+ k_j$. I defined $F(s)=\sum_{n\geq…
UnusualMathem
  • 307
4
votes
2 answers

Show that $\sigma(n) = \sum_{d|n} \phi(n) d(\frac{n}{d})$

This is a homework question and I am to show that $$\sigma(n) = \sum_{d|n} \phi(n) d\left(\frac{n}{d}\right)$$ where $\sigma(n) = \sum_{d|n}d$, $d(n) = \sum_{d|n} 1 $ and $\phi$ is the Euler Phi function. What I have. Well I know…
Tyler Hilton
  • 2,815
1
2 3
…
8 9