Math 2.0

Number theory Definition

Number of prime factors counted with multiplicity

Builds on Prime factorizationArithmetic function

Definition

Let nn be a positive integer with prime factorization n=p1e1⋯pkekn = p_1^{e_1} \cdots p_k^{e_k}, with distinct primes pip_i. Then Ω(n)=e1+e2+⋯+ek\Omega(n) = e_1 + e_2 + \dots + e_k. So Ω(n)\Omega(n) is the number of prime factors of nn, counted with multiplicity.

Remarks

For example, Ω(1)=0\Omega(1) = 0, Ω(12)=3\Omega(12) = 3 and Ω(360)=6\Omega(360) = 6. The function Ω\Omega is completely additive: Ω(mn)=Ω(m)+Ω(n)\Omega(mn) = \Omega(m) + \Omega(n) for all positive mm and nn. The Liouville function is λ(n)=(−1)Ω(n)\lambda(n) = (-1)^{\Omega(n)}.

Reading path

To understand this page from the ground up, read these 5 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. Prime factorization definition
  5. Number of prime factors counted with multiplicity definition

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Prime_omega_function, lead section
About this page
Tag08420828EY
URIm2://08420828EY
Aliasesbig-omega-function
Kinddefinition
WritingW0 stub
MSC11A25
DefinesNumber of prime factors counted with multiplicity
UsesPrime factorization, 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