a box measuring 36 inches long by 45 inches wide by 18 inches deep is to be filled entirely with identical cubes . no space is to be left unfilled . what is the smallest number of cubes that can accomplish this objective ?
"least number of cubes will be required when the cubes that could fit in are biggest . 9 is the biggest number that could divide all three , 36 , 45 and 18 . thus side of cube must be 9 , and total number of cubes = 36 / 9 * 45 / 9 * 18 / 9 = 40 ans d ."
divide(multiply(multiply(36, 45), 18), volume_cube(divide(18, const_2)))