Three Squares
three_squaresWhether n is a sum of three integer squares, and one nonnegative witness x <= y <= z when it is. It is impossible exactly when n = 4^power * odd with odd congruent to 7 mod 8. 3 is 1, 1, 1. 7 is impossible. n runs from 0 to 1000000. Price: $0.001 USDC per successful call (x402, Solana). Same tool over HTTPS: POST https://scorptech.it.com/api/x402/v1/three-squares
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": "three_squares"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |