Find the least no. which when divided by 2,3,4,5,6 leaves remainder of 1 in each case but when divided by 7 leaves no remainder .
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.
If the number leaves a remainder of 1 when divided by 2 , 3 , 4 , 5 a n d 6 then it leaves a remainder of 1 when divided by L C M ( 2 , 3 , 4 , 5 , 6 ) = 6 0 .So the number must be of the form 6 0 x + 1 and is divisible by 7 .The least number satisfying these conditions is 6 0 ( 5 ) + 1 = 3 0 0 + 1 = 3 0 1 = 7 × 4 3