Académique Documents
Professionnel Documents
Culture Documents
ax + by = c
(**)
x = x0 +
b
a
k, y = y 0
k for any integer k.
(a,b)
(a,b)
theorem
suggests how to compute the solution set
to a Diophantine equation ax +by = c. We illustrate
with an example of a problem of Eulers:
A farmer lays out the sum of 1770 crowns in purchasing horses
and oxen. He pays 31 crowns for each horse and 21 crowns for
each ox. How many horses and oxen did the farmer buy?
31 1 0
21 0 1 1
10 1 1 2
1 2 3
whence 1 = 231 + 3 21 and, by multiplying
through by 1770, we get 1770 = 3540 31+ 5310 21.
Therefore,x0 = 3540, y0 = 5310 is one solution.
The entire solution set must have the form
3540 + 21k 0
21k 3540
k 168.57...
5310 31k 0
5310 31k
171.29... k
positive solutions:
(x,y) = (9,71) = (30,40) = (51,9).
Thus, the farmer purchased either 9 horses and 71
oxen; 30 horses and 40 oxen; or 51 horses and 9
oxen.