solving linear Diophantine equation
Here we an elementary but very comprehensible method for solving any linear Diophantine equation with two unknowns, i.e. for finding the general integer solution of an equation of the form
where are known integers and the unknowns.
The method is illustrated via a numerical example:
(1) |
We solve first (1) for (which has absolutely smaller coefficient than ):
(2) |
The in the numerator may be split so that division yields a polynomial with integer coefficients and that the remainder has absolutely smaller coefficients (now and ) than the dividend in (2) had:
Since and mean integers, also
must be an integer. Now solve this last equation for and split the new numerator similarly as above:
Since and mean integers, also
must be an integer. It is apparent that we can give any integer value for , which thus may be thought as a parameter determining the values of the other letters. We obtain successively
Accordingly, we may write the of (1) as
where
This method and the use of a parameter for expressing the solution were well known in the ancient world, especially in solving astronomical cycles as noted by Brahmagupta (598–668).
Title | solving linear Diophantine equation |
---|---|
Canonical name | SolvingLinearDiophantineEquation |
Date of creation | 2013-03-22 17:45:55 |
Last modified on | 2013-03-22 17:45:55 |
Owner | pahio (2872) |
Last modified by | pahio (2872) |
Numerical id | 6 |
Author | pahio (2872) |
Entry type | Topic |
Classification | msc 11D04 |
Related topic | LinearCongruence |