Prime Number Checker
prime_number_checkerCompute deterministic primality below 3.3 × 10^24 using the 13 prime Miller–Rabin bases through 41, plus complete factorization through 10^12 or a smallest factor through 10000.
Example tool call
This call uses example arguments supplied in the tool’s input schema.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"integer": "97"
},
"name": "prime_number_checker"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| integer | Yes | Nonnegative decimal digits, 0 <= n < 3300000000000000000000000 (3.3 × 10^24), at most 25 digits. Full composite factorization through 10^12; otherwise smallest prime factor search through 10000 only. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||