LCM !!

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 .


The answer is 301.

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.

2 solutions

If the number leaves a remainder of 1 1 when divided by 2 , 3 , 4 , 5 a n d 6 2,3,4,5\;and\;6 then it leaves a remainder of 1 when divided by L C M ( 2 , 3 , 4 , 5 , 6 ) = 60 LCM(2,3,4,5,6) = \boxed{60} .So the number must be of the form 60 x + 1 60x+1 and is divisible by 7 7 .The least number satisfying these conditions is 60 ( 5 ) + 1 = 300 + 1 = 301 = 7 × 43 60(5)+1=300+1=\boxed{301}=7\times43

Prakhar Dhumas
Jan 8, 2015

Well we can also do this by heat and trial method too, just have to look at some points: 1)The no. leaves no reminder when divided by seven so it is a multiple of 7.

2)It would be odd. since it leaves remainder of 1 when divided by 2

3)Since it leaves remainder of 1 when divided by 5 then the unit place of the no. is also 1.

4)by "3)"we can also conclude that the no.=n 3 * 7 = x 1 where n is any no. with unit place 3 and n is the resultant of product with unit place 1.

5)The n 3 would be prime.

By keeping all these 5 points in mind . I got the answer = 43*7=301

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...