## You are here

Homenumber of distinct prime factors function

## Primary tabs

# number of distinct prime factors function

The number of distinct prime factors function $\omega(n)$ counts how many distinct prime factors $n$ has. Expressing $n$ as

$n=\prod_{{i=1}}^{k}{p_{i}}^{{a_{i}}},$ |

where the $p_{i}$ are distinct primes, there being $k$ of them, and the $a_{i}$ are positive integers (not necessarily distinct), then $\omega(n)=k$.

Obviously for a prime $p$ it follows that $\omega(p)=1$. When $n$ is a squarefree number, then $\Omega(n)=\omega(n)$, where $\Omega(n)$ is the number of (nondistinct) prime factors function. Otherwise, $\Omega(n)>\omega(n)$.

$\omega(n)$ is an additive function, and it can be used to define a multiplicative function like the Möbius function $\mu(n)=(-1)^{{\omega(n)}}$ (as long as $n$ is squarefree).

Related:

NumberOfNondistinctPrimeFactorsFunction, 2omeganLeTaunLe2Omegan

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

11A25*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella