An arithmetic function is additive when for coprime integers . Equivalently, . This concerns multiplication of integers, and differs from an additive function on a vector space.
An additive arithmetic function is strongly additive when for every prime number and every positive integer . Its value therefore depends only on the distinct prime factors:The prime omega function is an example: , because both integers have the same prime factors, namely and . By contrast, the total number of prime factors is a completely additive function and counts multiplicity, giving and . When , there are no prime factors, so the empty sum gives .
A completely additive arithmetic function satisfies for all positive , equivalently . The total number of prime factors is an example.
Articles by others on the same topic
There are currently no matching articles.