Acta Informatica

, Volume 13, Issue 4, pp 379–382

Using the Blankinship algorithm to find the general solution of a linear diophantine equation

  • Susumu Morito
  • Harvey M. Salkin
Article

DOI: 10.1007/BF00288771

Cite this article as:
Morito, S. & Salkin, H.M. Acta Informatica (1980) 13: 379. doi:10.1007/BF00288771

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.

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • Susumu Morito
    • 1
  • Harvey M. Salkin
    • 1
  1. 1.Department of Operations ResearchCase Western Reserve UniversityClevelandUSA

Personalised recommendations