find the least number which when divided by 31 and 9 leaves a remainder of 3 in each case .
"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 ( 31 , 9 ) + 3 = 282 . answer : b"
add(3, lcm(31, 9))