Abstract
The paper aimed to devise an alternative algorithm for solving system of linearcongruences. This algorithm is an extension of the algebraic algorithm which is an alternative method for finding solutions in linear congruences. The basic idea of the technique is to convert the given linear congruences into linear equations and solve them algebraically. The advantage of this algorithm is the simplicity of its computations and its applicability to systems of linear congruences where the conditions of the Chinese Remainder Theorem that the moduli m1…mn should be pairwise coprime is not satisfied. Some illustrative examples are given to show validity of this method for solving system of linear congruences.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
