About Extended GCD
Computes the Extended Euclidean Algorithm for integers a and b. Finds integers x and y (Bezout coefficients) such that: a*x + b*y = gcd(a, b) This is fundamental to many number theory algorithms including modular inverse, solving linear Diophantine equations, and cryptographic operations. Input handling: If either a or b is left blank, its value is taken from the Input field.
Input: text. Output: text.
Format reference: Extended GCD background and specification
Example
Use “Try example” to load this public sample and its settings, then run it.
Settings used in this example
| Parameter | Example value | Input and choices |
|---|---|---|
| Value a | "" | Text |
| Value b | "35" | Text |
Input
42
Result
gcd: 7 Bezout coefficients: x = 1 y = -1
Parameters
| Parameter | Default value | Input and choices |
|---|---|---|
| Value a | "" | Text |
| Value b | "" | Text |
Before interpreting the result
Confirm the number base, delimiter and bit width before comparing results. Signed integers, byte strings and floating-point numbers have different representations and precision limits.
How to use this page
- Paste your input or open a local file.
- Adjust tool options if needed, then choose Run tool.
- Copy the result or download the original output bytes.
Inputs and results are not added to the public catalogue or saved in the URL. Processing happens in your browser; HTTP Request and DNS over HTTPS send the requests you explicitly run. Files up to 128 MiB can be opened; decompression and image tools may have smaller processing limits. Large results have a shortened preview. Text and HTML downloads use UTF-8; binary downloads preserve output bytes. Pasted text follows browser newline handling; open a file when exact input bytes matter.