find the least number which when divided by 5 , 6,7 , 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(8, lcm(5, 6,7))