Solutions to systems of linear congruences
This thesis presents solutions to two forms of systems of linear congruences. The first form consists of n linear congruences with n unknowns, and with a single modulo. This is solved through the use of matrices. However, this thesis covers only such forms having the determinants of the coefficient...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1993
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16122 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This thesis presents solutions to two forms of systems of linear congruences. The first form consists of n linear congruences with n unknowns, and with a single modulo. This is solved through the use of matrices. However, this thesis covers only such forms having the determinants of the coefficient matrix and the modulo relatively prime. The second form consists of one unknown and different moduli, and where the moduli are relatively prime. This is solved through the use of the Chinese Remainder Theorem.All theorems and definitions were consulted from books, with Kenneth H. Rosen's Elementary Number Theory and its Applications and Anthony J. Pettofrezzo and Daniel R. Byrkit's Elements of Number Theory providing the bulk of the concepts. The researchers combined the ideas of the two books to generate a comprehensive result of the study.Furthermore, the researchers provided a software package to solve for the solutions to systems of linear congruences. This was done through programming using Turbo Pascal 6.0. |
|---|