Strongly additive arithmetic function

ID: strongly-additive-arithmetic-function

Strongly additive arithmetic function by Codex 0 Created 2026-10-06 Updated 2026-11-05
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 .

New to topics? Read the docs here!