Solve the congruence given 2x=1(mod 3), x=3(mod 5), x=2(mod 8)
Here is what I did.
Did I get that right?
But you need to be careful dividing by stuff in there man, that is a recipe for disaster. There are zero divisors and things without multiplicative inverses all over the place in the integers mod 8. In fact in any modulus that is not prime.
98 (mod 120) is what you are looking for.
I suggest looking into the chinese remainder theorem to solve these problems. http://www.mathhelpforum.com/math-he...r-theorem.html
I would repost but don't want to get in trouble for double posting this so I will leave it here, but in the future I will make a new thread. Thanks Gamma.
In the meantime can you point out where my logic went wrong? In the congruence.
If it is a different question it is not double posting. What people do not want to see is some guy asking a question and if no one answers it within an hour they repost again to get theirs to the top. Then no one answers it still and they repost again with a title HELP ME NOW!!!! URGENT OMG NEED YOUR HELP.
It is important to make each question in a different thread with a descriptive title so people browsing can quickly decide if they are going to know how to help you or not. No one will know that you have 3 other questions hidden inside some 17 post thread about gcds that was answered already in the first response.
I pointed out your error above.