MathNumber theory

Euclid's algorithm

Results of Euclid's algorithm

Report a typo

Which values can we compute using extended Euclid's algorithm for arbitrary integers $a, b$ ?

Select one or more options from the list

\gcd(a, b)

A representation of

a

as a product of prime numbers

The greatest prime dividing

b

Coefficients

x, y

such that

\gcd(a, b) = ax + by

___

Create a free account to access the full topic