Browse · harp
Printsmc
counting and probability senior
Problem
Two fair dice, each with at least faces are rolled. On each face of each die is printed a distinct integer from to the number of faces on that die, inclusive. The probability of rolling a sum of is of the probability of rolling a sum of and the probability of rolling a sum of is . What is the least possible number of faces on the two dice combined?
(A)
(B)
(C)
(D)
Solution
Suppose the dice have and faces, and WLOG . Since each die has at least faces, there will always be ways to sum to . As a result, there must be ways to sum to . There are at most nine distinct ways to get a sum of , which are possible whenever . To achieve exactly eight ways, must have faces, and . Let be the number of ways to obtain a sum of , then . Since , . In addition to , we only have to test , of which both work. Taking the smaller one, our answer becomes .
Final answer
B