Liouville function
From Wikipedia, the free encyclopedia
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. (SIDN A008836).
λ 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.
[edit] Series
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.
[edit] Conjectures
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 for sufficiently big n ≥ n0 (this "conjecture" is occasionally (but incorrectly) attributed to Paul Turan). 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 Paul Turan.
[edit] References
- Polya, G., Verschiedene Bemerkungen zur Zahlentheorie. Jahresbericht der deutschen Math.-Vereinigung 28 (1919), 31-40.
- Haselgrove, C.B. A disproof of a conjecture of Polya. Mathematika 5 (1958), 141-145.
- Lehman, R., On Liouville's function. Math. Comp. 14 (1960), 311-320.
- M. Tanaka, A Numerical Investigation on Cumulative Sum of the Liouville Function. Tokyo Journal of Mathematics 3, 187-189, (1980).
- Eric W. Weisstein, Liouville Function at MathWorld.
- A.F. Lavrik, "Liouville function" SpringerLink Encyclopaedia of Mathematics (2001)