EulerPhi

Disponível

Returns Euler's totient function (count of integers up to n that are coprime to n).

Formas

EulerPhi[n]

Exemplos verificadosEulerPhi[1] → 1 EulerPhi[10] → 4 EulerPhi[12] → 4 EulerPhi[7] → 6

Executar no Qurak Pesquisar a referência

Usada em

Powers of a primitive root - 2 passos

Tópicos

Additive Number Theory - Arithmetic Functions »
Analytic Number Theory - Arithmetic and Analytic Functions »
Cryptographic Number Theory - Cryptanalysis
Cryptography - Cryptographic Number Theory »
Mathematical Functions - Number Theoretic Functions »
Multiplicative Number Theory - Arithmetic Functions »

Relacionados

MultiplicativeOrder CarmichaelLambda PowerMod CoprimeQ FactorInteger GCD LCM Divisors PrimeQ SquareFreeQ PrimePowerQ MoebiusMu

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