PrimeNu

可用

Count distinct prime factors of an integer.

形式

PrimeNu[n]

验证过的示例PrimeNu[1] → 0 PrimeNu[{12, 30}] → {2, 3}

在 Qurak 上运行搜索参考

主题

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 »

相关

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

全部 6300 个函数 · 从 MCP 客户端使用