next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
LLLBases > gcdLLL

gcdLLL -- compute the gcd of integers, and small multipliers

Synopsis

Description

This function is provided by the package LLLBases.

The first n-1 columns of the matrix z form a basis of the kernel of the n integers of the list s, and the dot product of the last column of z and s is the gcd g.

The method used is described in the paper:

Havas, Majewski, Matthews, Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction, Experimental Mathematics 7:2 p. 125 (1998).

For an example,

i1 : s = apply(5,i->372*(random 1000000))

o1 = {368982708, 325446804, 225979956, 170344008, 274639416}

o1 : List
i2 : (g,z) = gcdLLL s

o2 = (372, | 12  11  14  1   10  |)
           | -1  -9  -13 -62 -12 |
           | -13 8   15  -1  1   |
           | -2  15  -27 37  8   |
           | -3  -20 1   50  -5  |

o2 : Sequence
i3 : matrix{s} * z

o3 = | 0 0 0 0 372 |

              1        5
o3 : Matrix ZZ  <--- ZZ

See also

Ways to use gcdLLL :