Cubes and dices

Question

A cuboid is divided into 192 identical cubelets . This is done by making minimum number of cuts possible.

 

Find the minimum number of cuts.

 

Is there something missing in this question?

 

If not then please suggest a method to solve .

Thank you:)

Comments

I didn't get the 'minimum number of cuts' logic. A fixed number of cuts will result in fixed number of pieces

---

Is the answer 15?

Answer 1

Minimum cubelets can be only achieved when we cut the cuboid from each dimensions( 3 dimension).

for minimum division we factorise 192 = 4*8*6

               (we need n-1 cuts to divide into n pieces)

therefore total cuts = 3 +7+5 = 15 answer.

Answer 2

The general Solution to such problem is to find three factors of x  ( a , b and c )

where a*b*c = x ( here it is 192) such that a,b, and c are closest possible to CubeRoot(x).

Then minimum number of Cuts would be (a-1) + (b-1) + (c-1).