Find all x such that
x≡1(mod12)x≡4(mod21)x≡18(mod35)
Im not quite sure if this system of linear congruence is solvable. Since
gcd, \gcd (12,35)=1 and \gcd(21,35) = 7, and the CRT states that "If(m1, m2) = 1, then the system has its complete solution a single resident class (mod m1.....mr).
No comments:
Post a Comment