(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		Document Content
Date: 2011-09-25 12:54:28 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) = x1d1 Add to Reading List Source URL: www.numbertheory.org Download Document from Source Website File Size: 204,36 KB Share Document on Facebook