PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: Very high
Liouville function (Definition)

The Liouville function is defined by $ \lambda (1) = 1$ and $ \lambda (n) = (-1)^{k_1 + k_2 + \cdots + k_r}$, if the prime factorization of $ n > 1$ is $ n = p_1^{k_1} p_2^{k_2} \cdots p_r^{k_r}$ (where each $ p_i$ is positive). This function is completely multiplicative and satisfies the identity

\begin{displaymath} \sum_{d\vert n} \lambda (d) = \begin{cases} 1 &\text{if $n=m^2$\ for some integer $m$}\ 0 &\text{otherwise,} \end{cases}\end{displaymath}
where the sum runs over all positive divisors of $ n$.



"Liouville function" is owned by KimJ.
(view preamble | get metadata)

View style:

Keywords:  number theory

Attachments:
table of values of the Liouville function and its summatory function (Data Structure) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: divisors, sum, completely multiplicative, function, positive, prime factorization
There are 7 references to this entry.

This is version 7 of Liouville function, born on 2001-10-16, modified 2007-04-15.
Object id is 257, canonical name is LiouvilleFunction.
Accessed 2722 times total.

Classification:
AMS MSC11A25 (Number theory :: Elementary number theory :: Arithmetic functions; related numbers; inversion formulas)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)