the least number which when divided by 2 , 3 , 5 and 6 leaves a remainder 3 , but when divided by 9 leaves no remainder , is
"explanation : l . c . m of 2 , 3 , 5 , 6 = 30 therefore required number is of the form 30 k + 3 . least value of k for which ( 30 k + 3 ) is divisible by 9 is k = 2 therefore required number = ( 30 x 2 + 3 ) = 63 . answer : b"
multiply(lcm(lcm(lcm(2, 3), 5), 6), const_2)