paper

Completely multiplicative functions taking values in

arXiv:0809.1691

Abstract

Define {\em the Liouville function for }, a subset of the primes , by where is the number of prime factors of coming from counting multiplicity. For the traditional Liouville function, is the set of all primes. Denote We show that for every there is an such that . Given certain restrictions on , asymptotic estimates for are also given. With further restrictions, more can be said. For {\em character--like functions} ( agrees with a Dirichlet character when ) exact values and asymptotics are given; in particular Within the course of discussion, the ratio is considered.