A Matrix Method for Solving Linear Congruences
The author exploits the close analogy between the Euclidean algorithm for finding solutions of equations of the form \(ax - by = 1\), and that of applying elementary row operations to diagonalise a matrix. He thereby uses matrices to solve equations of the form \(ax + by = c\), simultaneous linear congruences as in the Chinese remainder theorem, and polynomial congruences. This method would be as suitable for helping students to be efficient in number theory as it would be for exhibiting an application of a standard process in linear algebra.
This page was built for publication: A Matrix Method for Solving Linear Congruences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3882514)