Completely multiplicative functions taking values in \-1,1\
Abstract
Define the Liouville function for A, a subset of the primes P, by λA(n) =(-1)A(n) where A(n) is the number of prime factors of n coming from A counting multiplicity. For the traditional Liouville function, A is the set of all primes. Denote LA(n):=Σk≤ nλA(n)and RA:=n∞LA(n)n. We show that for every α∈[0,1] there is an A⊂ P such that RA=α. Given certain restrictions on A, asymptotic estimates for Σk≤ nλA(k) are also given. With further restrictions, more can be said. For character--like functions λp (λp agrees with a Dirichlet character when (n)≠ 0) exact values and asymptotics are given; in particular Σk≤ nλp(k) n. Within the course of discussion, the ratio φ(n)/σ(n) is considered.
0