Math 2.0

Number theory Definition

Number of distinct prime factors

Builds on Prime numberArithmetic function

Definition

For a positive integer nn, ω(n)\omega(n) is the number of distinct prime numbers that divide nn. So if n=p1e1⋯pkekn = p_1^{e_1} \cdots p_k^{e_k} with distinct primes pip_i and ei≥1e_i \ge 1, then ω(n)=k\omega(n) = k.

Remarks

For example, ω(1)=0\omega(1) = 0, ω(12)=2\omega(12) = 2 and ω(30)=3\omega(30) = 3. The function ω\omega is additive: ω(mn)=ω(m)+ω(n)\omega(mn) = \omega(m) + \omega(n) for coprime mm and nn. Compare with the number of prime factors with multiplicity Ω(n)\Omega(n). We have ω(n)≤Ω(n)\omega(n) \le \Omega(n), with equality exactly for squarefree nn.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Arithmetic function definition
  2. Divisibility definition
  3. Prime number definition
  4. Number of distinct prime factors definition

Where this leads

6 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Prime_omega_function, lead section
About this page
Tag0YVVXT3A0B
URIm2://0YVVXT3A0B
Aliaseslittle-omega-function
Kinddefinition
WritingW0 stub
MSC11A25
DefinesNumber of distinct prime factors
UsesPrime 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.

What links here

Used by