Möbius

From specialfunctionswiki
Jump to: navigation, search

The Möbius function is the function $\mu$ defined by the formula $$\mu(n) = \left\{ \begin{array}{ll} 1 &; n \mathrm{\hspace{2pt}is\hspace{2pt}a\hspace{2pt}squarefree\hspace{2pt}positive\hspace{2pt}integer\hspace{2pt}with\hspace{2pt}even\hspace{2pt}number\hspace{2pt}of\hspace{2pt}prime\hspace{2pt}factors} \\ -1 &; n \mathrm{\hspace{2pt}is\hspace{2pt}a\hspace{2pt}squarefree\hspace{2pt}positive\hspace{2pt}integer\hspace{2pt}with\hspace{2pt}odd\hspace{2pt}number\hspace{2pt}of\hspace{2pt}prime\hspace{2pt}factors} \\ 0 &; n\mathrm{\hspace{2pt}has\hspace{2pt}a\hspace{2pt}square\hspace{2pt}divisor}. \end{array} \right.$$


Properties[edit]

Reciprocal of Riemann zeta as a sum of Möbius function for Re(z) greater than 1
Relationship between prime zeta, Möbius function, logarithm, and Riemann zeta

Videos[edit]

Möbius Function - Introduction (4 September 2007)
Möbius Function - Merten's function (4 September 2007)
Mobius Function Example (17 November 2012)
Number Theory 27: Mobius function is multiplicative (8 January 2015)
Möbius Inversion of $\zeta(s)$ (3 July 2016)

References[edit]

Number theory functions