Monday, December 25, 2017

modular arithmetic - Is it possible to solve this congruency system?

I need help to determine if this congruency system can be solved and if it can be solved how do I do it:
{x2 (mod 3)x4 (mod 6)



I do know that from the system I obtain the following:



x2 (mod 3)x4 (mod 2)x4 (mod 3)




I do not know what to conclude from here. I think this system doesn't have solution, but if it is so how do I prove it.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...