Abstract
We show that for arbitrary positive integers a 1, ..., a m , 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 (a 1, ..., a m ). 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostol, T.M.: Introduction to analytic number theory. Springer, Heidelberg (1976)
Cooperman, G., Feisel, S., von zur Gathen, J., Havas, G.: GCD of many integers. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 310–317. Springer, Heidelberg (1999)
von zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (2003)
Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford Univ. Press, Oxford (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von zur Gathen, J., Shparlinski, I.E. (2004). GCD of Random Linear Forms. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)