extended_gcd_bezout
Compute the extended Euclidean algorithm to find Bézout coefficients for integers a and b, optionally generating alternative representations.
Instructions
Extended GCD with Bézout coefficients and multiple representations. (Domain: arithmetic, Category: bezout_identity)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | ||
| b | Yes | ||
| find_alternatives | No |