Completely multiplicative functions taking values in $\{-1,1\}$
| dc.creator | Borwein, Peter | |
| dc.creator | Choi, Stephen K. K. | |
| dc.creator | Coons, Michael | |
| dc.date | 2008-09-09 | |
| dc.date.accessioned | 2026-07-07T10:01:56Z | |
| dc.date.available | 2026-07-07T10:01:56Z | |
| dc.description | Define {\em 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 $$L_A(n):=\sum_{k\leq n}λ_A(n)\quad{and}\quad R_A:=\lim_{n\to\infty}\frac{L_A(n)}{n}.$$ We show that for every $α\in[0,1]$ there is an $A\subset P$ such that $R_A=α$. Given certain restrictions on $A$, asymptotic estimates for $\sum_{k\leq n}λ_A(k)$ are also given. With further restrictions, more can be said. For {\em character--like functions} $λ_p$ ($λ_p$ agrees with a Dirichlet character $χ$ when $χ(n)\neq 0$) exact values and asymptotics are given; in particular $$\quad\sum_{k\leq n}λ_p(k)\ll \log n.$$ Within the course of discussion, the ratio $ϕ(n)/σ(n)$ is considered. | |
| dc.identifier | https://arxiv.org/abs/0809.1691 | |
| dc.identifier | http://arxiv.org/abs/0809.1691 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168801 | |
| dc.subject | Number Theory | |
| dc.subject | 11N25; 11N37 | |
| dc.title | Completely multiplicative functions taking values in $\{-1,1\}$ | |
| dc.type | text |