On Some Methods for Solution of Linear Diophantine Equations
Abstract
The paper considers a linear Diophantine equation. A method (algorithm) for finding a general class of solutions of equation is proposed. The proposed algorithm is explained by examples of equations with two and three variables, trying to direct the reader to a general idea that describes the essence of the method used.
Keywords
References
- [1] M. Clausen, A. Fortenbacher, Efficient solution of linear diophantine equations, J. Sym. Comp., 8(1-2) (1989), 201–216.
- [2] E. Contejean, H. Contejean, An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations, Inf. Comp., 113(1) (1994), 143–172.
- [3] H. Esmaeili, How can we solve a linear Diophantine equation by the basis reduction algorithm, Int. J. Comp. Math., 82(10)(2005), 1227–1234.
- [4] V. Y. Nesterenko, Number Theory. ”Academy”, Moscow (in Russian), 2008.
- [5] D. Papp, B. Vizvari, Effective solution of linear Diophantine equation systems with an application in chemistry, J. Math. Chem., 39(1)(2006), 15–31.
- [6] A. Vigneron-Tenorio, Semigroup ideals and linear diophantine equations, Linear Algebra Appl., 295(1999), 133–144
