Number of distinct prime factors
Builds on Prime numberArithmetic function
Definition
For a positive integer , is the number of distinct prime numbers that divide . So if with distinct primes and , then .
Remarks
For example, , and . The function is additive: for coprime and . Compare with the number of prime factors with multiplicity . We have , with equality exactly for squarefree .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Arithmetic function definition
- Divisibility definition
- Prime number definition
- Number of distinct prime factors definition
Where this leads
6 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Prime_omega_function, lead section
About this page
| Tag | 0YVVXT3A0B |
|---|---|
| URI | m2://0YVVXT3A0B |
| Aliases | little-omega-function |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11A25 |
| Defines | Number of distinct prime factors |
| Uses | Prime number, Arithmetic function |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.