Extended Euclidean algorithm

Extended Euclidean algorithm

Uncommon

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that

Excerpt from the Wikipedia article “Extended Euclidean algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Extended Euclidean algorithm to your collection.

Play for free

Related cards