Abstract
We develop an algorithm to generate the set of all solutions to a system of linear Diophantine equations with lower and upper bounds on the variables. The algorithm is based on the Euclid’s algorithm for computing the GCD of rational numbers. We make use of the ability to parametrise the set of all solutions to a linear Diophantine equation in two variables with a single parameter. The bounds on the variables are translated to bounds on the parameter. This is used progressively by reducing a n variable problem into a two variable problem. Computational experiments indicate that for a given number of variables the running times decreases with the increase in the number of equations in the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aardal, K., Hurkens, C.A.J., Lenstra, A.K.: Solving a system of Diophantine equation with lower and upper bounds on the variables. Mathematics of Operations Research 25, 427–442 (2000)
Beck, M., Zacks, S.: Refined upper bounds for the linear Diophantine problem of Frobenius. Advances in Applied Mathematics 32, 454–467 (2004)
Bond, J.: Calculating the general solution of a linear Diophantine equation. American Mathematical Monthly 74, 955–957 (1967)
Erdös, P., Graham, R.L.: On a linear Diophantine problem of Frobenius. Acta Arithmetica 21, 399–408 (1972)
Filgueiras, M., Tomás, A.P.: A fast method for finding the basis of non–negative solutions to a linear Diophantine equation. Journal of Symbolic Computation 19, 507–526 (1995)
Greenberg, H.: Solution to a linear Diophantine equation for nonnegative integers. Journal of Algorithms 9, 343–353 (1988)
Kertzner, S.: The linear Diophantine equation. American Mathematical Monthly 88, 200–203 (1981)
Morito, S., Salkin, H.M.: Using the Blankinship algorithm to find the general solution of a linear Diophantine equation. Acta Informatica 13, 379–382 (1980)
Rödseth, Ö.J.: On a linear Diophantine problem of Frobenius. Journal für die reine und angewandte Mathematik 301, 431–440 (1978)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)
Selmer, E.S., Beyer, Ö.: On a linear Diophantine problem of Frobenius in three variables. Journal für die reine und angewandte Mathematik 301, 161–170 (1978)
Vitek, Y.: Bounds for a linear Diophantine problem of Frobenius. Journal of the London Mathematical Society 10, 79–85 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramachandran, P. (2006). Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables. In: Hess, F., Pauli, S., Pohst, M. (eds) Algorithmic Number Theory. ANTS 2006. Lecture Notes in Computer Science, vol 4076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11792086_14
Download citation
DOI: https://doi.org/10.1007/11792086_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36075-9
Online ISBN: 978-3-540-36076-6
eBook Packages: Computer ScienceComputer Science (R0)