Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Extended Euclid’s Algorithm The extended Euclid’s algorithm can be used to express gcd(a, b) as an integer linear combination of a and b, i.e., we can use it to find integers x and y such that ax + by = gcd(a, b). Le
Add to Reading List
Document Date: 2006-11-11 11:30:09
Open Document
File Size: 54,68 KB
Share Result on Facebook
IndustryTerm
integer solution /
/
Person
Gilles Cazelais /
/
Product
Pentax K-x Digital Camera /
/
ProgrammingLanguage
Python /
/
SocialTag
Modular arithmetic
Integer factorization algorithms
Extended Euclidean algorithm
Greatest common divisor
Mathematics
Number theory
Euclidean algorithm