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

Susumu Morito, Harvey M. Salkin

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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
Volume13
Issue number4
DOIs
Publication statusPublished - 1980 May
Externally publishedYes

Fingerprint

Linear equations

ASJC Scopus subject areas

  • Information Systems

Cite this

Using the Blankinship algorithm to find the general solution of a linear diophantine equation. / Morito, Susumu; Salkin, Harvey M.

In: Acta Informatica, Vol. 13, No. 4, 05.1980, p. 379-382.

Research output: Contribution to journalArticle

Morito, Susumu ; Salkin, Harvey M. / Using the Blankinship algorithm to find the general solution of a linear diophantine equation. In: Acta Informatica. 1980 ; Vol. 13, No. 4. pp. 379-382.
@article{13e2ddd551ad4de38728703db830b4ad,
title = "Using the Blankinship algorithm to find the general solution of a linear diophantine equation",
abstract = "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.",
author = "Susumu Morito and Salkin, {Harvey M.}",
year = "1980",
month = "5",
doi = "10.1007/BF00288771",
language = "English",
volume = "13",
pages = "379--382",
journal = "Acta Informatica",
issn = "0001-5903",
publisher = "Springer New York",
number = "4",

}

TY - JOUR

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

AU - Morito, Susumu

AU - Salkin, Harvey M.

PY - 1980/5

Y1 - 1980/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0012912824&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0012912824&partnerID=8YFLogxK

U2 - 10.1007/BF00288771

DO - 10.1007/BF00288771

M3 - Article

AN - SCOPUS:0012912824

VL - 13

SP - 379

EP - 382

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

IS - 4

ER -