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

Susumu Morito, Harvey M. Salkin

Research output: Contribution to journalArticle

9 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)379-382
Number of pages4
JournalActa Informatica
Issue number4
Publication statusPublished - 1980 May
Externally publishedYes


ASJC Scopus subject areas

  • Information Systems

Cite this