(mathematics) A function λ(n) on the positive integers such that λ(1) = 1, and for n≥ 2, λ(n) is -1 raised to the number of prime factors of n, with repeated factors counted the number of times they appear.
| Sci-Tech Dictionary: Liouville function |
(mathematics) A function λ(n) on the positive integers such that λ(1) = 1, and for n≥ 2, λ(n) is -1 raised to the number of prime factors of n, with repeated factors counted the number of times they appear.
| 5min Related Video: Liouville function |
| Wikipedia: Liouville function |
The Liouville function, denoted by λ(n) and named after Joseph Liouville, is an important function in number theory.
If n is a positive integer, then λ(n) is defined as:

where Ω(n) is the number of prime factors of n, counted with multiplicity (sequence A008836 in OEIS).
λ is completely multiplicative since Ω(n) is additive. We have Ω(1) = 0 and therefore λ(1) = 1. The Liouville function satisfies the identity:
if n is a perfect square, and:
otherwise.The Dirichlet series for the Liouville function gives the Riemann zeta function as

The Lambert series for the Liouville function is

where
is the Jacobi theta function.
The Pólya conjecture is a conjecture made by George Pólya in 1919, stating that:

for n > 1. This turned out to be false. The smallest counter-example is n = 906150257, found by Minoru Tanaka in 1980. It is not known as to whether L(n) changes sign infinitely often.
Defining the related sum

it was speculated for some time whether M(n) ≥ 0 for sufficiently big n ≥ n0 (this "conjecture" is occasionally (but incorrectly) attributed to Pál Turán). This was then disproved by Haselgrove in 1958 (see the reference below), he showed that M(n) takes negative values infinitely often. A confirmation of this positivity conjecture would have led to a proof of the Riemann hypothesis, as was shown by Pál Turán.
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
| Best of the Web: Liouville function |
Some good "Liouville function" pages on the web:
Math mathworld.wolfram.com |
| Pólya conjecture | |
| Bell series | |
| Completely multiplicative function |
| Is the inverse of a quadratic function not a function? Read answer... | |
| What is the function of the SUMIF function? Read answer... | |
| Does every function have an inverse that is a function? Read answer... |
| What is it's function? | |
| What are the functions of? | |
| What is are the functions of who? |
Copyrights:
![]() | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more | |
![]() | Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Liouville function". Read more |
Mentioned in