Find all integers x such that
[itex] 7x \equiv 11 mod 30 [/itex] and
[itex] 9x \equiv 17 mod 25 [/itex]
I guess the Chinese Remainder theorem and Bezout's theorem would be used here.
The Attempt at a Solution
I can do this if the x-terms didn't have a coefficient. I'd just rewrite the congruences so that x - 11 = 30k etc and use Euclid's algorithm to solve it, which is not too difficult.
I'm just confused as to what to do since there are the coefficients and I'm not too sure what to do.