EulerPhi

Tersedia

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

Bentuk

EulerPhi[n]

Contoh terverifikasiEulerPhi[1] → 1 EulerPhi[10] → 4 EulerPhi[12] → 4 EulerPhi[7] → 6

Jalankan ini di Qurak Cari di referensi

Dipakai di

Powers of a primitive root - 2 langkah

Topik

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 »

Terkait

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

Semua 6300 fungsi · Pakai ini dari klien MCP