Simultaneous Multiple Choice Linear Congruence Question 2

For which of the following 4-tuples of integers (a,b,c,d) do we have a solution to the system of simultaneous linear congruences: n \equiv a (\mod 2), n \equiv (b \mod 3), n \equiv (c \mod 4), n \equiv (d \mod 6)

(1,0,3,2)\\ (0,1,0,4)\\ (0,0,3,0)\\ (1,1,2,1)\\ (0,1,2,5)\\ (1,2,3,5)

The first thing to notice here is that we have three different mods however all three are not different as required for Chinese remainder theorem. So we do for first two mods 2 and 3 and check for the third one mod 6. We may also have to check the relation between mod 4 and mod 2

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Number Theory and tagged , . Bookmark the permalink.

Leave a comment