Here we represent 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 $a,\,b,\,m$ are known integers and $x,\,y$ the unknowns.

The method is illustrated via a numerical example:

We solve first (1) for $x$ (which has absolutely smaller coefficient than $y$):

The terms in the numerator may be split so that division yields a polynomial with integer coefficients and that the remainder has absolutely smaller coefficients (now $-12$ and $-4$) than the dividend in (2) had:

Since $x$ and $1\!+\!3y$ mean integers, also

must be an integer.  Now solve this last equation for $y$ and split the new numerator similarly as above:

Since $y$ and $-3\!+\!9z$ mean integers, also

must be an integer.  It is apparent that we can give any integer value for $t$, which thus may be thought as a parameter determining the values of the other letters.  We obtain successively

Accordingly, we may write the general solution of (1) as

where  $t=0,\,\pm 1,\,\pm 2,\,\ldots$

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).