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クライアントから使う