Solving System of Linear Congruences - Flow charts


Abstract views: 18 / PDF downloads: 24

Authors

  • K. Suvarna Department of Mathematics, D. K. Government College for Women (A), Nellore, Andhra Pradesh, India
  • P. V. Prasada Rao Department of Mathematics, University College, V.S. University, Kavali, Andhra Pradesh, India

Keywords:

linear congruences, greatest common divisor (GCD), Relatively prime, incongruent solutions, Euclidean ring, Euclidean algorithm, Division Algorithm, determinant, Augmented matrix, reduction of matrix, modular (mod)

Abstract

Euclidean algorithm and Division algorithm for solving the system of linear congruence and fixing the necessary and sufficient condition for the system of congruence relation to possess a solution is established for any number of variables other than the Chinese reminder theorem, that continued on the basis of Gauss elimination method/Gauss Seidel method have been explored in the paper titled simultaneous Diophantine equations and consistency. The approach has been given a algorithm in the present discussion.

Downloads

Published

27-03-2023

How to Cite

K. Suvarna, & P. V. Prasada Rao. (2023). Solving System of Linear Congruences - Flow charts. International Journal of Mathematics And Its Applications, 11(1), 125–130. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/1606

Issue

Vol. 11 No. 1 (2023)

Section

Research Article

License

Copyright (c) 2025 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.