Difference between revisions of "Mobius function"
| Line 15: | Line 15: | ||
\end{align*} | \end{align*} | ||
more succinctly expressed as | more succinctly expressed as | ||
| − | <cmath>\phi(n) = \sum_{d|n} | + | <cmath>\phi(n) = \sum_{d|n} \mu(d) \frac{n}{d}.</cmath> |
Revision as of 18:32, 26 January 2011
The Mobius function is a multiplicative number theoretic function defined as follows:
![\[\mu(n) = \begin{cases} 0 & d^2 | n, \\ (-1)^k & n = p_1p_2\cdots{p_k} .\end{cases}\]](http://latex.artofproblemsolving.com/7/f/5/7f54ff985c575ba980c7a2a4e45a26dd2af7481f.png)
In addition, 
.
The Mobius function is useful for a variety of reasons.
First, it conveniently encodes Principle of Inclusion-Exclusion.
For example, to count the number of positive integers less than or equal to 
and relatively prime to , we have
\begin{align*}
\phi(n) = &n
&- \frac{n}{p_1} - \frac{n}{p_2} - \cdots - \frac{n}{p_k}
&+ \frac{n}{p_1p_2} + \frac{n}{p_1p_3} + \cdots + \frac{n}{p_{k-1}p_k}
&\vdots
&+ (-1)^k \frac{n}{p_1p_2\cdots p_k},
\end{align*}
more succinctly expressed as
![\[\phi(n) = \sum_{d|n} \mu(d) \frac{n}{d}.\]](http://latex.artofproblemsolving.com/c/6/3/c63119d59e6350c74a8f0874d361bd48137f8620.png)
