chinese_remainder
Solve simultaneous congruences with the generalized Chinese Remainder Theorem by supplying arrays of remainders and moduli to compute the solution.
Instructions
Solve simultaneous congruences using the generalised Chinese Remainder Theorem.
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": {
"remainders": "<remainders>",
"moduli": "<moduli>"
},
"name": "chinese_remainder"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| moduli | Yes | Array of moduli (positive integers) | |
| remainders | Yes | Array of remainders |