Research Reports from the Department of Operations
Document Type
Report
Publication Date
1-1-1977
Abstract
This paper shows that the Blankenship 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 Blankenship's algorithm to avoid generating vectors with huge component values is also proposed.
Keywords
Operations research, Algorithms, Diophantine equations
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 431
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Morito, Susumu and Salkin, Harvey M., "Using the Blankenship Algorithm to Find the General Solution of a Linear Diophantine Equation" (1977). Research Reports from the Department of Operations. 632.
https://commons.case.edu/wsom-ops-reports/632