Find the smallest whole number that when divided by and gives remainders of and respectively.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let the integer be n . Then the question is as follows:
x = 5 a + 1
x = 7 b + 2
x = 9 c + 3
x = 1 1 d + 4
Multiplying these equations by 2 so that the remainders would also count by 2's, just as the divisors are:
2 x = 5 ( 2 a ) + 2
2 x = 7 ( 2 b ) + 4
2 x = 9 ( 2 c ) + 6
2 x = 1 1 ( 2 d ) + 8
Now add 3 to each equation so that the value of n would be divisible by all the known divisors in the problem:
2 x + 3 = 5 ( 2 a ) + 5 = 5 ( 2 a + 1 )
2 x + 3 = 7 ( 2 b ) + 7 = 7 ( 2 b + 1 )
2 x + 3 = 9 ( 2 c ) + 9 = 9 ( 2 c + 1 )
2 x + 3 = 1 1 ( 2 d ) + 1 1 = 1 1 ( 2 d + 1 )
This means that 2 x + 3 is the LCM of 5 , 7 , 9 , 1 1 , which is 3 4 6 5
So 2 x + 3 = 3 4 6 5 and x = 1 7 3 1