Modern Computer Algebra
GCD of many integers (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We show that for arbitrary positive integers a1, ..., am, with probability at least 6/π2 + o(1), the gcd of two linear combinations of these integers with rather small random integer coefficients coincides with gcd (a1, ..., am) This naturally leads to a probabilistic algorithm for computing the gcd of several integers, with probability at least 6/π2 + o(1), via just one gcd of two numbers with about the same size as the initial data (namely the above linear combinations) Naturally, this algorithm can be repeated to achieve any desired confidence level.