### 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 language | English |
---|---|

Pages (from-to) | 379-382 |

Number of pages | 4 |

Journal | Acta Informatica |

Volume | 13 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1980 May |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Information Systems

### Cite this

*Acta Informatica*,

*13*(4), 379-382. https://doi.org/10.1007/BF00288771

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

Research output: Contribution to journal › Article

*Acta Informatica*, vol. 13, no. 4, pp. 379-382. https://doi.org/10.1007/BF00288771

}

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 -