EulerPhi

Disponibile

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

Forme

EulerPhi[n]

Esempi verificatiEulerPhi[1] → 1 EulerPhi[10] → 4 EulerPhi[12] → 4 EulerPhi[7] → 6

Esegui su Qurak Cerca nella guida

Usata in

Powers of a primitive root - 2 passi

Argomenti

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 »

Correlate

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

Tutte le 6300 funzioni · Usa questo da un client MCP