= Strongly additive arithmetic function
= Strongly additive function
{synonym}
An <additive arithmetic function> $f$ is strongly additive when $f(p^k)=f(p)$ for every <prime number> $p$ and every <positive integer> $k$. Its value therefore depends only on the distinct <prime factors>:
$$
f(n)=\sum_{p\mid n}f(p).
$$
The <prime omega function> is an example: $\omega(12)=\omega(6)=2$, because both <integers> have the same <prime factors>, namely $2$ and $3$. By contrast, the <total number of prime factors> is a <completely additive function> and counts multiplicity, giving $\Omega(12)=3$ and $\Omega(6)=2$. When $n=1$, there are no <prime factors>, so the empty <sum> gives $f(1)=0$.
Back to article page