8000 GitHub - zwaltman/EuclidExtended: Extended Euclidean algorithm using coordinate matrices
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

zwaltman/EuclidExtended

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

EuclidExtended

Extended Euclidean algorithm using coordinate matrices

General version of the extended Euclidean algorithm that, given a list of integers, returns their greatest common divisor and its Bézout coefficients in terms of those integers.

The algorithm treats the integers as a vector space and uses the list of integers given as a linearly dependent spanning set for that space, using coordinate matrices to find coefficients such that the GCD can be expressed as a linear combination of those integers.

About

Extended Euclidean algorithm using coordinate matrices

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

0