what is the smallest no . that should be added to 236 to make it exactly divisible by 9 ?
"if a number is divisible by 9 , the sum of its digits must be a multiple of 9 . here , 2 + 3 + 6 = 11 , the next multiple of 9 is 18 . 7 must be added to 236 to make it divisible by 9 d"
add(subtract(9, reminder(236, 9)), const_2)