OurBigBook About$ Donate
 Sign in Sign up

Liouville function (λ(n))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Arithmetic function
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
The Liouville function is
λ(n)=(−1)Ω(n),
(1)
where Ω(n) is the total number of prime factors, counted with multiplicity. For example, λ(1)=1, λ(12)=(−1)3=−1 and λ(4)=1. Multiplication adds prime exponents, so Ω(ab)=Ω(a)+Ω(b) and λ(ab)=λ(a)λ(b) for all positive integers a,b. 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: μ(4)=0, whereas λ(4)=1. The Liouville function records the parity of all prime factors, rather than suppressing integers with repeated prime factors.

 Ancestors (5)

  1. Arithmetic function
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (2)

  • Liouville function
  • Past exam of the analytic number theory and elliptic curves course of the University of Oxford / 2007 / A / 1 / iii / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook