find the least number which when divided by 35 and 11 leaves a remainder of 1 in each case .
"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 : e"
add(1, lcm(35, 11))