PrimeNu

Disponível

Count distinct prime factors of an integer.

Formas

PrimeNu[n]

Exemplos verificadosPrimeNu[1] → 0 PrimeNu[{12, 30}] → {2, 3}

Executar no Qurak Pesquisar a referência

Tópicos

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 »

Relacionados

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

Todas as 6300 funções · Usar isto de um cliente MCP