February 26–March 4, 2008
Problem
Suppose there are three dice with 18 distinct integers on the faces of the three cubes. They are numbered in such a way so that it is possible to obtain any of the integers between 1 and 216, inclusive, as the sum of the integers on the top faces of these three dice with a single throw.
What can be the minimum value for the largest of these integers? (Hint: integers can be negative!)
Solution
here.
List of solvers
With a minimum of 74: Dustin Moody (graduate).
With a minimum of 75: Steve Wilmarth (undergrad), Gary Raymond (graduate), Marina Meila (faculty) Lloyd Sakazaki, Mike Goodman (outside).
Dustin Moody is the winner this week!