- x = 3 (mod 9), x = 7 (mod 11), x = 9 (mod 15)
- x ≡ 7 (mod 9), x = 4 (mod 11), x = 13 (mod 15)
- x ≡ 2 (mod 9), x = 0 (mod 11), x = 8 (mod 15)
- x ≡ 4 (mod 9), x = 10 (mod 11), x = 10 (mod 15)
I am to see if any of these have a solution.
I was going to use Chinese Remainder Theorem, however the moduli aren't
pairwise relatively prime. I am not sure how else to check if it has a solution..
So now, For example, in 1:
9 divides x-3, 11 divides x-7, and 15 divides x-9
Does this mean I have to get a common x such that all three equations above satisfy?

New Topic/Question
Reply


MultiQuote






|