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) 366 B) 236 C) 367 D) 365 E) 386
Explanation:   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.   Answer: 386
<result>E</result>
Find the least number which when divided by 35 and 11 leaves a remainder of 1 in each case.