Summary
This paper shows that the Blankinship algorithm, originally proposed to find the greatest common divisor of several integers and a solution of the associated linear diophantine equation, can be used to find the general solution of the equation. This yields a more efficient method to find the general solution than the one proposed by Bond. The modification of Blankinship's algorithm to avoid generating vectors with huge component values is also proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blankinship, W.A.: A new version of the Euclidean algorithm. Amer. Math. Monthly 70, 742–745 (1963)
Bond, J.: Calculating the general solution of a linear diophantine equation. Amer. Math. Monthly 74, 955–957 (1967)
Bradley, G.: Algorithm and bound for the greatest common divisor of n integers, Comm. of ACM 13, 433–436 (1970)
Chase, W.: The indirect threat algorithm, Technical memorandum, Naval Electronics Laboratory Center, San Diego, California, November 1975
Morito, S., Salkin, H.M.: Finding the general solution of a linear diophantine equation, Technical memorandum No. 429, Department of Operations Research, Case Western Reserve University, Cleveland, Ohio, September 1977
Salkin, H.M.: Integer programming, p. 314, Reading, Mass: Addison-Wesley 1975
Weinstock, R.: Greatest common divisor of several integers and an associated linear diophantine equation, Amer. Math. Monthly 67, 664–667 (1960)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morito, S., Salkin, H.M. Using the Blankinship algorithm to find the general solution of a linear diophantine equation. Acta Informatica 13, 379–382 (1980). https://doi.org/10.1007/BF00288771
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288771