Questions tagged [mobius-inversion]

For questions related to Möbius inversion and its applications.

In number theory, the Möbius inversion formula states that if $f$ and $g$ are arithmetic functions for which

$$g(n) = \sum_{d | n} f(d)$$

for every integer $n \ge 1$, then we can recover $f$ by

$$f(n) = \sum_{d | n} \mu(d) g\left(\frac{n}{d}\right)$$

where $\mu$ is the Möbius function. Written in terms of Dirichlet convolutions,

$$g = f \ast 1 \implies f = \mu \ast g$$

Reference: Möbius inversion formula.

198 questions
9
votes
2 answers

Understanding the proof of Möbius inversion formula

I am trying to understand one step in the proof of the Möbius inversion formula. The theorem is Let $f(n)$ and $g(n)$ be functions defined for every positive integer $n$ satisfying $$f(n) = \sum_{d|n}g(d)$$ Then, g satisfies…
urpi
  • 629
1
vote
0 answers

Can this be Mobius inverted?

Let $n\in N$. Let $\mu (n)$ be the classical Mobius function. In other words, it vanishes at square-full numbers, equals $+1$ if $n$ has an even number of distinct prime factors, and equals $-1$ is $n$ has an odd number of distinct prime…
anonymous
  • 538
1
vote
0 answers

Mobius inversion formula

How could I apply the Mobius inversion formulafor the equality $$ f(x)\ln(x)+f(x/2)\ln(x/2)+f(x/3)\ln(x/3)+\dots.=g(x) \tag1$$ to get $ f(x)$ from the value of $ g(x) $ ?? The sum inside $(1)$ is infinite and $\ln$ is the natural logarithm. For the…
Jose Garcia
  • 8,506
1
vote
1 answer

Sum on divisors is almost- ever zero

Take a positive integer $k$. Let $S \subseteq \mathbb{N}$ be the set of squarefree, and define $\displaystyle \rho_k = \mu*\omega^k$, where $ \displaystyle f* g = \sum_{d \mid n} f(d)g(n/d)$ . Show that $\rho_k(n)$ is 0 for almost all $n \in…
frame95
  • 768
0
votes
0 answers

Can lines intersect twice?

In inversion,we extend the euclidean plane by adding a single point at infinity which lies on all the lines.But doesn't that mean lines can intersect twice?I mean non parallel lines already intersect once but then again the point at infinity lies on…
a_i_r
  • 671
0
votes
1 answer

Calculating Moebius inversion of a poset with a minimum element.

If P is a poset that has a minimum element. We let x be an element of P that covers 1 single element y.Assume that y is not the minimum element, how do I prove that μ(minimum element,x) = 0? So μ(min, min) + μ(min , closest element that covers min)…