If we assume that gcd am 1 then the equation has in64257nitely many solutions We can 64257nd all solutions as follows 1 Using Euclids extended algorithm we 64257nd an integer such that ax 1 mod 1 Such an is called an inverse of modulo 2 Multiplyin ID: 70476
Download Pdf The PPT/PDF document "Solving Linear Congruence A equation of ..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
