EulerPhi

Disponible

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

Formas

EulerPhi[n]

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

Ejecutar en Qurak Buscar en la referencia

Usada en

Powers of a primitive root - 2 pasos

Temas

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 »

Relacionadas

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

Las 6300 funciones · Usar esto desde un cliente MCP