Hey guys, havin trouble with this question
Using Euclids Algorithm, to find integers x and y satisfying 1127 + 2568 = 1, find solutions of
1. 1127 = 127 (mod 3568)
Note: From using Euclids Algorithm, i got the equation 1 = 1431 1127 - 452 3568..
Any help much appreciated..
Modulo arithmetic is nice. Everything you want to work works. What we want to use here is that if then (This holds as ). For example, and so (multiplying by 3).