Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Number Theory > Prime Numbers >
Mathematica > Mathematics and Algorithms > Mathematical Functions > Number Theoretic Functions > Prime Numbers >

PrimeOmega

PrimeOmega[n]
gives the number of prime factors counting multiplicities Omega(n) in n.
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
  • For a number n=u p1k1CenterEllipsis pmkm with u a unit and pi primes, PrimeOmega[n] returns k1+CenterEllipsis+km.
  • PrimeOmega is a completely additive number theoretic function.
Omega(n) gives the number of prime factors counting multiplicities:
Plot the sequence:
Omega(n) gives the number of prime factors counting multiplicities:
In[1]:=
Click for copyable input
Out[1]=
 
Plot the sequence:
In[1]:=
Click for copyable input
Out[1]=
Evaluate for large arguments
PrimeOmega works over Gaussian integers:
PrimeOmega threads element-wise over lists:
TraditionalForm formatting:
Number of prime factors of Gaussian integers:
PrimeOmega is a completely additive function:
Number of prime factors can be found using FactorInteger:
New in 7
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team