PrimeOmega
PrimeOmega[n]
gives the number of prime factors counting multiplicities in n.
Details and Options
- Integer mathematical function, suitable for both symbolic and numerical manipulation.
- PrimeOmega gives the number of prime factors of an integer with multiplicity.
- For a number with a unit and primes, PrimeOmega[n] returns k1+⋯+km.
- With the setting GaussianIntegers->True, PrimeOmega gives the number of Gaussian prime factors.
- PrimeOmega[m+In] automatically works over Gaussian integers.
Examples
open allclose allBasic Examples (2)
Scope (8)
Numerical Evaluation (4)
PrimeOmega works over integers:
PrimeOmega threads over lists:
Symbolic Manipulation (4)
Options (1)
GaussianIntegers (1)
Compute PrimeOmega over integers:
Applications (6)
Basic Applications (2)
Table of the values of PrimeOmega for the integers up to 100:
Histogram of the values of PrimeOmega:
Number Theory (4)
Use PrimeOmega to test for a prime number:
Use PrimeOmega to compute LiouvilleLambda:
Plot the average over values of PrimeOmega for different ranges of integer arguments:
The Fourier statistics of the PrimeOmega sequence:
Properties & Relations (5)
Use FactorInteger to find the number of prime factors counting multiplicities:
PrimeOmega is a completely additive function:
PrimeOmega gives the exponent for a prime power:
PrimeOmega and PrimeNu are equivalent when the argument is square-free:
PrimeOmega is always greater than or equal to PrimeNu:
Possible Issues (1)
PrimeOmega is not defined at 0:
Neat Examples (2)
Text
Wolfram Research (2008), PrimeOmega, Wolfram Language function, https://reference.wolfram.com/language/ref/PrimeOmega.html.
CMS
Wolfram Language. 2008. "PrimeOmega." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/PrimeOmega.html.
APA
Wolfram Language. (2008). PrimeOmega. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/PrimeOmega.html