A unique dice

A positive integer is written on each face of a cube. Each vertex is then assigned the product of the three numbers written on the three faces intersecting at that vertex. The sum of all the numbers assigned to the vertices is equal to 2431.

Find the smallest of the sums of opposite faces.


Clarification: There are 3 pairs of opposite faces on a cube.


The answer is 11.

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

Let the pairs of opposite sides be ( a , c ) , ( b , d ) (a,c), (b,d) and ( e , f ) (e,f) , where a , b , c , d , e , f a,b,c,d,e,f are positive integers. Then the sum of the numbers assigned to the vertices is

a b e + a b f + a d e + a d f + c b e + c b f + c d e + c d f = ( a + c ) ( b + d ) ( e + f ) abe + abf + ade + adf + cbe + cbf + cde + cdf = (a + c)(b + d)(e + f) .

Now 2431 = 11 × 13 × 17 2431 = 11 \times 13 \times 17 , which is the only way of factoring 2431 2431 as the product of 3 integers each greater than 1 1 . We can then assign these factors to ( a + c ) , ( b + d ) (a + c), (b + d) and ( e + f ) (e + f) in any order, each of which is the sum of opposite sides. The desired least sum is thus 11 \boxed{11} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...