PrimeNu

Available

Count distinct prime factors of an integer.

Forms

PrimeNu[n]

Verified examplesPrimeNu[1] → 0 PrimeNu[{12, 30}] → {2, 3}

Run this on Qurak Search the reference

Topics

Additive Number Theory - Arithmetic Functions »
Analytic Number Theory - Distribution of Primes »
Multiplicative Number Theory - Prime Numbers »
New In70 Alphabetical Listing - P
New In70 Mathematics And Algorithms - New Number Theory Functions »
Number Theoretic Functions - Multiplicative Number Theory »

Related

FactorInteger PrimeOmega MoebiusMu GCD PrimeQ PrimePowerQ SquareFreeQ LiouvilleLambda MangoldtLambda PrimePi DivisorSigma Prime

All 6300 functions · Use this from an MCP client