a box measuring 30 inches long by 48 inches wide by 12 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 . 6 is the biggest number that could divide all three , 30 , 48 and 12 . thus side of cube must be 6 , and total number of cubes = 30 / 6 * 48 / 6 * 12 / 6 = 80 ans b ."
divide(multiply(multiply(30, 48), 12), volume_cube(divide(12, const_2)))