Diamond

A diamond expert cuts a huge cubical diamond into 960 identical diamond pieces in minimum number of n n cuts . If he wants to maximize the number of identical diamond pieces making same number of n n cuts to it. So the maximum number of such diamond pieces are:

1000 1228 1331 1225

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ratul Pan
Oct 30, 2015

960 can be factorised in the nearest 3 integers as 8x10x12.
Therefore the required no of cuts is (8-1)+(10-1)+(12-1)
=27 cuts .
This can be factorised as 9x9x9.
Therefore the number of pieces are (9+1)x(9+1)x(9+1)=1000

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...