extended_gcd
Compute the extended GCD of two integers to get Bézout coefficients and an optional modular inverse for solving Diophantine equations and modular arithmetic problems.
Instructions
Compute the extended GCD of two integers, returning Bezout coefficients and optionally the modular inverse.
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": {
"a": "<a>",
"b": "<b>"
},
"name": "extended_gcd"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | First integer | |
| b | Yes | Second integer |