Two Cubes Calendar

Number Theory Level pending

There is some interesting class of calendars which uses two cubes to make an integer for today date.

Since it is possible to make a number for any day of a month (from 01 to 31), the numerals on the edges have to be very specific. What is the lowest possible sum of all twelve numerals on these cubes plus 9?


The answer is 39.

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.

2 solutions

Michael Mendrin
Jul 19, 2018

It's done with two blocks with the numbers ( 0 , 1 , 2 , 3 , 4 , 5 ) (0,1,2,3,4,5) and ( 0 , 1 , 2 , 6 , 7 , 8 ) (0,1,2,6,7,8) , where 6 6 is used as a 9 9 . The total is 39 39 , not 48 48 .

Otherwise, how do you display ( 06 , 07 , 08 , 09 ) (06, 07, 08, 09) ?

The total number of edges is 12 12 so we need every numeral from 0 0 to 9 9 at least once. Moreover, it should be possible to make numbers 11 11 and 22 22 which requires at least one additional 1 1 and at least one additional 2 2 . However, we will not be able to make all of the dates from 01 01 to 09 09 because the another cube has only 1 1 edges. So, we need to use 6 6 as 9 9 and have 0 0 on the both cubes. Therefore, the necessary numbers are ( 0 , 1 , 2 , ? , ? , ? ) (0,1,2,?,?,?) and ( 0 , 1 , 2 , ? , ? , ? ) (0,1,2,?,?,?) where ? ? is a non-repeated element of the set ( 3 , 4 , 5 , 6 , 7 , 8 ) (3,4,5,6,7,8) . Therefore the minimal sum is

0 + 1 + 2 + 0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 = 39 0+1+2+0+1+2+3+4+5+6+7+8=39

With addition of 9 9 it is the answer 48 48

The highest possible sum is bigger by 3 3 when you consider to count 6 6 as 9 9

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...