Moebius Mu(x) Function


Mu(x) = Moebius Mu(x) function.

See: Möbius Function -- From MathWorld
And: Wolfram Mathematica Documentation -- MoebiusMu

Here are some notes from my program XICalc - Extra Precision Integer Calculator http://www.oocities.org/hjsmithh/download.html#XICalc :

The Moebius or Möbius Mu(n) function is a number theoretic function defined by:

Mu(n) = 0 if n has one or more repeated prime factors
Mu(n) = 1 if n = 1
Mu(n) = (−1)^k if n is the product of k distinct primes
Mu(n) = Mu(−n), (Mu(n) is not normally defined for n < 1)
Mu(0) = 0

so Mu(n) = 0 iff n is not square-free. If n is square-free, the sign of Mu(n) tell whether there is even or odd number of distinct prime factors (+1 for even, −1 for odd). For n = 0, 1, 2, ... the first few values are 0, 1, −1, −1, 0, −1, 1, −1, 0, 0, 1, −1, 0, ... .

Return to Number Theory, Algorithms, and Real Functions
Return to Harry's Home Page


This page accessed times since Feb 17, 2006.
Page created by: hjsmithh@sbcglobal.net
Changes last made on Monday, 06-Aug-07 20:47:27 PDT