Möbius Function

Definition (Möbius function)

The Möbius function μ\mu is defined as follows: μ(n)={1n=1(1)kn=p1pk with pi distinct primes0otherwise\mu(n)=\begin{cases} 1&n=1 \\ (-1)^{k}&n=p_{1}\dots p_{k}\text{ with }p_{i}\text{ distinct primes} \\ 0&\text{otherwise} \end{cases}

Theorem (1.19)

The summation of the Möbius Function over all dnd|n, where nNn\in\mathbb{N} is 00 except for n=1n=1 dnμ(d)={1n=10otherwise\sum_{d|n}\mu(d)=\begin{cases} 1&n=1 \\ 0&\text{otherwise} \end{cases}

Theorem (Möbius Inversion Formula)

If f,gf,g are arithmetical functions then f(n)=dng(d)    g(n)=dnμ(d)f(nd) f(n)=\sum_{d|n}g(d)\iff g(n)=\sum_{d|n}\mu(d)f\left( \frac{n}{d} \right)

Theorem (Euler’s Totient Function in Terms of Mobius Function)

Euler’s Totient Function can be redefined in terms of the Möbius Function ϕ(n)n=dnμ(d)d\frac{\phi(n)}{n}=\sum_{d|n}\frac{\mu(d)}{d}

Linked from