The Möbius function μ(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted μ(x).
For any positive integer n, define μ(n) as the sum of the primitive nth roots of unity. It has values in depending on the factorization of n into prime factors:
μ(n) = +1 if n is a square-free positive integer with an even number of prime factors.
μ(n) = −1 if n is a square-free positive integer with an odd number of prime factors.
μ(n) = 0 if n has a squared prime factor.
The Möbius function can alternatively be represented as
where δ is the Kronecker delta, λ(n) is the Liouville function, ω(n) is the number of distinct prime divisors of n, and Ω(n) is the number of prime factors of n, counted with multiplicity.
It can also be defined as the Dirichlet convolution inverse of the constant-1 function.
The values of μ(n) for the first 50 positive numbers are
The first 50 values of the function are plotted below:
Larger values can be checked in:
Wolframalpha
the b-file of OEIS
The Dirichlet series that generates the Möbius function is the (multiplicative) inverse of the Riemann zeta function; if s is a complex number with real part larger than 1 we have
This may be seen from its Euler product
Also:
where - Euler's constant.
The Lambert series for the Möbius function is:
which converges for < 1. For prime α ≥ 2, we also have
Gauss proved that for a prime number p the sum of its primitive roots is congruent to μ(p − 1) (mod p).
If Fq denotes the finite field of order q (where q is necessarily a prime power), then the number N of monic irreducible polynomials of degree n over Fq is given by:
The Möbius function also arises in the primon gas or free Riemann gas model of supersymmetry.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Présentation des méthodes de la mécanique analytique (équations de Lagrange et de Hamilton) et introduction aux notions de modes normaux et de stabilité.
In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius. A large generalization of this formula applies to summation over an arbitrary locally finite partially ordered set, with Möbius' classical formula applying to the set of the natural numbers ordered by divisibility: see incidence algebra.
In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by , after whom it is named.
In number theory, a multiplicative function is an arithmetic function f(n) of a positive integer n with the property that f(1) = 1 and whenever a and b are coprime. An arithmetic function f(n) is said to be completely multiplicative (or totally multiplicative) if f(1) = 1 and f(ab) = f(a)f(b) holds for all positive integers a and b, even when they are not coprime.
We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of Kátai's orthogonality cri ...
Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of 1E into an almost periodic and a pseudo-random part ...
We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...