Two-cube calendar

A two-cube calendar is a desk calendar consisting of two cubes with faces marked by digits 0 through 9. Each face of each cube is marked with a single digit, and it is possible to arrange the cubes so that any chosen day of the month (from 01, 02, ... through 31) is visible on the two front faces.

Calendar cubes arranged to show Monday, 25 April – the numeric cubes give Gardner's original arrangement

	0				0				Tu
3	4	5		6	7	8		W	Th	F
	1				1				Sa
	2				2				Su
	g				f				l
j	o	y		v	a	c		t	u	b
	r				n				m
	e				s				p

One possible set of nets for the cubes (6 doubling as 9, n as u, p as d, and W as M)

A puzzle about the two-cube calendar was described in Gardner's column in Scientific American.^[1][2] In the puzzle discussed in Mathematical Circus (1992), two visible faces of one cube have digits 1 and 2 on them, and three visible faces of another cube have digits 3, 4, 5 on them. The cubes are arranged so that their front faces indicate the 25th day of the current month. The problem is to determine digits hidden on the seven invisible faces.^[1]

Gardner wrote he saw a two-cube desk calendar in a store window in New York.^[1] According to a letter received by Gardner from John S. Singleton (England), Singleton patented the calendar in 1957,^[3] but the patent lapsed in 1965.^[4][5]

A number of variations are manufactured and sold as souvenirs, differing in the appearance and the existence of additional bars or cubes to set the current month and the day of week.

Solution of the problem

Digits 1 and 2 need to be placed on both cubes to allow numbers 11 and 22. That leaves us with 4 sides of each cube (total of 8) for another 8 digits. However, digit 0 needs to be combined with all other digits, so it also needs to be placed on both cubes. That means we need to place remaining 7 digits (from 3 to 9) on the remaining 6 sides of cubes. The solution is possible because digit 6 looks like inverted 9.

Therefore, the solution of the problem is:

${\displaystyle {\begin{cases}C_{1}:=\{0,1,2,3,4,5\}\\C_{2}:=\{0,1,2,{\tfrac {6}{9}},7,8\}\\\end{cases}}}$ 

If the problem is based on another given set of visible digits, the last three digits of each cube could be shuffled between the cubes.

Three-cube variation for the month abbreviations

A variation with three cubes providing English abbreviations for the twelve months is discussed in a Scientific American column in December 1977.^[6] One solution of this variation allows displaying the first three letters of any month and relies on the fact that lower-case letters u and n and also p and d are inverses of each other.^[7]

${\displaystyle {\begin{cases}C_{1}:=\{e,g,j,o,r,y\}\\C_{2}:=\{a,c,f,{\tfrac {n}{u}},s,v\}\\C_{3}:=\{b,{\tfrac {d}{p}},l,m,{\tfrac {u}{n}},t\}\\\end{cases}}}$ 

Polish 3-letter month abbreviations (informal but commonly used for date rubber stamps - sty, lut, mar, kwi, maj, cze, lip, sie, wrz, paź, lis, gru) are also feasible, both in lower and upper case:

${\displaystyle {\begin{cases}C_{1}:=\{a,e,g,l,w,y\}\\C_{2}:=\{c,i,j,r,t,{\acute {z}}\}\\C_{3}:=\{k,m,p,s,u,z\}\\\end{cases}}}$ 

Four-cube variation

Using four cubes for two-digit day number from 01 to 31 and two-digit month number from 01 to 12, and assuming that digits 6 and 9 are indistinguishable, it is possible to represent all days of the year. One possible solution is:

${\displaystyle {\begin{cases}C_{1}:=\{0,1,X,3,4,5\}\\C_{2}:=\{0,1,2,3,4,5\}\\C_{3}:=\{0,1,2,{\tfrac {6}{9}},7,8\}\\C_{4}:=\{0,1,2,{\tfrac {6}{9}},7,8\}\\\end{cases}}}$ 

The ${\displaystyle X}$  could be any digit. The last three digits of each cube could be shuffled between the cubes such that each digit from 3 to 9 is placed on at least two different cubes.

With assumption that 6 and 9 are distinguishable characters, it is impossible to represent all days of the year because the necessary number of faces would be 25 and four cubes have only 24 faces. However, it is possible to represent almost all days in the year. There is a family of the best solutions which excludes only one day, namely Nov 11, e.g.:

${\displaystyle {\begin{cases}C_{1}:=\{0,2,3,4,5,6\}\\C_{2}:=\{0,1,3,4,5,6\}\\C_{3}:=\{0,1,2,7,8,9\}\\C_{4}:=\{0,1,2,7,8,9\}\\\end{cases}}}$ 

The last four digits of each cube could be shuffled between the cubes such that no cube has two identical faces (especially the 2's).^[8]

Two-Cube Variation for DAY-DATE Display

 

Day and Date layout for the six sides of the two cubes.

 

Real world model of the day date cubes showing Sunday, the 12th

Maintaining the condition that two visible faces of two cubes should combine to display  any possible combination of DAY-DATE clearly,  the 6 faces of each cube are divided in 4 quarters each to have 24 spaces (ie 6*4) on each cube (a total of 48 spaces ) for writing the DAY (sun, mon, tues, wed, thurs, fri and sat) and the DATE ( 1 to 31).

FOR the DAY-DATE format of display , the DAY is written adjacent to the right edge of the cube and the DATE is written adjacent to the left edge of the cube in a cyclical manner , so that the two visible faces of  the cubes combine to display all the possible combinations of DAY-DATE clearly and distinctly. The DAY and DATE can be written in any order as long as all the 7 days (sunday through saturday) are written on both the cubes and the 31 dates ( 1 through 31) are split in two groups of 15 and 16 numbers.

One of the possible solutions is:

${\displaystyle {\begin{cases}C_{1}:=\{1/2/3/4,5/6/7/8,9/10/11/12,13/14/15/16,sun/mon/tue/wed,thu/fri/sat/blank\}\\C_{2}:=\{17/18/19/20,21/22/23/24,25/26/27/28,29/30/31/blank,sun/mon/tue/wed,thu/fri/sat/blank\}\\\end{cases}}}$ 

The original video explaining how to build the day-date cubes can be found on this YouTube Channel^[9]

See also

• Sicherman dice

References

1. Gardner, Mathematical Circus, 1992, p. 186.
2. Gary Antonick (2014-10-20). "Remembering Martin Gardner". The New York Times.
3. "United Kingdom Patent 831572-A: Improvements in and relating to perpetual calendar device".
4. Gardner, Mathematical Circus, 1992, pp. 196-197.
5. Stewart, 2010, p. 35.
6. Gardner, Mathematical Circus, 1992, p. 197.
7. Martin Gardner (1985). The Magic Numbers of Dr. Matrix. Buffalo, N.Y.: Prometheus Books. pp. 210, 308. ISBN 0-87975-281-5. LCCN 84-43183.
8. "Extended Calendar Cube Question". StackExchange.
9. "Day-Date Display using Two Cubes, by Chandrakant Kanetkar". YouTube.

Sources

• Martin Gardner (1992). Mathematical Circus. Washington, DC: MAA. pp. 186, 196–197. ISBN 0-88385-506-2. LCCN 92-060996.
• Ian Stewart (2010). "Perpetual Calendar". Professor Stewart's Cabinet of Mathematical Curiosities. Profile Books. pp. 35, 260. ISBN 1847651283.

External links

• Jenny Murray. . Association of Teachers of Mathematics. Archived from the original on 2015-05-09.