Liouville function Created 2026-10-20 Updated 2026-11-05
The Liouville function iswhere is the total number of prime factors, counted with multiplicity. For example, , and . Multiplication adds prime exponents, so and for all positive integers . Thus it is a completely multiplicative function.
On square-free integers it agrees with the Möbius function. On other positive integers the distinction matters: , whereas . The Liouville function records the parity of all prime factors, rather than suppressing integers with repeated prime factors.
The Möbius function satisfies for and is zero for . ThereforeThe inverse local factor is . Consequently the inverse under Dirichlet convolution is the Liouville functionwhere counts prime factors with multiplicity. Both functions are multiplicative functions. At with , their convolution is , while its value at one is one. Multiplicativity then proves on every positive integer. Its Dirichlet series is for .