PrimeNu

Verfügbar

Count distinct prime factors of an integer.

Formen

PrimeNu[n]

Verifizierte BeispielePrimeNu[1] → 0 PrimeNu[{12, 30}] → {2, 3}

Auf Qurak ausführen Referenz durchsuchen

Themen

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 »

Verwandt

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

Alle 6300 Funktionen · Dies aus einem MCP-Client verwenden