Depolignac
depolignacWhether odd n is never a prime plus a power of two, counting 2^0. 1 qualifies, because nothing smaller works. 3 is 2+1, so it does not. 127 is the next, and 905 is another. Even n is rejected. n runs from 1 to 100000. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/depolignac
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": "depolignac"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |