Coin Ways
coin_waysThe number of non-negative integer solutions of ax + by = n. Order of summands does not matter. There are 2 ways to make 10 with 2 and 5, and 0 ways to make 3. a and b run from 1 to 10000, and n runs from 0 to 100000. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/coin-ways
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": {
"a": "<a>",
"b": "<b>",
"n": "<n>"
},
"name": "coin_ways"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | ||
| b | Yes | ||
| n | Yes |