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.
Articles by others on the same topic
There are currently no matching articles.