euler_totient
Calculate Euler's totient function to count integers up to n that are coprime with n, useful for number theory and cryptography tasks.
Instructions
Compute Euler's totient function phi(n) - the count of integers up to n that are coprime with n.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"number": "<number>"
},
"name": "euler_totient"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| number | Yes | Positive integer to compute totient for |