What is the smallest integer which when divided by 3, 5, 7 & 11 leaves remainders of 2, 4, 6 & 1 respectively?
Options are:
A) 104 B) 1154 C) 419 D)None of the options given
Is there any systematic way to approach this question instead of just plain trial and error method?
Options are:
A) 104 B) 1154 C) 419 D)None of the options given
Is there any systematic way to approach this question instead of just plain trial and error method?
1 Answer
See below.
Explanation:
This problem is solved as an application of the so called Chinese Remainder Theorem (CRM)
Given
and calling
now calling
In our example
then
NOTE
With this method we can find a solution and eventually the smallest. In this case