Elementary Methods for Solving Diophantine Equations
Given the equation f(x1, x2, …, xn) = 0, we write it in the equivalent form
$$f_1(x_1, x_2, \ldots , x_n)f_2(x_1, x_2, \ldots , x_n) \cdots f_k(x_1, x_2, \ldots, x_n) = a,$$
KeywordsPositive Integer Nonnegative Integer Prime Divisor Integral Solution Integer Solution
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Birkhäuser Boston 2009