Integer Algorithms to Solver Diophantine Linear Equations and Systems
Abstract
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to Diophantine linear equations with unknowns and then to Diophantine linear systems. The proprieties of the general integer solution are determined (both for a Diophantine linear equation and for a Diophantine linear system). Seven original integer algorithms (two for Diophantine linear equations, and five for Diophantine linear systems) are exposed. The algorithms are strictly proved and an example for each of them is given. These algorithms can be easily implemented on the computer.
Cite
@article{arxiv.math/0010134,
title = {Integer Algorithms to Solver Diophantine Linear Equations and Systems},
author = {Florentin Smarandache},
journal= {arXiv preprint arXiv:math/0010134},
year = {2007}
}
Comments
57 pages. Partially included in author's M. Sc. Thesis, University of Craiova, Department of Mathematics and Computer Science, 1979. Partially published in Bullet. Univ. Brasov, Series C, Vol. XXIV, 37-39, 1982, under the title: "General Integer Solution Properties for Linear Equations"