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

Susumu Morito*, Harvey M. Salkin

*この研究の対応する著者

研究成果: Article査読

10 被引用数 (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.

本文言語English
ページ(範囲)379-382
ページ数4
ジャーナルActa Informatica
13
4
DOI
出版ステータスPublished - 1980 5月
外部発表はい

ASJC Scopus subject areas

  • 情報システム

フィンガープリント

「Using the Blankinship algorithm to find the general solution of a linear diophantine equation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル