chinese_remainder_theorem
Solves a system of simultaneous congruences using the Chinese Remainder Theorem; provide remainders and moduli to compute the unique solution modulo their product.
Instructions
Solve a system of simultaneous congruences using the 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_theorem"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| moduli | Yes | Moduli for each congruence | |
| remainders | Yes | Remainders for each congruence |