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.

Ancestors (6)

  1. Integer sequences
  2. Numbers
  3. Arithmetic
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version