eulerPhi
Calculate Euler's totient function φ(n) to find the count of positive integers up to n that are coprime with n. Use this tool for number theory problems and cryptography applications.
Instructions
计算欧拉函数φ(n)，即小于等于n且与n互质的正整数个数
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |