Abstract
We show that for arbitrary positive integers \(a_1, \ldots, a_m,\) with probability \(6/\pi^2 + o(1),\) the gcd of two linear combinations of these integers with rather small random integer coefficients coincides with \(\gcd(a_1, \ldots, a_m).\) This naturally leads to a probabilistic algorithm for computing the gcd of several integers, with probability \(6/\pi^2 + o(1),\) via just one gcd of two numbers with about the same size as the initial data (namely the above linear combinations). This algorithm can be repeated to achieve any desired confidence level.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
von zur Gathen, J., Shparlinski, I. GCD of Random Linear Combinations. Algorithmica 46, 137–148 (2006). https://doi.org/10.1007/s00453-006-0072-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-006-0072-1