Euler's Totient Function φ(n)
n (positive integer ≤ 1,000,000)
φ(n) = count of integers from 1 to n that are coprime to n.
Euler's totient function φ(n) counts how many integers from 1 to n are coprime to n (share no common factor other than 1). It is fundamental in number theory and RSA encryption.
References
🔒
100% 無料
登録不要
✓
正確
検証済み数式
⚡
即座
即座に結果を表示
📱
モバイル対応
全デバイス対応