(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1 - Majewski - Document - PDFSEARCH.IO

First Page	Meta Content
	(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1 Add to Reading List Document Date: 2011-09-25 12:54:28 Open Document File Size: 204,36 KB Share Result on Facebook Currency USD / / IndustryTerm gcd algorithm / extended gcd algorithm / / Person Alternatively Wn / Sean Byrnes / / Technology 34 LLL HNF ALGORITHM / Geometric algorithms / gcd algorithm / 1 2 JACOBI’S ALGORITHM / LLL algorithm / extended gcd algorithm / / SocialTag Lattice points Abstract algebra Euclidean algorithm Lenstra–Lenstra–Lovász lattice basis reduction algorithm Linear algebra Lattice Mathematics Algebra Computational number theory

(Joint work with G. Havas and B. Majewski – appeared in Experimental Mathematics) CENTRAL PROBLEM: If d1, . . . , dm, m ≥ 2, are nonzero integers, find integers x1, . . . , xm such that d = gcd(d1, . . . , dm) = x1d1Add to Reading List