Find the least number which when divided by 35 and 11 leaves a remainder of 1 in each case. Choose the most appropriate option:
A) 384
B) 391
C) 388
D) 397
E) 386
The least number which when divided by different divisors leaving the same remainder in each case   = LCM(different divisors) + remainder left in each case.   Hence the required least number   = LCM(35, 11) + 1 = 386.   ANSW386R:386
<result>E</result>
Find the least number which when divided by 35 and 11 leaves a remainder of 1 in each case.