The Möbius function, denoted by μ(n), is a fundamental multiplicative function in number theory. Its value depends on whether the prime factorization of a positive integer contains repeated prime factors and on the number of distinct prime factors.
For n = 1, the Möbius function is defined as μ(1) = 1. If n is divisible by the square of a prime, then μ(n) = 0. Such an integer is called not square-free. If n is square-free and has k distinct prime factors, then μ(n) = (−1)^k.
For example, 30 = 2 × 3 × 5 is square-free and has three distinct prime factors, so μ(30) = (−1)³ = −1. On the other hand, 12 = 2² × 3 contains a repeated prime factor, so μ(12) = 0. The integer 10 = 2 × 5 has two distinct prime factors, so μ(10) = 1.
The Möbius function is multiplicative, meaning that μ(mn) = μ(m)μ(n) whenever gcd(m, n) = 1. One of its most important identities is that the sum of μ(d) over all positive divisors d of n equals 1 when n = 1 and 0 when n > 1. This identity forms the foundation of Möbius inversion and is also connected to the reciprocal of the Riemann zeta function.
Möbius Function
The Möbius function is a multiplicative arithmetic function that assigns values of −1, 0, or 1 to positive integers according to their prime factorization. It plays an important role in divisibility theory and Möbius inversion.
| Name | Expression | Description |
|---|---|---|
Definition | μ(n) = 1 if n = 1; μ(n) = 0 if p² | n for some prime p; otherwise μ(n) = (−1)^k | Defines the Möbius function according to the prime factorization of n. |
Möbius Divisor-Sum Identity | Σ_{d|n} μ(d) = 1 if n = 1, and 0 if n > 1 | The sum of the Möbius function over all positive divisors of n. |
Multiplicative Property | μ(mn) = μ(m)μ(n), when gcd(m, n) = 1 | The Möbius function is multiplicative. |
Explanation
Variables
N
A positive integer.
P
A prime number.
K
The number of distinct prime factors of a square-free integer.
D
A positive divisor of n.
Μ(n)
The Möbius function evaluated at n.
Example or application
A worked example has not yet been added.
Definition
The Möbius function μ(n) is defined by μ(1) = 1; μ(n) = 0 if n is divisible by the square of a prime; otherwise, μ(n) = (−1)^k, where k is the number of distinct prime factors of n.
Purpose
The purpose of the Möbius function is to encode information about the square-free structure and number of distinct prime factors of integers. It is also used to reverse divisor-sum relationships through Möbius inversion.
Importance
It is a fundamental multiplicative arithmetic function.
It distinguishes square-free integers from integers containing repeated prime factors.
It provides the central arithmetic identity behind Möbius inversion.
It is used in counting problems involving divisibility.
It is closely connected to Dirichlet convolution.
It plays an important role in analytic number theory and the study of prime numbers.
Key Concepts
| Name | Description |
|---|---|
Square-Free Integer | A positive integer that is not divisible by the square of any prime. |
Distinct Prime Factors | The different prime numbers appearing in the prime factorization of an integer, without counting repeated occurrences. |
Möbius Function | The arithmetic function μ(n), which takes values only from −1, 0, and 1. |
Multiplicativity | The property μ(mn) = μ(m)μ(n) whenever gcd(m, n) = 1. |
Möbius Sum Identity | The sum of μ(d) over all positive divisors d of n is zero for n > 1 and equals one for n = 1. |
Characteristics
The Möbius function is defined for every positive integer.
Its possible values are −1, 0, and 1.
μ(1) = 1.
The function is zero for every integer divisible by a prime square.
For square-free integers, its value depends on the parity of the number of distinct prime factors.
It is multiplicative but not completely multiplicative.
Its divisor-sum identity is essential to Möbius inversion.
Types
| Name | Description |
|---|---|
Value 1 | Occurs when n = 1 or when n is square-free and has an even number of distinct prime factors. |
Value −1 | Occurs when n is square-free and has an odd number of distinct prime factors. |
Value 0 | Occurs when n is divisible by the square of at least one prime. |
Components
| Name | Description |
|---|---|
Prime Factorization | The factorization used to determine the Möbius function's value. |
Square-Free Condition | Determines whether the function is zero. |
Number of Distinct Prime Factors | Determines the sign when the integer is square-free. |
Parity | The evenness or oddness of the number of distinct prime factors determines whether the nonzero value is 1 or −1. |
Properties
μ(1) = 1.
μ(n) belongs to the set {−1, 0, 1}.
If p² divides n for any prime p, then μ(n) = 0.
If n is square-free with k distinct prime factors, then μ(n) = (−1)^k.
The Möbius function is multiplicative.
For every n > 1, the sum of μ(d) over all positive divisors d of n equals zero.
μ(p) = −1 for every prime p.
μ(p^r) = 0 for every prime p and integer r ≥ 2.
The Dirichlet series associated with μ(n) is the reciprocal of the Riemann zeta function for real part of s greater than 1.
Examples
| Title | Problem | Solution | Answer |
|---|---|---|---|
Möbius Function of a Prime Number | Find μ(7). | The number 7 is prime and therefore square-free. It has one distinct prime factor, so μ(7) = (−1)¹. | μ(7) = −1. |
Möbius Function of a Square-Free Composite Number | Find μ(30). | The prime factorization is 30 = 2 × 3 × 5. It is square-free and has three distinct prime factors. Therefore, μ(30) = (−1)³. | μ(30) = −1. |
Möbius Function of a Non-Square-Free Number | Find μ(12). | The prime factorization is 12 = 2² × 3. Since it is divisible by the square of the prime 2, the Möbius function is zero. | μ(12) = 0. |
Möbius Divisor-Sum Identity | Verify that the sum of μ(d) over the divisors of 6 is zero. | The positive divisors of 6 are 1, 2, 3, and 6. Their Möbius values are 1, −1, −1, and 1. The sum is 1 − 1 − 1 + 1 = 0. | Σ_{d|6} μ(d) = 0. |
Applications
Möbius inversion in arithmetic functions.
Counting integers with specified divisibility properties.
Studying square-free integers.
Analyzing prime-number-related functions.
Working with Dirichlet convolution.
Developing identities in analytic number theory.
Investigating the reciprocal of the Riemann zeta function.
Prerequisites
Prime factorization
Divisibility
Square-free integers
Multiplicative arithmetic functions
Divisor notation
Learning Objectives
Define the Möbius function.
Calculate μ(n) using prime factorization.
Identify square-free and non-square-free integers.
Explain why the Möbius function takes only three possible values.
Apply the Möbius divisor-sum identity.
Explain the multiplicative property of the Möbius function.
Describe its connection to Möbius inversion.
Common Mistakes
Counting repeated prime factors when determining k.
Assigning a nonzero value to an integer divisible by a prime square.
Forgetting that μ(1) = 1.
Confusing square-free integers with perfect squares.
Assuming that the Möbius function is completely multiplicative.
Including only some divisors when applying the divisor-sum identity.
Practice Questions
Calculate μ(15), μ(20), and μ(30).
Find μ(1), μ(16), and μ(42).
Explain why μ(36) = 0.
Verify the Möbius divisor-sum identity for n = 10.
Prove that the Möbius function is multiplicative.
What is the difference between square-free and non-square-free integers?
Why is the Möbius function important in number theory?
Key Takeaway
The Möbius function encodes the square-free structure of integers through the values −1, 0, and 1. Its divisor-sum identity makes it one of the most important tools for reversing arithmetic sums and developing Möbius inversion.
Related Topics
Multiplicative Arithmetic Functions
Möbius Inversion Formula
Dirichlet Convolution
Prime Factorization
Square-Free Integers
Riemann Zeta Function
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory