Polydivisible
polydivisibleWhether the first k digits of n form a multiple of k, for every k. 0, 10, 12, 24, 102, and 3816547290 do. 11 and 103 do not. n runs from 0 to 999999999999999. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/polydivisible
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": "polydivisible"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |