find the least number which when divided by 33 and 8 leaves a remainder of 2 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 ( 33 , 8 ) + 2 = 266 . answer : a"
add(2, lcm(33, 8))