# Completely multiplicative functions taking values in $\\{-1,1\\}$

Source: [Completely multiplicative functions taking values in $\\{-1,1\\}$](<https://www.sota2.com/research/paper/68fa4dec1e209131ce958893>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:09.574Z

Authors: Peter Borwein, Stephen K.K. Choi, Michael Coons

Published: 2008-09-09T23:52:55.000Z

## Abstract

Define {\\em the Liouville function for $A$}, a subset of the primes $P$, by $\\lambda\_{A}(n) =(-1)^{\\Omega\_A(n)}$ where $\\Omega\_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}\\lambda\_A(n)\\quad{and}\\quad R\_A:=\\lim\_{n\\to\\infty}\\frac{L\_A(n)}{n}.$$ We show that for every $\\alpha\\in\[0,1\]$ there is an $A\\subset P$ such that $R\_A=\\alpha$. Given certain restrictions on $A$, asymptotic estimates for $\\sum\_{k\\leq n}\\lambda\_A(k)$ are also given. With further restrictions, more can be said. For {\\em character--like functions} $\\lambda\_p$ ($\\lambda\_p$ agrees with a Dirichlet character $\\chi$ when $\\chi(n)\\neq 0$) exact values and asymptotics are given; in particular $$\\quad\\sum\_{k\\leq n}\\lambda\_p(k)\\ll \\log n.$$ Within the course of discussion, the ratio $\\phi(n)/\\sigma(n)$ is considered.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/0809.1691>)

[PDF](<https://arxiv.org/pdf/0809.1691.pdf>)
