EulerPhi

Available

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

Forms

EulerPhi[n]

Verified examplesEulerPhi[1] → 1 EulerPhi[10] → 4 EulerPhi[12] → 4 EulerPhi[7] → 6

Run this on Qurak Search the reference

Used in

Powers of a primitive root - 2 steps

Topics

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 »

Related

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

All 6300 functions · Use this from an MCP client