Totient
totientEuler totient phi(n), the count of integers from 1 to n that are coprime to n. phi(1) is 1. n = 0 is rejected. n runs up to 10^12. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/totient
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": {
"n": "<n>"
},
"name": "totient"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |