EulerPhi

Tilgjengelig

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

Former

EulerPhi[n]

Verifiserte eksemplerEulerPhi[1] → 1 EulerPhi[10] → 4 EulerPhi[12] → 4 EulerPhi[7] → 6

Kjør dette på Qurak Søk i referansen

Brukt i

Powers of a primitive root - 2 steg

Emner

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 »

Relatert

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

Alle 6300 funksjoner · Bruk dette fra en MCP-klient