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.
KeywordsPrime Divisor Probabilistic Algorithm Arbitrary Positive Integer Euler Function Desire Confidence Level
Unable to display preview. Download preview PDF.