On the proximity of multiplicative functions to the function counting prime factors with multiplicity

Abstract: We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function

g

and an additive function

f

, we examine the size of the quantity

. We establish a lower bound for

E (O m e g a, g, x)

.

This page was built for publication: On the proximity of multiplicative functions to the function counting prime factors with multiplicity