find the least number which when divided by 5 , 67 , and 8 leaves a remainder 3 , but when divided by 9 leaves no remainder
explanation : l . c . m . of 5,6 , 7,8 = 840 . required number is of the form 840 k + 3 least value of k for which ( 840 k + 3 ) is divisible by 9 is k = 2 . required number = ( 840 x 2 + 3 ) = 1683 answer is a
add(multiply(lcm(lcm(lcm(5, multiply(const_2, const_3)), add(const_3, const_4)), 8), const_2), 3)