Multiplicative Persistence
multiplicative_persistenceMultiplicative persistence: how many times the decimal digits of n must be multiplied to reach a single digit, and that digit. 39 takes 3 steps and ends at 4. 10 ends at 0 in 1 step. 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/multiplicative-persistence
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": "multiplicative_persistence"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |