Algebraic Method for Solving System of Linear Congruences | Zendy

Polemer M. Cuarto | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Algebraic Method for Solving System of Linear Congruences

Author(s) -

Polemer M. Cuarto

Publication year - 2017

Publication title -

recoletos multidisciplinary research journal

Language(s) - English

Resource type - Journals

eISSN - 2423-1398

pISSN - 2408-3755

DOI - 10.32871/rmrj1503.01.07

Subject(s) - congruence relation , algebraic number , mathematics , algebra over a field , algebraic analysis , computer science , pure mathematics , mathematical analysis , differential algebraic equation , ordinary differential equation , differential equation

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research