An elementary algorithmic problem from an advanced standpoint
An optimal algorithm which finds all the solutions, over the nonnegative integers of an equation of the form ax1+bx2+cx3=m, a, b, c, m positive integers, is given. The algorithm is polynomial in the length of the input and is based on advanced concepts and methods. The algorithm is not based on Lenstra's integer programming algorithm.
Unable to display preview. Download preview PDF.
- [HW]G.H. Hardy, F.M. Wright, “An Introduction to the Theory of Numbers”. Oxford, Clarendon Press, 1962.Google Scholar
- [HN]H.S. Hall, S.R. Knight, “Higher Algebra”. Third edition, Macmillan, 1957.Google Scholar
- [K]A. Ya. Khintchine, “Continued Fractions”. Noordhoff, Groningen, 1963, or Univ. of Chicago Press, 1964.Google Scholar
- [Kn]D.E. Knuth, “The Art of Computer Programming”. Second edition, Addison-Wesley, 1981, Vol.2, Ch.4.Google Scholar
- [L]H.W. Lenstra, “Integer programming with a Fixed Number of Variables”, Math. of Oper. Res., Vol. 8, 1983, pp. 583–548.Google Scholar
- [S]E.S. Selmer, “On the Linear Diophantine Problem of Frobenius in Three Variables”, J. reine. angew. Math., Vol. 293–294, 1977, pp. 1–17.Google Scholar
- [Syl]J.J. Sylvester, “Mathematical Questions with their Solutions”, Educational Times, Vol. 41, 1884, p. 21.Google Scholar
- [YK]A.C. Yao, D.E. Knuth, “Analysis of the Substractive Algorithm for Greatest Common Divisors”, Stanford C-S-75-510 Report, September 1975.Google Scholar