On one way to solve linear equations over a euclidean ring

Linear equations, i.e. Equations of the first degree, as well as systems of such equations, receive much attention both in algebra and in number theory. Of greatest interest is the case of such equations with integer coefficients, and in this case they need to be solved in integers. Such equations with the specified conditions are called linear Diophantine equations. Euler also considered ways to solve linear Diophantine equations with two unknowns, and one of these methods was based on the use of the Euclid algorithm. Another method for solving such equations, based on continued fractions, was also used by Lagrange. Euler's method turned out to be more convenient and promising than the method of continued fractions. In this paper, we consider one new method for solving linear equations over a Euclidean ring, based on comparisons over suitable moduli. The previously known matrix method for solving such equations with an increasing number of unknowns is quite cumbersome due to the fact that it is associated with finding the inverses of unimodular integer matrices. Essential in our method of solving linear equations over a Euclidean ring is the use of the Euclidean algorithm and the linear GCD representation of elements in the Euclidean ring. The theorem proved in the work is applied to finding a solution to a linear equation in three unknowns over a ring of Gaussian integers, which, as is known, is a Euclidean ring. In conclusion, comments are made on possible ways of further development of the presented research.