Prime omega function

In number theory, the prime omega function, denoted as \(\omega(n)\), counts the number of distinct prime factors of a positive integer \(n\). For example: - \(\omega(12) = 2\) because the prime factorization of 12 is \(2^2 \times 3^1\), which has the distinct prime factors 2 and 3.