what is the smallest no . that should be added to 41381 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 , 4 + 1 + 3 + 8 + 1 = 17 , the next multiple of 9 is 18 . 1 must be added to 41381 to make it divisible by 9 a"
add(subtract(9, reminder(41381, 9)), const_2)