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% 免费
无需注册
✓
准确
经过验证的公式
⚡
即时
即时结果
📱
移动友好
所有设备