Calculation of extended gcd by normalization
Abstract
We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.